论文信息 - The ijk forms of factorization methods I. Vector computers

The ijk forms of factorization methods I. Vector computers

This paper gives a detailed exposition of the “ijk forms” of LU and Choleski factorization. Several aspects of these different organizations are discussed and their properties on vector computers are compared. Extensions of the ijk formalism to other algorithms is also given.

J. M. Ortega | J. Ortega

[1] K. Fong,et al. Some linear algebraic algorithms and their performance on CRAY-1 , 1977 .

[2] J. M. Ortega,et al. The ijk forms of factorization methods II. Vector computers , 1988, Parallel Comput..

[3] Jack J. Dongarra,et al. Squeezing the most out of an algorithm in CRAY FORTRAN , 1984, ACM Trans. Math. Softw..

[4] F. Gustavson,et al. Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine , 1984 .

[5] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .

[6] A. George,et al. Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987 , 1986 .

[7] Cleve B. Moler,et al. Matrix computations with Fortran and paging , 1972, CACM.