Multifrontal multithreaded rank-revealing sparse QR factorization

Dagstuhl Seminar Proceedings

Volumn 9061, Issue , 2009, Pages

  Davis, Timothy ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

multifrontal; QR factorization; sparse matrix algorithms

Indexed keywords

MATRIX ALGEBRA; SOFTWARE ARCHITECTURE;

DENSE MATRIX; FACTORIZATION ALGORITHMS; FRONTAL MATRIX; MATRIX ALGORITHMS; MULTIFRONTAL; MULTITHREADED; QR FACTORIZATIONS; RANK-REVEALING; SPARSE MATRICES; SPARSE MATRIX ALGORITHM;

FACTORIZATION;

EID: 85174053183     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Givens, W.: Computation of plane unitary rotations transforming a general matrix to triangular form. SIAM J. Appl. Math. 6 (1958) 26–50
2. Householder, A.S.: Unitary triangularization of a nonsymmetric matrix. J. ACM 5 (1958) 339–342
3. Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia, PA (2006)
4. Liu, J.W.H.: On general row merging schemes for sparse Givens transformations. SIAM J. Sci. Statist. Comput. 7 (1986) 1190–1211
5. Amestoy, P.R., Duff, I.S., Puglisi, C.: Multifrontal QR factorization in a multiprocessor environment. Numer. Linear Algebra Appl. 3 (1996) 275–300
6. Puglisi, C.: QR factorization of large sparse overdetermined and square matrices using a multifrontal method in a multiprocessor environment. PhD thesis, Institut National Polytechnique de Toulouse (1993) CERFACS report TH/PA/93/33.
7. Anderson, E., Bai, Z., Bischof, C.H., Blackford, S., Demmel, J.W., Dongarra, J.J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.C.: LAPACK Users’ Guide. 3rd edn. SIAM, Philadelphia, PA (1999)
8. Heath, M.T.: Some extensions of an algorithm for sparse linear least squares problems. SIAM J. Sci. Statist. Comput. 3 (1982) 223–237
9. Dongarra, J.J., Du Croz, J.J., Duff, I.S., Hammarling, S.: A set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 16 (1990) 1–17