Experience with a Recursive Perturbation Based Algorithm for Symmetric Indefinite Linear Systems⋆

1. Andersen, B., Gustavson, F., Waśniewski, J.: A recursive formulation of the Cholesky factorization operating on a matrix in packed storage form, in. Parallel Processing for Scientific Computing, Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX, USA, March 24-27, 1999

   Google Scholar 

2. Andersen, B., Gustavson, F., Waśniewski, J., Yalamov, P.: Recursive formulation of some dense linear algebra algorithms, in. Parallel Processing for Scientific Computing, Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX, USA, March 24-27, 1999

   Google Scholar 

3. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Ostrouchov, S., Sorensen, D.: LAPACK Users’ Guide Release 2.0. SIAM, Philadelphia, 1995

   Google Scholar 

4. Balle, S., Hansen, P.: A Strassen-type matrix inversion algorithm for the Connection Machine. Report UNIC-93-11, October 1993

   Google Scholar 

5. Elmroth, E., Gustavson, F.: New serial and parallel recursive QR factorization algorithms for SMP systems. In: Applied Parallel Computing, (Eds. B. Kågstrüm et. al.),Lecture Notes in Computers Science, v. 1541, Springer, 1998.

   Google Scholar 

6. Golub, G., Van Loan, C.: Matrix Computations, 3rd edition. John Hopkins University Press, Baltimore, 1996

   MATH  Google Scholar 

7. Gustavson, F.: Recursion leads to automatic variable blocking for dense linearalgebra algorithms. IBM J. Res. Develop. 41 (1997), pp. 737–755

   Article  Google Scholar 

8. Hansen, P., Yalamov, P.: Stabilization by perturbation of a 4n ² Toeplitz solver. Preprint N25, Technical University of Russe, January 1995

   Google Scholar 

Download references