Adaptive algorithms for solving eigenvalue problems in the variable computer environment of supercomputers

DOI10.1007/s10559-023-00583-1OpenAlexW4378533048MaRDI QIDQ6170856

O. V. Popov, V. O. Kokhanovskyi, O. V. Chistyakov, O. M. Khimich

Publication date: 13 July 2023

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

Full work available at URL: https://doi.org/10.1007/s10559-023-00583-1

zbMATH Keywords

adaptive algorithmssubspace iteration methodalgebraic eigenvalue problems (AEVPs)changeable computer environmentgradient conjugation methodmulti-core computers of MIMD-architecture with graphic processors

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Basic linear algebra (15Axx) Computer aspects of numerical algorithms (65Yxx)

Cites Work

• Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
• Algorithm to solve the partial eigenvalue problem for large profile matrices
• A parallel algorithm for solving a partial eigenvalue problem for block-diagonal bordered matrices
• Adaptive computer technologies for solving problems of computational and applied mathematics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adaptive algorithms for solving eigenvalue problems in the variable computer environment of supercomputers