메뉴 건너뛰기




Volumn 428, Issue 11-12, 2008, Pages 2455-2467

Block computation and representation of a sparse nullspace basis of a rectangular matrix

Author keywords

Block QR factorization; Hierarchical matrices; Orthogonal factorization

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FACTORIZATION; HIERARCHICAL SYSTEMS; MATHEMATICAL OPERATORS;

EID: 41549134448     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2007.11.025     Document Type: Article
Times cited : (10)

References (23)
  • 1
    • 41549146246 scopus 로고    scopus 로고
    • M. Adlers, Computing sparse orthogonal factors in MATLAB, Technical Report LiTHMAT-R-1998-19, Linköpings Universitet, 1998.
    • M. Adlers, Computing sparse orthogonal factors in MATLAB, Technical Report LiTHMAT-R-1998-19, Linköpings Universitet, 1998.
  • 2
    • 37249058366 scopus 로고    scopus 로고
    • Why finite element discretizations can be factored by triangular hierarchical matrices
    • Bebendorf M. Why finite element discretizations can be factored by triangular hierarchical matrices. SIAM Numer. Anal. 45 (2007) 1472-1494
    • (2007) SIAM Numer. Anal. , vol.45 , pp. 1472-1494
    • Bebendorf, M.1
  • 4
    • 41549105404 scopus 로고    scopus 로고
    • S. Börm, L. Grasedyck, W. Hackbusch, Hierarchical matrices, 2003. Lecture Notes No. 21, Max-Planck-Institute for Mathematics in the Sciences, Leipzig, Germany, available online at www.mis.mpg.de/preprints/ln/, revised version June 2006.
    • S. Börm, L. Grasedyck, W. Hackbusch, Hierarchical matrices, 2003. Lecture Notes No. 21, Max-Planck-Institute for Mathematics in the Sciences, Leipzig, Germany, available online at www.mis.mpg.de/preprints/ln/, revised version June 2006.
  • 5
    • 0000264382 scopus 로고
    • Nested dissection of a regular finite element mesh
    • George A. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. (1973) 10
    • (1973) SIAM J. Numer. Anal. , pp. 10
    • George, A.1
  • 6
    • 0001868413 scopus 로고
    • A data structure for sparse QR and LU factorizations
    • George A., Liu J., and Ng E. A data structure for sparse QR and LU factorizations. SIAM J. Sci. Stat. Comput. 9 (1988) 100-121
    • (1988) SIAM J. Sci. Stat. Comput. , vol.9 , pp. 100-121
    • George, A.1    Liu, J.2    Ng, E.3
  • 7
    • 0012709701 scopus 로고
    • On row and column orderings for sparse least squares problems
    • George A., and Ng E. On row and column orderings for sparse least squares problems. SIAM J. Numer. Anal. 20 (1983) 326-344
    • (1983) SIAM J. Numer. Anal. , vol.20 , pp. 326-344
    • George, A.1    Ng, E.2
  • 8
    • 0000687288 scopus 로고
    • On the complexity of sparse QR and LU factorization of finite element matrices
    • George A., and Ng E. On the complexity of sparse QR and LU factorization of finite element matrices. SIAM J. Sci. Stat. Comput. 9 (1988) 849-861
    • (1988) SIAM J. Sci. Stat. Comput. , vol.9 , pp. 849-861
    • George, A.1    Ng, E.2
  • 9
    • 0039506156 scopus 로고    scopus 로고
    • Separators and structure prediction in sparse orthogonal factorization
    • Gilbert J.R., Ng E.G., and Peyton B.W. Separators and structure prediction in sparse orthogonal factorization. Linear Algebra Appl. 262 (1997) 83-97
    • (1997) Linear Algebra Appl. , vol.262 , pp. 83-97
    • Gilbert, J.R.1    Ng, E.G.2    Peyton, B.W.3
  • 11
    • 0141829814 scopus 로고    scopus 로고
    • Construction and arithmetics of H-matrices
    • Grasedyck L., and Hackbusch W. Construction and arithmetics of H-matrices. Computing 70 (2003) 295-334
    • (2003) Computing , vol.70 , pp. 295-334
    • Grasedyck, L.1    Hackbusch, W.2
  • 12
    • 41549161998 scopus 로고    scopus 로고
    • L. Grasedyck, R. Kriemann, S. Le Borne, Parallel black box domain decomposition based H-LU preconditioning, Technical Report 115, Max-Planck-Institute for Mathematics in the Sciences, 2005.
    • L. Grasedyck, R. Kriemann, S. Le Borne, Parallel black box domain decomposition based H-LU preconditioning, Technical Report 115, Max-Planck-Institute for Mathematics in the Sciences, 2005.
  • 13
    • 0032637646 scopus 로고    scopus 로고
    • A sparse matrix arithmetic based on H-matrices. Part I: Introduction to H-matrices
    • Hackbusch W. A sparse matrix arithmetic based on H-matrices. Part I: Introduction to H-matrices. Computing 62 (1999) 89-108
    • (1999) Computing , vol.62 , pp. 89-108
    • Hackbusch, W.1
  • 14
    • 4243897318 scopus 로고    scopus 로고
    • An introduction to hierarchical matrices
    • Hackbusch W., Grasedyck L., and Börm S. An introduction to hierarchical matrices. Math. Bohem. 127 (2002) 229-241
    • (2002) Math. Bohem. , vol.127 , pp. 229-241
    • Hackbusch, W.1    Grasedyck, L.2    Börm, S.3
  • 15
  • 16
    • 0000114929 scopus 로고
    • Sparse orthogonal schemes for structural optimization using the force method
    • Heath M.T., Plemmons R.J., and Ward R.C. Sparse orthogonal schemes for structural optimization using the force method. SIAM J. Sci. Stat. Comput. 5 (1984) 514-532
    • (1984) SIAM J. Sci. Stat. Comput. , vol.5 , pp. 514-532
    • Heath, M.T.1    Plemmons, R.J.2    Ward, R.C.3
  • 17
    • 41549129928 scopus 로고    scopus 로고
    • P. Heggernes, P. Matstoms, Finding good column orderings for sparse QR factorization, Technical Report LiTH-MAT-R-1996-20, Department of Mathematics, Linköpings University, 1996.
    • P. Heggernes, P. Matstoms, Finding good column orderings for sparse QR factorization, Technical Report LiTH-MAT-R-1996-20, Department of Mathematics, Linköpings University, 1996.
  • 18
    • 34250173838 scopus 로고    scopus 로고
    • I. Ibragimov, S. Rjasanow, K. Straube, Hierarchical Cholesky decomposition of sparse matrices arising from curl-curl-equations, Technical Report 154, Universität des Saarlandes, J. Numer. Math. 15 (1) (2007) 31-58.
    • I. Ibragimov, S. Rjasanow, K. Straube, Hierarchical Cholesky decomposition of sparse matrices arising from curl-curl-equations, Technical Report 154, Universität des Saarlandes, J. Numer. Math. 15 (1) (2007) 31-58.
  • 19
    • 41549091843 scopus 로고    scopus 로고
    • J.G. Lewis, D.J. Pierce, D.K. Wah, Multifrontal Householder QR factorization, Technical Report ECA-TR-127, Boing Computer Services, Seattle WA, 1989.
    • J.G. Lewis, D.J. Pierce, D.K. Wah, Multifrontal Householder QR factorization, Technical Report ECA-TR-127, Boing Computer Services, Seattle WA, 1989.
  • 20
    • 0030514421 scopus 로고    scopus 로고
    • Multifrontal computation with the orthogonal factors of sparse matrices
    • Lu S.-M., and Barlow J.L. Multifrontal computation with the orthogonal factors of sparse matrices. SIAM J. Matrix Anal. Appl. 17 (2006) 658-679
    • (2006) SIAM J. Matrix Anal. Appl. , vol.17 , pp. 658-679
    • Lu, S.-M.1    Barlow, J.L.2
  • 21
    • 0028385461 scopus 로고
    • Sparse QR factorization in MATLAB
    • Matstoms P. Sparse QR factorization in MATLAB. ACM Trans. Math. Software 20 (1994) 136-159
    • (1994) ACM Trans. Math. Software , vol.20 , pp. 136-159
    • Matstoms, P.1
  • 22
    • 0037231225 scopus 로고    scopus 로고
    • Hierarchical divergence-free bases and their application to particulate flows
    • Sarin V., and Sameh A.H. Hierarchical divergence-free bases and their application to particulate flows. J. Appl. Mech. 70 (2003) 44-49
    • (2003) J. Appl. Mech. , vol.70 , pp. 44-49
    • Sarin, V.1    Sameh, A.H.2
  • 23
    • 21144477785 scopus 로고
    • Nested dissection for sparse nullspace bases
    • Stern J.M., and Vavasis S.A. Nested dissection for sparse nullspace bases. SIAM J. Matrix Anal. Appl. 14 (1993) 766-775
    • (1993) SIAM J. Matrix Anal. Appl. , vol.14 , pp. 766-775
    • Stern, J.M.1    Vavasis, S.A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.