Journal
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
Volume 38, Issue 1, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2049662.2049670
Keywords
Algorithms; Experimentation; Performance; QR factorization; least-square problems; sparse matrices
Funding
- National Science Foundation [0203270, 0620286, 0619080]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0203270] Funding Source: National Science Foundation
- Division Of Mathematical Sciences
- Direct For Mathematical & Physical Scien [0619080, 1115297] Funding Source: National Science Foundation
Ask authors/readers for more resources
SuiteSparseQR is a sparse QR factorization package based on the multifrontal method. Within each frontal matrix, LAPACK and the multithreaded BLAS enable the method to obtain high performance on multicore architectures. Parallelism across different frontal matrices is handled with Intel's Threading Building Blocks library. The symbolic analysis and ordering phase pre-eliminates singletons by permuting the input matrix Ainto the form inverted right perpendicularR(11) R-12; 0 A(22)inverted left perpendicular where R-11 is upper triangular with diagonal entries above a given tolerance. Next, the fill-reducing ordering, column elimination tree, and frontal matrix structures are found without requiring the formation of the pattern of A(T) A. Approximate rank-detection is performed within each frontal matrix using Heath's method. While Heath's method is not always exact, it has the advantage of not requiring column pivoting and thus does not interfere with the fill-reducing ordering. For sufficiently large problems, the resulting sparse QR factorization obtains a substantial fraction of the theoretical peak performance of a multicore computer.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available