A numerical method for computing eigenvectors of a large matrix
From MaRDI portal
Recommendations
- An efficient method for obtaining the eigenvectors of a ring system
- scientific article; zbMATH DE number 854624
- A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- Applications of the numerical computation of the eigenvalues and eigenvectors of the matrices of large size
Cited in
(13)- Establishing simple relationship between eigenvector and matrix elements
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- scientific article; zbMATH DE number 1222715 (Why is no real title available?)
- Computational methods for large eigenvalue problems
- scientific article; zbMATH DE number 4192950 (Why is no real title available?)
- A method for computing a few eigenpairs of large generalized eigenvalue problems
- An algorithm for solution of large eigenvalue problems
- Proper use of Lanczos vectors for large eigenvalue problems
- scientific article; zbMATH DE number 3148736 (Why is no real title available?)
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- An efficient method for obtaining the eigenvectors of a ring system
- Computational procedure for a fast calculation of eigenvectors and eigenvalues of structures with random properties
- A numerical method of determining eigenvalues of matrices of arbitrary large size
This page was built for publication: A numerical method for computing eigenvectors of a large matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980633)
