Arithmetic complexity of unordered sparse polynomials
F.G. Gustavson, D.Y.Y. Yun
SYMSAC 1976
Recursion leads to automatic variable blocking for dense linear-algebra algorithms. The recursive way of programming algorithms eliminates using BLAS level 2 during the factorization steps. For this and other reasons recursion usually speeds up the algorithms. The Cholesky factorization algorithm for positive definite matrices and LU factorization for general matrices are formulated. Different storage data formats and recursive BLAS are explained in this paper. Performance graphes of packed and recursive Cholesky algorithms are presented. © 1999 Technika.
F.G. Gustavson, D.Y.Y. Yun
SYMSAC 1976
G. Almasi, G. Almasi, et al.
Digest of Technical Papers - IEEE International Solid-State Circuits Conference
R.C. Agarwal, F.G. Gustavson, et al.
IBM Systems Journal
R.C. Agarwal, F.G. Gustavson
ACM/IEEE SC 1989