The computation of eigenvalues of large-scale matrices arising from finite ele-ment discretizations has gained significant interest in the last decade [18]. 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 gen-eralized symmetric eigenvalue problem in O(nm logα n) operations, where α> 0 is a small constant.
Conventional algorithms for the (symmetric or non-symmetric) eigenvalue decomposition and the singul...
Let A be a symmetric matrix of dimension N. The subject of this paper is a method for numerically ap...
This report discusses a serial implementation of Cuppen's divide and conquer algorithm for comp...
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
An algorithm is proposed for a relatively fast and highly accurate calculation of several eigenvalue...
The numerical solution of eigenvalue problems is essential in various application areas of scientifi...
This PhD thesis is an important development in the theories, methods, and applications of eigenvalue...
An algorithm is developed to calculate eigenvalues and eigenvectors of large order symmetric band ma...
We carefully develop a numerically sane algorithm for solving the 2 × 2 real symmetric eigenvalue ...
We present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that ca...
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems w...
AbstractA real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used ...
This report demonstrates parallel versions of the Eispack [Smith 76] functions TRED2 and TQL2 for fi...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
Abstract. We propose a new algorithm for the symmetric eigenproblem that computes eigen-values and e...
Conventional algorithms for the (symmetric or non-symmetric) eigenvalue decomposition and the singul...
Let A be a symmetric matrix of dimension N. The subject of this paper is a method for numerically ap...
This report discusses a serial implementation of Cuppen's divide and conquer algorithm for comp...
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
An algorithm is proposed for a relatively fast and highly accurate calculation of several eigenvalue...
The numerical solution of eigenvalue problems is essential in various application areas of scientifi...
This PhD thesis is an important development in the theories, methods, and applications of eigenvalue...
An algorithm is developed to calculate eigenvalues and eigenvectors of large order symmetric band ma...
We carefully develop a numerically sane algorithm for solving the 2 × 2 real symmetric eigenvalue ...
We present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that ca...
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems w...
AbstractA real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used ...
This report demonstrates parallel versions of the Eispack [Smith 76] functions TRED2 and TQL2 for fi...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
Abstract. We propose a new algorithm for the symmetric eigenproblem that computes eigen-values and e...
Conventional algorithms for the (symmetric or non-symmetric) eigenvalue decomposition and the singul...
Let A be a symmetric matrix of dimension N. The subject of this paper is a method for numerically ap...
This report discusses a serial implementation of Cuppen's divide and conquer algorithm for comp...