The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade. Here we present a new algorithm based on slicing the spectrum that takes advantage of the rank structure of resolvent matrices in order to compute m eigenvalues of the generalized symmetric eigenvalue problem in O(n m log^α n) operations, where α>0 is a small constant.status: publishe
We present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that ca...
An algorithm is developed to calculate eigenvalues and eigenvectors of large order symmetric band ma...
AbstractAn effective method for computing eigenvalues and eigenvectors of complex symmetric matrices...
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
The computation of eigenvalues of large-scale matrices arising from finite ele-ment discretizations ...
The numerical solution of eigenvalue problems is essential in various application areas of scientifi...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
An algorithm is proposed for a relatively fast and highly accurate calculation of several eigenvalue...
This PhD thesis is an important development in the theories, methods, and applications of eigenvalue...
Independent eigenvector computation for a given set of eigenvalues of typical engineering eigenvalu...
In this thesis we address the computation of a spectral decomposition for symmetric banded matrices....
AbstractA real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used ...
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems w...
Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic structur...
Conventional algorithms for the (symmetric or non-symmetric) eigenvalue decomposition and the singul...
We present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that ca...
An algorithm is developed to calculate eigenvalues and eigenvectors of large order symmetric band ma...
AbstractAn effective method for computing eigenvalues and eigenvectors of complex symmetric matrices...
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
The computation of eigenvalues of large-scale matrices arising from finite ele-ment discretizations ...
The numerical solution of eigenvalue problems is essential in various application areas of scientifi...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
An algorithm is proposed for a relatively fast and highly accurate calculation of several eigenvalue...
This PhD thesis is an important development in the theories, methods, and applications of eigenvalue...
Independent eigenvector computation for a given set of eigenvalues of typical engineering eigenvalu...
In this thesis we address the computation of a spectral decomposition for symmetric banded matrices....
AbstractA real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used ...
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems w...
Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic structur...
Conventional algorithms for the (symmetric or non-symmetric) eigenvalue decomposition and the singul...
We present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that ca...
An algorithm is developed to calculate eigenvalues and eigenvectors of large order symmetric band ma...
AbstractAn effective method for computing eigenvalues and eigenvectors of complex symmetric matrices...