Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices

DOI10.1007/s10559-017-9996-5zbMath1383.65030OpenAlexW2770746547MaRDI QIDQ1699408

Peng Zhang

Publication date: 23 February 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-017-9996-5

zbMATH Keywords

numerical examplesparse matricesconjugate gradient methodsalgebraic eigenvalue problemhybrid algorithmsubspace iteration methodcomputer of hybrid architectureefficiency of parallel algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (3)

Adaptive algorithms for solving eigenvalue problems in the variable computer environment of supercomputers ⋮ A parallel algorithm for solving a partial eigenvalue problem for block-diagonal bordered matrices ⋮ Numerical methods for determining stiffness properties of a bar cross-section

Uses Software

• Matlab
• SLEPc
• CUDA
• Netlib
• SuiteSparse
• MKL
• MAGMA
• Lis

Cites Work

• MATLAB Guide, Third Edition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices