A parallel Cholesky algorithm for the solution of symmetric linear systems.
Khazal, R.R., Chawla, M.M. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Khazal, R.R., Chawla, M.M. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Vladimir Jovičić, Zora Konjović (1997)
The Yugoslav Journal of Operations Research
Similarity:
Heiko Goeman, Michael Clausen (2002)
Kybernetika
Similarity:
This paper deals with a new practical method for solving the longest common subsequence (LCS) problem. Given two strings of lengths and , , on an alphabet of size , we first present an algorithm which determines the length of an LCS in time and space. This result has been achieved before [ric94,ric95], but our algorithm is significantly faster than previous methods. We also provide a second algorithm which generates an LCS in time while preserving the linear space bound,...
Einstein, David, Lichtblau, Daniel, Strzebonski, Adam, Wagon, Stan (2007)
Integers
Similarity:
Sen, S.K., Du, Hongwei, Fausett, D.W. (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Gabriela Kálnová (1996)
Archivum Mathematicum
Similarity:
Summary: The paper deals with a pivoting modification of the algorithm in the class of ABS methods. Numerical experiments compare this pivoting modification with the fundamental version. A hybrid algorithm for the solution of the linear system with the Hankel matrix is introduced.
Jyrki Katajainen, Olli Nevalainen (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: