메뉴 건너뛰기




Volumn 28, Issue 2, 2006, Pages 524-550

MIQR: A multilevel incomplete QR preconditioner for large sparse least-squares problems

Author keywords

CGLS; Incomplete QR; Iterative mothods; Large least squares problems; Multilevel incomplete QR factorization; Normal equations; Orthogonal factorization; Preconditioning; QR factorization

Indexed keywords

CGLS; INCOMPLETE QR; MULTILEVEL INCOMPLETE QR FACTORIZATION; NORMAL EQUATIONS; ORTHOGONAL FACTORIZATION; PRECONDITIONING; QR FACTORIZATION; SPARSITY;

EID: 34247388040     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050633032     Document Type: Article
Times cited : (28)

References (35)
  • 1
    • 0000779223 scopus 로고
    • Algebraic multilevel preconditioning methods
    • O. AXELSSON AND P. VXSSILEVSKI, Algebraic multilevel preconditioning methods. I. Numer. Math., 56 (1989), pp. 157-177.
    • (1989) I. Numer. Math , vol.56 , pp. 157-177
    • AXELSSON, O.1    VXSSILEVSKI, P.2
  • 2
    • 0001573921 scopus 로고
    • Algebraic multilevel preconditioning methods
    • O. AXELSSON AND P. S. VASSILEVSKI, Algebraic multilevel preconditioning methods, II, SIAM J. Numer. Anal., 27 (1990), pp. 1569-1590.
    • (1990) II, SIAM J. Numer. Anal , vol.27 , pp. 1569-1590
    • AXELSSON, O.1    VASSILEVSKI, P.S.2
  • 3
    • 0033433038 scopus 로고    scopus 로고
    • Multilevel ILU decomposition
    • R. BANK AND C. WAGNER, Multilevel ILU decomposition, Numer. Math., 82 (1999), pp. 543-576.
    • (1999) Numer. Math , vol.82 , pp. 543-576
    • BANK, R.1    WAGNER, C.2
  • 4
    • 2342529812 scopus 로고    scopus 로고
    • A robust preconditioner with low memory requirements for large sparse least squares problems
    • M. BENZI AND M. TŮMA, A robust preconditioner with low memory requirements for large sparse least squares problems, SIAM J. Sci. Comput., 25 (2003), pp. 499-512.
    • (2003) SIAM J. Sci. Comput , vol.25 , pp. 499-512
    • BENZI, M.1    TŮMA, M.2
  • 7
    • 0018711879 scopus 로고
    • Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
    • A. BJÖRCK AND T. ELFVING, Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations, BIT, 19 (1979), pp. 145-163.
    • (1979) BIT , vol.19 , pp. 145-163
    • BJÖRCK, A.1    ELFVING, T.2
  • 8
    • 0035889740 scopus 로고    scopus 로고
    • A robust ILU with pivoting based on monitoring the growth of the inverse factors
    • M. BOLLHÖFER, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Linear Algebra Appl., 338 (2001), pp. 201-213.
    • (2001) Linear Algebra Appl , vol.338 , pp. 201-213
    • BOLLHÖFER, M.1
  • 9
    • 33746787907 scopus 로고    scopus 로고
    • Multilevel preconditioned constructed from inverse-based ILUs
    • M. BOLLHÖFER AND Y. SAAD, Multilevel preconditioned constructed from inverse-based ILUs, SIAM J. Sci. Comput., 27 (2006), pp. 1627-1650.
    • (2006) SIAM J. Sci. Comput , vol.27 , pp. 1627-1650
    • BOLLHÖFER, M.1    SAAD, Y.2
  • 10
    • 0000713765 scopus 로고
    • Row projection methods for large nonsymmetric linear systems
    • R. BRAMLEY AND A, SAMEH, Row projection methods for large nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 168-193.
    • (1992) SIAM J. Sci. Statist. Comput , vol.13 , pp. 168-193
    • BRAMLEY, R.1    SAMEH, A.2
  • 11
    • 0000421410 scopus 로고
    • Estimation of sparse Jacobian matrices and graph coloring problems
    • T. F. COLEMAN AND J. J. MORE, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J. Numer. Anal., 20 (1983), pp. 187-209.
    • (1983) SIAM J. Numer. Anal , vol.20 , pp. 187-209
    • COLEMAN, T.F.1    MORE, J.J.2
  • 12
    • 84947936389 scopus 로고    scopus 로고
    • New serial and parallel recursive QR factorization algorithms for BMP systems
    • Applied Parallel Computing, Springer-Verlag, Berlin
    • E. ELMROTH AND F. GUSTAVSON, New serial and parallel recursive QR factorization algorithms for BMP systems, in Applied Parallel Computing, Lecture Notes in Comput. Sci. 1541. Springer-Verlag, Berlin, 1998, pp. 120-128.
    • (1998) Lecture Notes in Comput. Sci , vol.1541 , pp. 120-128
    • ELMROTH, E.1    GUSTAVSON, F.2
  • 13
    • 0034224207 scopus 로고    scopus 로고
    • Applying recursion to serial and parallel QR factorization leads to better performance
    • E. ELMROTH AND F. GUSTAVSON, Applying recursion to serial and parallel QR factorization leads to better performance, IBM J. Res. Develop., 44 (2000), p, 605-624.
    • (2000) IBM J. Res. Develop , vol.44 , pp. 605-624
    • ELMROTH, E.1    GUSTAVSON, F.2
  • 14
    • 28244465516 scopus 로고    scopus 로고
    • What color is your Jacobian? Graph coloring for computing derivatives
    • A. H. GEBREMEDHIN, F. MANNE, AND A. POTHEN, What color is your Jacobian? Graph coloring for computing derivatives, SIAM Rev., 47 (2005), pp. 629-705.
    • (2005) SIAM Rev , vol.47 , pp. 629-705
    • GEBREMEDHIN, A.H.1    MANNE, F.2    POTHEN, A.3
  • 15
    • 0004236492 scopus 로고    scopus 로고
    • 3rd ed, The Johns Hopkins University Press, Baltimore, MD
    • G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
    • (1996) Matrix Computations
    • GOLUB, G.H.1    VAN LOAN, C.F.2
  • 16
    • 2342464426 scopus 로고
    • On the computation of breeding values
    • Proceedings of CONPAR 90, VAPP IV, Joint International Conference on Vector and Parallel Processing, Springer-Verlag, New York
    • M. HEGLAND, On the computation of breeding values, in Proceedings of CONPAR 90 - VAPP IV, Joint International Conference on Vector and Parallel Processing, Lecture Notes in Comput. Sci. 457, Springer-Verlag, New York, 1990, pp. 232-242.
    • (1990) Lecture Notes in Comput. Sci , vol.457 , pp. 232-242
    • HEGLAND, M.1
  • 19
    • 0001809440 scopus 로고
    • An improved incomplete Cholesky factorization
    • M. JONES AND P. PLASSMANN, An improved incomplete Cholesky factorization, ACM Trans. Math. Software, 21 (1995), pp. 5-17.
    • (1995) ACM Trans. Math. Software , vol.21 , pp. 5-17
    • JONES, M.1    PLASSMANN, P.2
  • 20
    • 34247372170 scopus 로고
    • Ph.D. thesis, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, IL
    • C. KAMATH, Solution of Nonsymmetric Systems of Equations on a Multiprocessor, Ph.D. thesis, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, IL, 1986.
    • (1986) Solution of Nonsymmetric Systems of Equations on a Multiprocessor
    • KAMATH, C.1
  • 21
    • 0024606847 scopus 로고
    • A projection method for solving nonsymmetric linear systems on multiprocessors
    • C. KAMATH AND A. H. SAMEH, A projection method for solving nonsymmetric linear systems on multiprocessors, Parallel Comput., 9 (1989), pp. 291-312.
    • (1989) Parallel Comput , vol.9 , pp. 291-312
    • KAMATH, C.1    SAMEH, A.H.2
  • 22
    • 0024641233 scopus 로고
    • Independent set orderings for parallel matrix factorizations by Gaussian elimination
    • R. LEUZE, Independent set orderings for parallel matrix factorizations by Gaussian elimination, Parallel Comput., 10 (1989), pp. 177-191.
    • (1989) Parallel Comput , vol.10 , pp. 177-191
    • LEUZE, R.1
  • 23
    • 43249113370 scopus 로고    scopus 로고
    • Least squares conformal maps for automatic texture atlas generation
    • B. LÉVY, S. PETITJEAN, N. RAY, AND J. MAILLOT, Least squares conformal maps for automatic texture atlas generation, in ACM Trans. Graphics, 21 (2002), pp. 362-371.
    • (2002) ACM Trans. Graphics , vol.21 , pp. 362-371
    • LÉVY, B.1    PETITJEAN, S.2    RAY, N.3    MAILLOT, J.4
  • 24
    • 0000421739 scopus 로고
    • A fast algorithm for reordering sparse matrices for parallel factorization
    • J. G. LEWIS, B. W. PEYTON, AND A. POTHEN, A fast algorithm for reordering sparse matrices for parallel factorization, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 1146-1173.
    • (1989) SIAM J. Sci. Statist. Comput , vol.10 , pp. 1146-1173
    • LEWIS, J.G.1    PEYTON, B.W.2    POTHEN, A.3
  • 25
    • 0142053971 scopus 로고    scopus 로고
    • pARMS: A parallel version of the algebraic recursive multilevel solver
    • Z. LI, Y. SAAD, AND M. SOSONKINA, pARMS: A parallel version of the algebraic recursive multilevel solver, Numer. Linear Algebra Appl., 10 (2003), pp. 485-509.
    • (2003) Numer. Linear Algebra Appl , vol.10 , pp. 485-509
    • LI, Z.1    SAAD, Y.2    SOSONKINA, M.3
  • 26
    • 84966241510 scopus 로고
    • An incomplete factorization technique for positive definite linear systems
    • T. A. MANTEUFFEL, An incomplete factorization technique for positive definite linear systems, Math. Comp., 34 (1980), pp. 473-497.
    • (1980) Math. Comp , vol.34 , pp. 473-497
    • MANTEUFFEL, T.A.1
  • 27
    • 0004722027 scopus 로고
    • Convergence of block iterative methods applied to sparse least-squares problems
    • W. NIETHAMMER, J. DE PILLIS, AND R. VARGA, Convergence of block iterative methods applied to sparse least-squares problems, Linear Algebra Appl., 58 (1984), pp. 327-341.
    • (1984) Linear Algebra Appl , vol.58 , pp. 327-341
    • NIETHAMMER, W.1    DE PILLIS, J.2    VARGA, R.3
  • 28
    • 0039943513 scopus 로고
    • LSQR: An algorithm for sparse linear equations and sparse least squares
    • C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
    • (1982) ACM Trans. Math. Software , vol.8 , pp. 43-71
    • PAIGE, C.C.1    SAUNDERS, M.A.2
  • 30
    • 0002598644 scopus 로고
    • Preconditioning techniques for indefinite and nonsymmetric linear systems
    • Y. SAAD, Preconditioning techniques for indefinite and nonsymmetric linear systems, J. Comput. Appl. Math., 24 (1988), pp. 89-105.
    • (1988) J. Comput. Appl. Math , vol.24 , pp. 89-105
    • SAAD, Y.1
  • 32
    • 34247335820 scopus 로고    scopus 로고
    • Y. SAAD AND M. SOSONKINA, Enhanced Preconditioners for Large Sparse Least Squares Problems, Tech. Report umsi-2001-1, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 2001.
    • Y. SAAD AND M. SOSONKINA, Enhanced Preconditioners for Large Sparse Least Squares Problems, Tech. Report umsi-2001-1, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 2001.
  • 33
    • 0012122048 scopus 로고    scopus 로고
    • ARMS: An algebraic recursive multilevel solver for general sparse linear systems
    • Y. SAAD AND B. SUCHOMEL, ARMS: An algebraic recursive multilevel solver for general sparse linear systems, Numer. Linear Algebra Appl., 9 (2002), pp. 359-378.
    • (2002) Numer. Linear Algebra Appl , vol.9 , pp. 359-378
    • SAAD, Y.1    SUCHOMEL, B.2
  • 34
    • 0036321185 scopus 로고    scopus 로고
    • Simple preconditioners for the conjugate gradient method: Experience with test day models
    • I. STRANDÉN, S. TSURUTA, AND I. MISZTAL, Simple preconditioners for the conjugate gradient method: Experience with test day models, J. Anim. Breed. Genet., 119 (2002), pp. 166-174.
    • (2002) J. Anim. Breed. Genet , vol.119 , pp. 166-174
    • STRANDÉN, I.1    TSURUTA, S.2    MISZTAL, I.3
  • 35
    • 0031082735 scopus 로고    scopus 로고
    • CIMGS: An incomplete orthogonal factorization preconditioner
    • X. WANG, K. A. GALLIVAN, AND R. BRAMLEY, CIMGS: An incomplete orthogonal factorization preconditioner, SIAM J. Sci. Comput., 18 (1997), pp. 516-536.
    • (1997) SIAM J. Sci. Comput , vol.18 , pp. 516-536
    • WANG, X.1    GALLIVAN, K.A.2    BRAMLEY, R.3


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