On the computation of null spaces of sparse rectangular matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 30, Issue 2, 2008, Pages 445-463

  Gotsman, Craig ^a   Toledo, Sivan ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Inverse iteration; LU factorization; Null space; Rectangular matrices; sparse matrices polynomial

Indexed keywords

INVERSE ITERATION; LU FACTORIZATION; NULL SPACE; RECTANGULAR MATRICES; SPARSE MATRICES POLYNOMIAL;

FACTORIZATION;

MATRIX ALGEBRA;

EID: 67649226060     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050638369     Document Type: Article

References (44)

1. C. J. ALPERT and S.-Z. YAO, Spectral partitioning: The more eigenvectors, the better, in DAC '95: Proceedings of the 32nd ACM/IEEE conference on Design automation, ACM Press, New York, 1995, pp. 195-200.
2. P. R. AMESTOY and C. PUGLISI, An unsymmetrized multifrontal LU factorization, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 553-569.
3. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL. J. DONGARRA. J. D. CROZ. A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, and D. SORENSEN, LAPACK Users' Guide, 2nd ed., SIAM, Philadelphia, 1994; also available online from http://www.netlib.org.
4. J. L. BARLOW and U. B. VEMULAPATI, Rank detection methods for sparse matrices, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1279-1297.
5. J. L. BARLOW and H. ZHA, Growth in Gaussian elimination, orthogonal matrices, and the 2-norm, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 807-815.
6. D. S. BERNSTEIN, Matrix Mathematics: Theory, Facts, and Formulas with Applications to Linear Systems Theory, Princeton University Press, Princeton, NJ, 2005.
7. M. W. BERRY, M. T. HEATH, I. KANEKO. M. LAWO. R. J. PLEMMONS. and R. C. WARD, An algorithm to compute a sparse basis of the null space, Numer. Math., 47 (1985), pp. 483-504.
8. C. H. BISCHOF, Incremental condition estimation, SIAM J. Matrix Anal. Appl.. 11 (1990). pp. 312-322.
9. C. H. BISCHOF, J. G. LEWIS, and D. J. PIERCE, Incremental condition estimation for sparse matrices, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 644-659.
10. A. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
11. T. F. CHAN, Deflated decomposition of solutions of nearly singular systems, SIAM J. Numer. Anal., 21 (1984), pp. 738-754.
12. T. F. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
13. F. R. K. CHUNG, Spectral Graph Theory, CBMS Regional Conf. Ser. in Math. 92. AMS, Providence, RI, 1997.
14. T. F. COLEMAN AND A. POTHEN, The null space problem I. Complexity, SIAM J. Algebraic Discrete Methods, 7 (1986), pp. 527-537.
15. T. F. COLEMAN AND A. POTHEN, The null space problem II. Algorithms, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 544-563.
16. Y. COLIN DE VERDIÈRE, Sur un nouvel invariant des graphes et un critère de planarité, J. Combin. Theory Ser. B, 50 (1990), pp. 11-21. English translation in Graph Structure Theory, N. Robertson and P. D. Seymour, eds., Contemp. Math. 147, AMS, Providence, RI, 1993, pp. 137-148.
17. R. CONNELLY, Rigidity and energy, Invent. Math., 66 (1982), pp. 11-33.
18. T. A. DAVIS, A column pre-ordering strategy for the unsymmetric-pattern multifrontal method, ACM Trans. Math. Software, 30 (2004), pp. 165-195.
19. J. W. DEMMEL, S. C. EISENSTAT, J. R. GILBERT, X. S. LI. and J. W. H. LIU, A supernodal approach to sparse partial pivoting, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 720-755.
20. J. W. DEMMEL, J. R. GILBERT, and X. S. LI, An asynchronous parallel supernodal algorithm for sparse Gaussian elimination, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 915-952.
21. L. V. FOSTER, Rank and null space calculations using matrix decompositions without column interchanges, Linear Algebra Appl., 74 (1986), pp. 47-71.
22. J. FRIEDMAN, Computing Betti numbers via combinatorial Laplacians. Algorithmica, 21 (1998), pp. 331-346.
23. A. GEORGE and E. NG, An implementation of Gaussian elimination with partial pivoting for sparse systems, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 390-409.
24. A. GEORGE and E. NG, On the complexity of sparse QR and LU factorization of finite-element matrices, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 849-861.
25. J. R. GILBERT and M. T. HEATH, Computing a sparse basis for the null space. SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 446-459.
26. J. R. GILBERT and E. NG, Predicting structure in nonsymmetric sparse matrix factorizations, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, New York, 1993, pp. 107-139.
27. G. H. GOLUB AND C. F. V. LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
28. S. J. GORTLER, C. GOTSMAN, and D. THURSTON, Discrete one-forms on meshes and applications to 3D mesh parameterization , Comput. Aided Geom. Design, 33 (2006), pp. 83-112.
29. C. GOTSMAN, X. GU, and A. SHEFFER, Fundamentals of spherical parameterization for 3D meshes, ACM Trans. Graphics, 22 (2003), pp. 358-363.
30. X. GU AND S.-T. YAU, Computing conformal structures of surfaces, Commun. Inf. Syst., 2 (2002), pp. 121-146.
31. A. GUPTA, Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 529-552.
32. A. GUPTA, Recent advances in direct methods for solving unsymmetric sparse systems of linear equations, ACM Trans. Math. Software, 28 (2002), pp. 301-324.
33. K. M. HALL, An r-dimensional quadratic placement algorithm, Management Sci., 17 (1970), pp. 219-229.
34. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
35. I. C. F. IPSEN, Computing an eigenvector with inverse iteration, SIAM Rev., 39 (1997), pp. 254-291.
36. R. B. LEHOUCQ, D. C. SORENSEN, and C. YANG, ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998.
37. L. LOVÁSZ and A. SCHRIJVER, On the null space of a Colin de Verdiere matrix, Ann. Inst. Fourier (Grenoble), 49 (1999), pp. 1017-1026.
38. G. PETERS and J. H. WILKINSON, The least-squares problem and pseudo-inverses, Comput. J., 13 (1970), pp. 309-316.
39. D. J. PIERCE and J. G. LEWIS, Sparse multifrontal rank revealing QR factorization, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 159-180.
40. M. A. SAUNDERS, Sparse least squares by conjugate gradients: A comparison of preconditioning methods, in Proceedings of Computer Science and Statistics: 12th Annual Symposium on the Interface, J. F. Gentleman, ed., University of Waterloo, Waterloo, ON, Canada, 1979, pp. 15-20.
41. H. SCHWETLICK and U. SCHNABEL, Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix, Linear Algebra Appl., 371 (2003), pp. 1-30.
42. G. STEWART, Rank degeneracy, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 403-413.
43. G. W. STEWART, Matrix Algorithms, Volume II: Eigensystems, SIAM, Philadelphia, 2001.
44. G. TEWARI, C. GOTSMAN, and S. GORTLER, Meshing genus-1 point clouds using discrete oneforms, Computers and Graphics, 30 (2006), pp. 917-926.