An algorithm is proposed for a relatively fast and highly accurate calculation of several eigenvalues and the corresponding eigenvectors of a large symmetric matrix. Results of numerical experiments are presented in which the nine lowest eigenvalues were calculated for the minus-Laplace operator with zero boundary conditions discretized on various two-dimensional regions using the five-point stencil and a grid with the number of nodes exceeding one million. The calculation of a part of the spectrum of an arbitrary square matrix is discussed. Copyright © 2005 by MAIK "Nauka/Interperiodica"
AbstractWe apply a novel approach to approximate within ϵ to all the eigenvalues of an n × n symmetr...
The computation of eigenvalues of a matrix is still of importance from both theoretical and practica...
The purpose of this thesis is to give a survey of the methods currently used to solve the numerical ...
An algorithm is proposed for a relatively fast and highly accurate calculation of several eigenvalue...
Let A be a symmetric matrix of dimension N. The subject of this paper is a method for numerically ap...
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
An algorithm is developed to calculate eigenvalues and eigenvectors of large order symmetric band ma...
The computation of eigenvalues of large-scale matrices arising from finite ele-ment discretizations ...
This project is concerned with the solution of eigenvalues of symmetric Matrices. The basic conce...
AbstractAn algorithm is given for calculation of eigenvalues and eigenvectors of centrosymmetric and...
AbstractA numerical algorithm for the inverse eigenvalue problem for symmetric matrices is developed...
AbstractThe algorithm described in this article uses Householder reflections to obtain the largest e...
This report discusses a serial implementation of Cuppen's divide and conquer algorithm for comp...
Abstract. We propose a new algorithm for the symmetric eigenproblem that computes eigen-values and e...
This report demonstrates parallel versions of the Eispack [Smith 76] functions TRED2 and TQL2 for fi...
AbstractWe apply a novel approach to approximate within ϵ to all the eigenvalues of an n × n symmetr...
The computation of eigenvalues of a matrix is still of importance from both theoretical and practica...
The purpose of this thesis is to give a survey of the methods currently used to solve the numerical ...
An algorithm is proposed for a relatively fast and highly accurate calculation of several eigenvalue...
Let A be a symmetric matrix of dimension N. The subject of this paper is a method for numerically ap...
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
An algorithm is developed to calculate eigenvalues and eigenvectors of large order symmetric band ma...
The computation of eigenvalues of large-scale matrices arising from finite ele-ment discretizations ...
This project is concerned with the solution of eigenvalues of symmetric Matrices. The basic conce...
AbstractAn algorithm is given for calculation of eigenvalues and eigenvectors of centrosymmetric and...
AbstractA numerical algorithm for the inverse eigenvalue problem for symmetric matrices is developed...
AbstractThe algorithm described in this article uses Householder reflections to obtain the largest e...
This report discusses a serial implementation of Cuppen's divide and conquer algorithm for comp...
Abstract. We propose a new algorithm for the symmetric eigenproblem that computes eigen-values and e...
This report demonstrates parallel versions of the Eispack [Smith 76] functions TRED2 and TQL2 for fi...
AbstractWe apply a novel approach to approximate within ϵ to all the eigenvalues of an n × n symmetr...
The computation of eigenvalues of a matrix is still of importance from both theoretical and practica...
The purpose of this thesis is to give a survey of the methods currently used to solve the numerical ...