메뉴 건너뛰기




Volumn 2, Issue 3, 2003, Pages 217-234

Efficient and optimal parallel algorithms for cholesky decomposition

Author keywords

Algorithms and complexity; Cholesky decomposition; LogP model; Numerical linear algebra; Parallel complexity

Indexed keywords


EID: 78049308441     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000015832.41014.ed     Document Type: Article
Times cited : (5)

References (20)
  • 1
    • 0028427170 scopus 로고
    • Improving performance of linear algebra algorithms for dense matrices using algorithmic prefetch
    • Agarwal, R. C., Gustavson, F. G. and Zubair, M.: Improving performance of linear algebra algorithms for dense matrices using algorithmic prefetch, IBM J. Res. Develop. 38(3) (1994), 265-275.
    • (1994) IBM J. Res. Develop , vol.38 , Issue.3 , pp. 265-275
    • Agarwal, R.C.1    Gustavson, F.G.2    Zubair, M.3
  • 6
    • 0021310295 scopus 로고
    • Implementing linear algebra algorithms for dense matrices on a vector pipeline machine
    • Dongarra, J. J., Gustavson, F. G. and Karp, A.: Implementing linear algebra algorithms for dense matrices on a vector pipeline machine, SIAM Rev. 26 (1986), 91-112.
    • (1986) SIAM Rev , vol.26 , pp. 91-112
    • Dongarra, J.J.1    Gustavson, F.G.2    Karp, A.3
  • 7
    • 0041731470 scopus 로고    scopus 로고
    • Two-dimensional block partitioning for the parallel sparse Cholesky factorization
    • Dumitrescu, B., Doreille, M., Roch, J. L. and Trystram, D.: Two-dimensional block partitioning for the parallel sparse Cholesky factorization, Numer. Algorithms 16 (1997), 17-38.
    • (1997) Numer. Algorithms , vol.16 , pp. 17-38
    • Dumitrescu, B.1    Doreille, M.2    Roch, J.L.3    Trystram, D.4
  • 8
    • 84888771978 scopus 로고
    • Large dense numerical linear algebra in 1993: The parallel computing influence
    • Edelman, A.: Large dense numerical linear algebra in 1993: The parallel computing influence, Int. J. Supercomput. Appl. 7 (1994).
    • (1994) Int. J. Supercomput. Appl , pp. 7
    • Edelman, A.1
  • 10
    • 0029541853 scopus 로고
    • Explicit preconditioned methods for solving 3D boundary value problems by approximate inverse finite element matrix techniques
    • Gravannis, G. A.: Explicit preconditioned methods for solving 3D boundary value problems by approximate inverse finite element matrix techniques, Int. J. Comp. Math. 56 (1995).
    • (1995) Int. J. Comp. Math , pp. 56
    • Gravannis, G.A.1
  • 11
    • 0028495951 scopus 로고
    • A three-dimensional symmetric linear equation solver
    • Gravvanis, G. A.: A three-dimensional symmetric linear equation solver, Comm. Numer. Methods Engrg. 10(9) (1994).
    • (1994) Comm. Numer. Methods Engrg , vol.10 , Issue.9
    • Gravvanis, G.A.1
  • 12
    • 0031273280 scopus 로고    scopus 로고
    • Recursive leads to automatic variable blocking for dense linear-algebra algorithms
    • Nov
    • Gustavson, F. G.: Recursive leads to automatic variable blocking for dense linear-algebra algorithms, IBM J. Res. Develop. 41(6) (Nov. 1997).
    • (1997) IBM J. Res. Develop , vol.41 , Issue.6
    • Gustavson, F.G.1
  • 14
    • 0000018801 scopus 로고
    • Block sparse Cholesky algorithms on advanced uniprocessor computers
    • Ng, E. G. and Peyton, B. W.: Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Statist. Comput. 14 (1993), 1034-1056.
    • (1993) SIAM J. Sci. Statist. Comput , vol.14 , pp. 1034-1056
    • Ng, E.G.1    Peyton, B.W.2
  • 17
    • 0001459097 scopus 로고
    • An efficient block-oriented approach to parallel sparse Cholesky factorization
    • Rothberg, E. and Gupta, A.: An efficient block-oriented approach to parallel sparse Cholesky factorization, SIAM J. Sci. Comput. 15(6) (1994), 1413-1439.
    • (1994) SIAM J. Sci. Comput , vol.15 , Issue.6 , pp. 1413-1439
    • Rothberg, E.1    Gupta, A.2
  • 18
    • 84888783193 scopus 로고    scopus 로고
    • Efficient parallel algorithms for dense Cholesky factorizition
    • Springer, New York
    • Santos, E. E. and Chu, P.: Efficient parallel algorithms for dense Cholesky factorizition, In: Lecture Notes in Comput. Sci. 1557, Springer, New York, 1999, pp. 600-602.
    • (1999) Lecture Notes In Comput. Sci , vol.1557 , pp. 600-602
    • Santos, E.E.1    Chu, P.2


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