scientific article; zbMATH DE number 4182700

MaRDI QIDQ5748810zbMATH OpenFDO

Authors Umpei Nagashima

Publication date 1990

zbMATH Keywords

eigenvalueeigenvectorslarge scale random sparse symmetric matrix diagonalizationmatrix multiplicationparallel computingpower methodssupercomputer

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• scientific article; zbMATH DE number 1820154
• scientific article; zbMATH DE number 3978276
• An improved parallel Jacobi method for diagonalizing a symmetric matrix
• Approximation of the determinant of large sparse symmetric positive definite matrices
• A Direct Algorithm for Nonorthogonal Approximate Joint Diagonalization
• scientific article; zbMATH DE number 1844154
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
• On estimation of the diagonal elements of a sparse precision matrix
• An asymmetrical non-orthogonal fast joint diagonalization algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5748810)