메뉴 건너뛰기




Volumn 2328, Issue , 2002, Pages 418-436

New generalized data structures for matrices lead to a variety of high performance algorithms

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DIGITAL STORAGE; FACTORIZATION; FORTRAN (PROGRAMMING LANGUAGE); PROGRAM COMPILERS;

EID: 84947583789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_47     Document Type: Conference Paper
Times cited : (18)

References (9)
  • 1
    • 0028513316 scopus 로고
    • Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms
    • Sep
    • R. C. Agarwal, F. G. Gustavson, M. Zubair. Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM Journal of Research and Development, Vol. 38, No. 5, Sep. 1994, pp. 563,576
    • (1994) IBM Journal of Research and Development , vol.38 , Issue.5
    • Agarwal, R.C.1    Gustavson, F.G.2    Zubair, M.3
  • 2
    • 0021310295 scopus 로고
    • Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
    • Jan
    • J. J. Dongarra, F. G. Gustavson, A. Karp. Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine. SIAM Review, Vol. 26, No. 1, Jan. 1984, pp. 91,112
    • (1984) SIAM Review , vol.26 , Issue.1
    • Dongarra, J.J.1    Gustavson, F.G.2    Karp, A.3
  • 3
    • 0034224207 scopus 로고    scopus 로고
    • Applying Recursion to Serial and Parallel QR Factorization Leads to Better Performance
    • July
    • E. W. Elmroth and F. G. Gustavson. Applying Recursion to Serial and Parallel QR Factorization Leads to Better Performance. IBM Journal of Research and Development, Vol. 44, No. 4, July 2000, pp. 605,624
    • (2000) IBM Journal of Research and Development, , vol.44 , Issue.4
    • Elmroth, E.W.1    Gustavson, F.G.2
  • 4
    • 0034312453 scopus 로고    scopus 로고
    • Minimal Storage High Performance Cholesky via Blocking and Recursion
    • Nov
    • F. G. Gustavson and I. Jonsson. Minimal Storage High Performance Cholesky via Blocking and Recursion IBM Journal of Research and Development, Vol. 44, No. 6, Nov. 2000, pp. 823,849
    • (2000) IBM Journal of Research and Development , vol.44 , Issue.6
    • Gustavson, F.G.1    Jonsson, I.2
  • 6
    • 0031273280 scopus 로고    scopus 로고
    • Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms
    • Nov
    • F. G. Gustavson. Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms. IBM Journal of Research and Development, Vol. 41, No. 6, Nov. 1997, pp. 737,755
    • (1997) IBM Journal of Research and Development , vol.41 , Issue.6 , pp. 737
    • Gustavson, F.G.1


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