메뉴 건너뛰기




Volumn 2565, Issue , 2003, Pages 315-327

Toward memory-efficient linear solvers

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS;

EID: 27144457710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36569-9_20     Document Type: Article
Times cited : (3)

References (38)
  • 1
    • 0007027659 scopus 로고    scopus 로고
    • Optimizing a parallel conjugate gradient solver
    • Field, M.: Optimizing a parallel conjugate gradient solver. SIAM J. Sci. Stat. Comput. 19 (1998) 27-37
    • (1998) SIAM J. Sci. Stat. Comput. , vol.19 , pp. 27-37
    • Field, M.1
  • 2
    • 0038961572 scopus 로고
    • A new approach to construction of efficient iterative schemes for massively parallel applications: Variable block CG and BiCG methods and variable block Arnoldi procedure
    • R. Sincovec et al., ed.
    • Simon, H., Yeremin, A.: A new approach to construction of efficient iterative schemes for massively parallel applications: variable block CG and BiCG methods and variable block Arnoldi procedure. In R. Sincovec et al., ed.: Parallel Processing for Scientific Computing. (1993) 57-60
    • (1993) Parallel Processing for Scientific Computing , pp. 57-60
    • Simon, H.1    Yeremin, A.2
  • 3
    • 55849129511 scopus 로고    scopus 로고
    • Achieving high sustained performance in an unstructured mesh CFD application
    • Also published as Mathematics and Computer Science Division, Argonne National Laboratory, Technical Report ANL/MCS-P776-0899
    • Anderson, W.K., Gropp, W.D., Kaushik, D., Keyes, D.E., Smith, B.F.: Achieving high sustained performance in an unstructured mesh CFD application. In: Proceedings of Supercomputing 99. (1999) Also published as Mathematics and Computer Science Division, Argonne National Laboratory, Technical Report ANL/MCS-P776-0899
    • (1999) Proceedings of Supercomputing 99
    • Anderson, W.K.1    Gropp, W.D.2    Kaushik, D.3    Keyes, D.E.4    Smith, B.F.5
  • 4
    • 0034405892 scopus 로고    scopus 로고
    • A two-level domain decomposition method for the iterative solution of high frequency exterior Helmholtz problems
    • Farhat, C., Macedo, A., Lesoinne, M.: A two-level domain decomposition method for the iterative solution of high frequency exterior Helmholtz problems. Numerische Mathematik 85 (2000) 283-308
    • (2000) Numerische Mathematik , vol.85 , pp. 283-308
    • Farhat, C.1    Macedo, A.2    Lesoinne, M.3
  • 5
    • 0000257176 scopus 로고
    • Block reduction of matrices to condensed form for eigenvalue computations
    • Dongarra, J., Hammarling, S., Sorensen, D.: Block reduction of matrices to condensed form for eigenvalue computations. J. Comp. Appl. Math. 27 (1989) 215-227
    • (1989) J. Comp. Appl. Math. , vol.27 , pp. 215-227
    • Dongarra, J.1    Hammarling, S.2    Sorensen, D.3
  • 14
    • 0000135303 scopus 로고
    • Methods of conjugate gradients for solving linear systems
    • Hestenes, M., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stds. 49; (1952) 409-436
    • (1952) J. Res. Nat. Bur. Stds. , vol.49 , pp. 409-436
    • Hestenes, M.1    Stiefel, E.2
  • 16
    • 0000048673 scopus 로고
    • GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems
    • Saad, Y., Schultz, M.: GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 7 (1986) 856-869
    • (1986) SIAM Journal on Scientific and Statistical Computing , vol.7 , pp. 856-869
    • Saad, Y.1    Schultz, M.2
  • 18
    • 0031488469 scopus 로고    scopus 로고
    • Deflated and augmented Krylov subspace techniques
    • Chapman, A., Saad, Y.: Deflated and augmented Krylov subspace techniques. Linear Algebra with Applications 4 (1997) 43-66
    • (1997) Linear Algebra with Applications , vol.4 , pp. 43-66
    • Chapman, A.1    Saad, Y.2
  • 20
    • 0034144749 scopus 로고    scopus 로고
    • Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations
    • Morgan, R. B.: Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations. SIAM Journal of Matrix Analysis and Applications 21 (2000) 1112-1135
    • (2000) SIAM Journal of Matrix Analysis and Applications , vol.21 , pp. 1112-1135
    • Morgan, R.B.1
  • 27
    • 0042192598 scopus 로고
    • Nested Krylov methods and preserving orthogonality
    • Melson, N., Manteuffel, T., McCormick, S., eds.: NASA conference Publication 3324, NASA
    • de Sturler, E., Fokkema, D.: Nested Krylov methods and preserving orthogonality. In Melson, N., Manteuffel, T., McCormick, S., eds.: Sixth Copper Mountain Conference on Multigrid Methods. Part 1 of NASA conference Publication 3324, NASA (1993) 111-126
    • (1993) Sixth Copper Mountain Conference on Multigrid Methods , Issue.1 PART , pp. 111-126
    • De Sturler, E.1    Fokkema, D.2
  • 28
    • 0000259877 scopus 로고    scopus 로고
    • Truncation strategies for optimal Krylov subspace methods
    • de Sturler, E.: Truncation strategies for optimal Krylov subspace methods. SIAM Journal on Numerical Analysis 36 (1999) 864-889
    • (1999) SIAM Journal on Numerical Analysis , vol.36 , pp. 864-889
    • De Sturler, E.1
  • 30
    • 0030533709 scopus 로고    scopus 로고
    • On hybrid iterative methods for nonsymmetric systems of linear equations
    • Manteuffel, T.A., Starke, G.: On hybrid iterative methods for nonsymmetric systems of linear equations. Numerical Mathematics 73 (1996) 489-506
    • (1996) Numerical Mathematics , vol.73 , pp. 489-506
    • Manteuffel, T.A.1    Starke, G.2
  • 31
    • 0000493104 scopus 로고
    • A robust GMRES-base adaptive polynomial preconditioning algorithm for nonsymmetric linear systems
    • Joubert, W.: A robust GMRES-base adaptive polynomial preconditioning algorithm for nonsymmetric linear systems. SIAM Journal on Scientific Computing 15 (1994) 427-439
    • (1994) SIAM Journal on Scientific Computing , vol.15 , pp. 427-439
    • Joubert, W.1
  • 32
    • 0348152042 scopus 로고    scopus 로고
    • National Institute of Standards and Technology, Mathematical and Computational Sciences Division: Matrix Market. http://math.nist.gov/MatrixMarket (2002)
    • (2002) Matrix Market


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