메뉴 건너뛰기




Volumn 1947, Issue , 2001, Pages 103-112

A fast minimal storage symmetric indefinite solver

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 0012535774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper
Times cited : (1)

References (9)
  • 1
    • 84956981774 scopus 로고    scopus 로고
    • A recursive Formulation of the Cholesky Factorization Operating on a Matrix in Packed Storage Form
    • University of Tennessee, Knoxville, TN, and submitted to the Transaction of Mathematical Software (TOMS) of the ACM
    • B. Andersen, F. Gustavson, and J. Waśniewski, A recursive Formulation of the Cholesky Factorization Operating on a Matrix in Packed Storage Form, University of Tennessee, Knoxville, TN, Computer Science Dept. Technical Report CS-00-441, May 2000, also LAPACK Working Note number 146 (http://www.netlib.org/lapack/lawns/lawn146.ps), and submitted to the Transaction of Mathematical Software (TOMS) of the ACM.
    • Computer Science Dept. Technical Report CS-00-441, May 2000, also LAPACK Working Note Number 146
    • Andersen, B.1    Gustavson, F.2    Waśniewski, J.3
  • 3
    • 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 Journal of Research and Development, 44, #4, 605-624, 2000
    • (2000) IBM Journal of Research and Development , vol.44 , Issue.4 , pp. 605-624
    • Elmroth, E.1    Gustavson, F.2
  • 4
    • 0004236492 scopus 로고    scopus 로고
    • 3rd edition, The John Hopkins University Press, Baltimore
    • G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd edition, The John Hopkins University Press, Baltimore, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Van Loan, C.F.2
  • 5
    • 0031273280 scopus 로고    scopus 로고
    • Recursion leads to automatic variable blocking for dense linear-algebra algorithms
    • F. Gustavson, Recursion leads to automatic variable blocking for dense linear-algebra algorithms, IBM J. Res. Develop., 41 (1997), pp. 737-755.
    • (1997) IBM J. Res. Develop. , vol.41 , pp. 737-755
    • Gustavson, F.1
  • 7
    • 84947926251 scopus 로고    scopus 로고
    • Recursive Blocked Data Formats and BLAS’s for Dense Linear Algebra Algorithms
    • in Applied Parallel Computing, B. Kagstrom et. al., eds., Springer
    • F. Gustavson, A. Henriksson, I. Jonsson, B. Kågström, and P. Ling, Recursive Blocked Data Formats and BLAS’s for Dense Linear Algebra Algorithms, in Applied Parallel Computing, B. Kagstrom et. al., eds., Lecture Notes in Computers Science, v. 1541, Springer, 1998, pp. 120-128.
    • (1998) Lecture Notes in Computers Science , vol.1541 , pp. 120-128
    • Gustavson, F.1    Henriksson, A.2    Jonsson, I.3    Kågström, B.4    Ling, P.5
  • 9
    • 84956980454 scopus 로고    scopus 로고
    • (ESSL) V3, rel2 Pgm #5765-C42July
    • IBM Engineering Scientific Subroutine Library for AIX, (ESSL) V3, rel2 Pgm #5765-C42, July 2000
    • (2000)


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