Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization

ACM Transactions on Mathematical Software

Volumn 38, Issue 1, 2011, Pages

  Davis, Timothy A ^a  

^a University of Florida   (United States)

Author keywords

Least square problems; QR factorization; Sparse matrices

Indexed keywords

ELIMINATION TREE; FRONTAL MATRIX; INPUT MATRICES; LEAST SQUARE PROBLEMS; MULTI CORE; MULTICORE ARCHITECTURES; MULTIFRONTAL METHODS; MULTITHREADED; ORDERING PHASE; PEAK PERFORMANCE; QR FACTORIZATIONS; RANK-REVEALING; S-METHOD; SPARSE MATRICES; SYMBOLIC ANALYSIS; THREADING BUILDING BLOCKS;

FACTORIZATION; LEAST SQUARES APPROXIMATIONS; SOFTWARE ARCHITECTURE;

MATRIX ALGEBRA;

EID: 84855243155     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/2049662.2049670     Document Type: Article

References (62)

1. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996a. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 4, 886-905.
2. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 2004. Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 381-388.
3. AMESTOY, P. R. AND DUFF, I. S. 1989. Vectorization of a multiprocessor multifrontal code. Intl. J. Supercomp. Appl. 3, 3, 41-59.
4. AMESTOY, P. R., DUFF, I. S., AND PUGLISI, C. 1996b. Multifrontal QR factorization in a multiprocessor environment. Numer. Linear Algebra Appl. 3, 4, 275-300.
5. AMESTOY, P. R. AND PUGLISI, C. 2002. An unsymmetrized multifrontal LU factorization. SIAM J. Matrix Anal. Appl. 24, 553-569. (Pubitemid 36446422)
6. ANDERSON, E., BAI, Z., BISCHOF, C. H., BLACKFORD, S., DEMMEL, J. W., DONGARRA, J. J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSEN, D. C. 1999. LAPACK Users' Guide 3rd Ed. SIAM, Philadelphia, PA.
7. ASHCRAFT, C. C. AND GRIMES, R. 1989. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Softw. 15, 4, 291-309. (Pubitemid 20636831)
8. BISCHOF, C. H., LEWIS, J. G., AND PIERCE, D. J. 1990. Incremental condition estimation for sparse matrices. SIAM J. Matrix Anal. Appl. 11, 4, 644-659.
9. BISCHOF, C. H. AND VAN LOAN, C. F. 1987. The WY representation for products of Householder vectors. SIAM J. Sci. Statist. Comput. 8, 1, s2-s13.
10. BJÖRCK, A. 1996. Numerical Methods for Least Squares Problems. SIAM, Philadelphia, PA.
11. BLACKFORD, L. S., CHOI, J., CLEARY, A., D'AZEVEDO, E., DEMMEL, J., DHILLON, I., DONGARRA, J., HAMMARLING, S., HENRY, G., PETITET, A., STANLEY, K.,WALKER, D., ANDWHALEY, R. C. 1997. ScaLAPACK User's Guide. SIAM, Philadelphia, PA.
12. CHAPMAN, B., JOST, G., AND VAN DER PAS, R. 2007. Using OpenMP: Portable Shared Memory Parallel Programming. MIT Press, Cambridge, MA.
13. CHEN, Y., DAVIS, T. A., HAGER, W. W., AND RAJAMANICKAM, S. 2008. Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate. ACM Trans. Math. Softw. 35, 3, 1-14.
14. COLEMAN, T. F., EDENBRANDT, A., AND GILBERT, J. R. 1986. Predicting fill for sparse orthogonal factorization. J. ACM 33, 517-532. (Pubitemid 16589618)
15. DAVIS, T. A. 2004. A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30, 2, 165-195.
16. DAVIS, T. A. 2006. Direct Methods for Sparse Linear Systems. SIAM, Philadelphia, PA.
17. DAVIS, T. A. AND DUFF, I. S. 1997. An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM J. Matrix Anal. Appl. 18, 1, 140-158.
18. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. G. 2004a. Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 377-380.
19. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. G. 2004b. A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 353-376.
20. DAVIS, T. A. AND HAGER, W. W. 1999. Modifying a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 20, 3, 606-627. (Pubitemid 129332594)
21. DAVIS, T. A. AND HAGER, W. W. 2001. Multiple-rank modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 22, 997-1013.
22. DAVIS, T. A. AND HAGER,W.W. 2009. Dynamic supernodes in sparse cholesky update/downdate and triangular solves. ACM Trans. Math. Softw. 35, 4, 1-23.
23. DAVIS, T. A. ANDHU, Y. 2011. TheUniversity of Florida sparse matrix collection. ACMTrans.Math. Softw. 28, 1.
24. DONGARRA, J. J., DU CROZ, J. J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1-17. (Pubitemid 20684794)
25. DUFF, I. S. 1977. On permutations to block triangular form. J. Inst. Math. Appl. 19, 339-342.
26. DUFF, I. S. 1981. On algorithms for obtaining amaximum transversal. ACMTrans.Math. Softw. 7, 1, 315-330.
27. DUFF, I. S. 2004. MA57 - A code for the solution of sparse symmetric definite and indefinite systems. ACM Trans. Math. Softw. 30, 2, 118-144.
28. DUFF, I. S. AND REID, J. K. 1983. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302-325. (Pubitemid 14454003)
29. DUFF, I. S. AND REID, J. K. 1984. The multifrontal solution of unsymmetric sets of linear equations. SIAM J. Sci. Statist. Comput. 5, 3, 633-641.
30. EDLUND, O. 2002. A software package for sparse orthogonal factorization and updating. ACM Trans. Math. Softw. 28, 4, 448-482. (Pubitemid 135688494)
31. FOSTER, L. V. 2009. Calculating ranks, null spaces, and pseudoinverse solutions for sparse matrices using SuiteSparseQR. http://www.math.sjsu.edu/? foster/spqr rank LA09.pdf.
32. GEIST, G. A. AND NG, E. G. 1989. Task scheduling for parallel sparse Cholesky factorization. Intl. J. Parall. Program. 18, 4, 291-314. (Pubitemid 20721699)
33. GEORGE, A. 1973. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10, 2, 345-363.
34. GEORGE, A. AND HEATH, M. T. 1980. Solution of sparse linear least squares problems using Givens rotations. Linear Algebra Appl. 34, 69-83.
35. GEORGE, A. AND LIU, J.W.H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ.
36. GEORGE, A., LIU, J. W. H., AND NG, E. G. 1988. A data structure for sparse QR and LU factorizations. SIAM J. Sci. Statist. Comput. 9, 1, 100-121.
37. GEORGE, A. AND NG, E. G. 1987. Symbolic factorization for sparse Gaussian elimination with partial pivoting. SIAM J. Sci. Statist. Comput. 8, 6, 877-898.
38. GILBERT, J. R., LI, X. S., NG, E. G., AND PEYTON, B. W. 2001. Computing row and column counts for sparse QR and LU factorization. BIT 41, 4, 693-710. (Pubitemid 33631361)
39. GILBERT, J. R.,MOLER, C., AND SCHREIBER, R. 1992. Sparse matrices in MATLAB: Design and implementation. SIAM J. Matrix Anal. Appl. 13, 1, 333-356.
40. GIVENS, W. 1958. Computation of plane unitary rotations transforming a general matrix to triangular form. SIAM J. Appl. Math. 6, 26-50.
41. GOLUB, G. H. 1965. Numerical methods for solving linear least squares problems. Numer. Math. 7, 206-216.
42. GOTO, K. AND VAN DE GEIJN, R. 2008. High performance implementation of the level-3 BLAS. ACM Trans. Math. Softw. 35, 1, 4. Article 4, 14 pages.
43. GRIGORI, L., COSNARD, M., AND NG, E. G. 2007. On the row merge tree for sparse LU factorization with partial pivoting. BIT 47, 1, 45-76.
44. HEATH, M. T. 1982. Some extensions of an algorithm for sparse linear least squares problems. SIAM J. Sci. Statist. Comput. 3, 2, 223-237.
45. HEATH, M. T. AND SORENSEN, D. C. 1986. A pipelined Givens method for computing the QR factorization of a sparse matrix. Linear Algebra Appl. 77, 189-203.
46. HOUSEHOLDER, A. S. 1958. Unitary triangularization of a nonsymmetric matrix. J. ACM 5, 339-342.
47. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392. (Pubitemid 128689516)
48. LIPTON, R. J., ROSE, D. J., AND TARJAN, R. E. 1979. Generalized nested dissection. SIAM J. Numer. Anal. 16, 346-358.
49. LIU, J. W. H. 1986. On general row merging schemes for sparse Givens transformations. SIAM J. Sci. Statist. Comput. 7, 4, 1190-1211.
50. LIU, J. W. H. 1989. The multifrontal method and paging in sparse Cholesky factorization. ACM Trans. Math. Softw. 15, 4, 310-325.
51. LU, S. M. AND BARLOW, J. L. 1996. Multifrontal computation with the orthogonal factors of sparse matrices. SIAM J. Matrix Anal. Appl. 17, 3, 658-679.
52. MATSTOMS, P. 1994. Sparse QR factorization in MATLAB. ACM Trans. Math. Softw. 20, 1, 136-159.
53. MATSTOMS, P. 1995. Parallel sparse QR factorization on shared memory architectures. Parallel Comput. 21, 3, 473-486.
54. OLIVEIRA, S. 2001. Exact prediction of QR fill-in by row-merge trees. SIAM J. Sci. Comput. 22, 6, 1962-1973. (Pubitemid 34050948)
55. PIERCE, D. J. AND LEWIS, J. G. 1997. Sparse multifrontal rank revealing QR factorization. SIAM J. Matrix Anal. Appl. 18, 1, 159-180.
56. POTHEN, A. AND FAN, C. 1990. Computing the block triangular form of a sparse matrix. ACM Trans. Math. Softw. 16, 4, 303-324.
57. REINDERS, J. 2007. Intel Threading Building Blocks. Outfitting C++ for Multi-core Processor Parallelism. O'Reilly Media, Sebastopol, CA.
58. ROBISON, A. 2008. Architect of Intel's threading building blocks. personal communication.
59. SCHREIBER, R. AND VAN LOAN, C. F. 1989. A storage-efficient WY representation for products of Householder matrices. SIAM J. Sci. Statist. Comput. 10, 1, 53-57.
60. STEWART, G. W. 1998. Matrix Algorithms, Volume 1: Basic Decompositions. SIAM, Philadelphia, PA.
61. SUN, C. 1996. Parallel sparse orthogonal factorization on distributed-memory multiprocessors. SIAM J. Sci. Comput. 17, 3, 666-685. (Pubitemid 126621174)
62. VAN DE GEIJN, R. A. 1997. Using PLAPACK. Scientific and Engineering Computation Series. MIT Press, Cambridge, MA.