A parallel algorithm for solving a partial eigenvalue problem for block-diagonal bordered matrices
DOI10.1007/S10559-020-00311-ZzbMATH Open1458.65038OpenAlexW3109268993MaRDI QIDQ2215875FDOQ2215875
Authors: O. M. Khimich, O. V. Popov, O. V. Chistyakov, V. A. Sidoruk 
Publication date: 14 December 2020
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-020-00311-z
Recommendations
- Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
- scientific article; zbMATH DE number 702158
- scientific article; zbMATH DE number 434520
- A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP
- scientific article; zbMATH DE number 1247167
hybrid algorithmalgebraic eigenvalue problemefficiency of parallel algorithmsmall-tiled algorithmsubspace iterative method
Parallel numerical computation (65Y05) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
Cited In (5)
- Adaptive algorithms for solving eigenvalue problems in the variable computer environment of supercomputers
- A note on the parallel GSAOR method for block diagonally dominant matrices
- Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
- A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
- Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
Uses Software
This page was built for publication: A parallel algorithm for solving a partial eigenvalue problem for block-diagonal bordered matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215875)
