Comparative study of two algorithms for the calculation of the extreme eigenvalues of large matrices
From MaRDI portal
Publication:1365894
DOI10.1016/0010-4655(94)90069-8zbMATH Open0878.65028OpenAlexW2022321434MaRDI QIDQ1365894FDOQ1365894
Authors: S. J. Sciutto
Publication date: 1994
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4655(94)90069-8
Recommendations
- A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices
- scientific article; zbMATH DE number 1264879
- An algorithm for solution of large eigenvalue problems
- Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
- scientific article; zbMATH DE number 17720
- Applications of the numerical computation of the eigenvalues and eigenvectors of the matrices of large size
- A numerical method of determining eigenvalues of matrices of arbitrary large size
- An approximation method for eigenvectors of very large matrices
- Computational methods for large eigenvalue problems
- scientific article; zbMATH DE number 697753
Cites Work
Cited In (2)
Uses Software
This page was built for publication: Comparative study of two algorithms for the calculation of the extreme eigenvalues of large matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365894)