메뉴 건너뛰기




Volumn 25, Issue 3, 1999, Pages 311-319

Efficient parallel version of the householder-QL matrix diagonalization algorithm

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS; INTERFACES (COMPUTER); MATRIX ALGEBRA; PARALLEL ALGORITHMS; SUBROUTINES;

EID: 0033099672     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00116-1     Document Type: Article
Times cited : (7)

References (12)
  • 1
    • 0345663658 scopus 로고
    • Parallel householder method for linear-systems international
    • Chawla M.M., Evans D.J. Parallel householder method for linear-systems international. Journal of Computer Mathematics. 58:1995;159-167.
    • (1995) Journal of Computer Mathematics , vol.58 , pp. 159-167
    • Chawla, M.M.1    Evans, D.J.2
  • 2
    • 5344230920 scopus 로고
    • The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
    • Davidson E.R. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Computational Physics. 17:1975;87.
    • (1975) J. Computational Physics , vol.17 , pp. 87
    • Davidson, E.R.1
  • 6
    • 0003690698 scopus 로고
    • Numerical Methods for Mathematics
    • Prentice-Hall, Englewood Cliffs
    • J.H. Mathews, Numerical Methods for Mathematics, Science and Engineering, Prentice-Hall, Englewood Cliffs, 1992.
    • (1992) Science and Engineering
    • Mathews, J.H.1
  • 7
    • 22044454751 scopus 로고    scopus 로고
    • High performance protocols for clusters of commodity workstations
    • Melas P., Zaluska E.J. High performance protocols for clusters of commodity workstations. Lecture Notes in Computer Science. 1470:1998;570-577.
    • (1998) Lecture Notes in Computer Science , vol.1470 , pp. 570-577
    • Melas, P.1    Zaluska, E.J.2
  • 9
    • 84968486060 scopus 로고
    • On estimating the largest eigenvalue with the Lanczos algorithm
    • Parlett B.N., Simon H., Stringer L.M. On estimating the largest eigenvalue with the Lanczos algorithm. Mathematics of Computation. 38:1982;153-165.
    • (1982) Mathematics of Computation , vol.38 , pp. 153-165
    • Parlett, B.N.1    Simon, H.2    Stringer, L.M.3
  • 12
    • 0345231582 scopus 로고
    • A parallel processed scheme for the eigenproblem of positive-definite matrices
    • Shalaby M.A. A parallel processed scheme for the eigenproblem of positive-definite matrices. J. of Computational and Applied Math. 54:1994;99-106.
    • (1994) J. of Computational and Applied Math. , vol.54 , pp. 99-106
    • Shalaby, M.A.1


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