메뉴 건너뛰기




Volumn 27, Issue 1, 2001, Pages 83-91

Algorithm 809: PREQN: Fortran 77 subroutines for preconditioning the conjugate gradient method

Author keywords

G.1.3 Numerical Analysis : Numerical linear algebra Linear systems (direct and iterative methods); G.1.6 Numerical Analysis : Optimization Gradient methods; Unconstrained optimization

Indexed keywords


EID: 0011630080     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/382043.382343     Document Type: Article
Times cited : (12)

References (12)
  • 4
    • 0001809440 scopus 로고
    • An improved incomplete Cholesky factorization
    • Mar.
    • JONES, M. T. AND PLASSMANN, P. E. 1995. An improved incomplete Cholesky factorization. ACM Trans. Math. Softw. 21, 1 (Mar.), 5-17.
    • (1995) ACM Trans. Math. Softw. , vol.21 , Issue.1 , pp. 5-17
    • Jones, M.T.1    Plassmann, P.E.2
  • 5
    • 0034345411 scopus 로고    scopus 로고
    • Automatic preconditioning by limited memory quasi-Newton updating
    • MORALES, J. L. AND NOCEDAL, J. 2000. Automatic preconditioning by limited memory quasi-Newton updating. SIAM J. Optim. 10, 1079-1096.
    • (2000) SIAM J. Optim. , vol.10 , pp. 1079-1096
    • Morales, J.L.1    Nocedal, J.2
  • 6
    • 0021481124 scopus 로고
    • Newton-type minimization via the Lanczos method
    • NASH, S. G. 1984. Newton-type minimization via the Lanczos method. SIAM J. Numer. Anal. 21, 553-572.
    • (1984) SIAM J. Numer. Anal. , vol.21 , pp. 553-572
    • Nash, S.G.1
  • 7
    • 84966262179 scopus 로고
    • Updating quasi-Newton matrices with limited storage
    • NOCEDAL, J. 1980. Updating quasi-Newton matrices with limited storage. Math. Comput. 35, 773-782.
    • (1980) Math. Comput. , vol.35 , pp. 773-782
    • Nocedal, J.1
  • 8
    • 0020129823 scopus 로고
    • A discrete Newton algorithm for minimizing a function of many variables
    • O'LEARY, D. P. 1982. A discrete Newton algorithm for minimizing a function of many variables. Math. Program. 23, 1, 20-33.
    • (1982) Math. Program. , vol.23 , Issue.1 , pp. 20-33
    • O'Leary, D.P.1
  • 10
    • 0000305846 scopus 로고
    • The conjugate gradient method and trust regions in large scale optimization
    • STEIHAUG, T. 1983. The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626-637.
    • (1983) SIAM J. Numer. Anal. , vol.20 , pp. 626-637
    • Steihaug, T.1
  • 11
    • 0002633896 scopus 로고
    • Towards an efficient sparsity exploiting Newton method for minimization
    • I. S. Duff, Ed. Academic Press, Inc., New York, NY
    • TOINT, P. L. 1981. Towards an efficient sparsity exploiting Newton method for minimization. In Sparse Matrices and Their Uses, I. S. Duff, Ed. Academic Press, Inc., New York, NY, 57-87.
    • (1981) Sparse Matrices and Their Uses , pp. 57-87
    • Toint, P.L.1
  • 12
    • 0033269652 scopus 로고    scopus 로고
    • The truncated Newton search direction: Indefinite preconditioners and chemistry applications
    • XIE, D. AND SCHLICK, T. 2000. The truncated Newton search direction: Indefinite preconditioners and chemistry applications. SIAM J. Optim. 10, 132-154.
    • (2000) SIAM J. Optim. , vol.10 , pp. 132-154
    • Xie, D.1    Schlick, T.2


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