메뉴 건너뛰기




Volumn 31, Issue 4-5, 1996, Pages 49-54

Fast cholesky factorization for interior point methods of linear programming

Author keywords

Cholesky factorization; Interior point methods; Sparse matrix computation; Supernodes

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ITERATIVE METHODS; LARGE SCALE SYSTEMS; LEAST SQUARES APPROXIMATIONS; MATRIX ALGEBRA; PROBLEM SOLVING;

EID: 0030080729     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(95)00215-4     Document Type: Article
Times cited : (48)

References (9)
  • 1
    • 0026876871 scopus 로고
    • Path following methods for linear programming
    • C.G. Gonzaga, Path following methods for linear programming, SIAM Review 34 (2), 167-227 (1992).
    • (1992) SIAM Review , vol.34 , Issue.2 , pp. 167-227
    • Gonzaga, C.G.1
  • 3
    • 0345026870 scopus 로고
    • The interaction of algorithms and architectures for interior point method
    • (Edited by P.M. Pardalos), North-Holland, Amsterdam
    • I.J. Lustig, R.E. Marsten and D.F. Shanno, The interaction of algorithms and architectures for interior point method, In Advances in Optimization and Parallel Computing, (Edited by P.M. Pardalos), pp. 190-205, North-Holland, Amsterdam, (1992).
    • (1992) Advances in Optimization and Parallel Computing , pp. 190-205
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 4
    • 0001662422 scopus 로고
    • Interior point methods for linear programming: Computational state of the art
    • I.J. Lustig, R.E. Marsten and D.F. Shanno, Interior point methods for linear programming: Computational state of the art, ORSA Journal on Computing 6 (2), 1-14 (1994).
    • (1994) ORSA Journal on Computing , vol.6 , Issue.2 , pp. 1-14
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 5
    • 0026214508 scopus 로고
    • Efficient sparse matrix factorization on high-performance workstations - Exploiting the memory hiearchy
    • E. Rothberg and A. Gupta, Efficient sparse matrix factorization on high-performance workstations - Exploiting the memory hiearchy, ACM Transactions on Mathematical Software 17 (3), 313-334 (1991).
    • (1991) ACM Transactions on Mathematical Software , vol.17 , Issue.3 , pp. 313-334
    • Rothberg, E.1    Gupta, A.2
  • 8
    • 0000817412 scopus 로고
    • A supernodal Cholesky factorization algorithm for shared-memory multi-processors
    • N.G. Esmond and B.W. Peyton, A supernodal Cholesky factorization algorithm for shared-memory multi-processors, SIAM Journal on Scientific Computing 14 (2), 761-769 (1993).
    • (1993) SIAM Journal on Scientific Computing , vol.14 , Issue.2 , pp. 761-769
    • Esmond, N.G.1    Peyton, B.W.2


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