Add to ORKGComputing selected eigenvalues of sparse unsymmetric matrices using subspace iteration b
The aim of this thesis is to conduct a general investigation in the field of sparse matrices, to inv...
The algebraic eigenvalue problem occurring in a variety of problems in the Natural, Engineering and ...
AbstractWe consider the generalized eigenvalue problem. (A − λM)x = 0, where A and M are large, spar...
This paper discusses the design and development of a code to calculate the eigenvalues of a large sp...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN028558 / BLDSC - British Library D...
The numerical determination of the eigenvalues and eigenvectors of large-order sparse matrice
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--93-097) / BLDSC - Bri...
The past few years have seen a signicant increase in research into numerical methods for computing s...
Arnoldi methods can be more effective than subspace iteration methods for computing the dominant elg...
algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric ma...
This paper describes a method of obtaining all or a dominant subset of the eigenvalues and correspon...
An algorithm is presented for computing the m smallest eigenvalues and corresponding eigenvectors of...
A general eigenvalue solver for a large sparse symmetric matrix with zero eigenvalue solutions is de...
This chapter provides routines for the iterative solution of large sparse nonsymmetric and symmetri
A parallel algorithm for the efficient calculation of m (m .le.15) eigenvalues of smallest absolute ...
The aim of this thesis is to conduct a general investigation in the field of sparse matrices, to inv...
The algebraic eigenvalue problem occurring in a variety of problems in the Natural, Engineering and ...
AbstractWe consider the generalized eigenvalue problem. (A − λM)x = 0, where A and M are large, spar...
This paper discusses the design and development of a code to calculate the eigenvalues of a large sp...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN028558 / BLDSC - British Library D...
The numerical determination of the eigenvalues and eigenvectors of large-order sparse matrice
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--93-097) / BLDSC - Bri...
The past few years have seen a signicant increase in research into numerical methods for computing s...
Arnoldi methods can be more effective than subspace iteration methods for computing the dominant elg...
algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric ma...
This paper describes a method of obtaining all or a dominant subset of the eigenvalues and correspon...
An algorithm is presented for computing the m smallest eigenvalues and corresponding eigenvectors of...
A general eigenvalue solver for a large sparse symmetric matrix with zero eigenvalue solutions is de...
This chapter provides routines for the iterative solution of large sparse nonsymmetric and symmetri
A parallel algorithm for the efficient calculation of m (m .le.15) eigenvalues of smallest absolute ...
The aim of this thesis is to conduct a general investigation in the field of sparse matrices, to inv...
The algebraic eigenvalue problem occurring in a variety of problems in the Natural, Engineering and ...
AbstractWe consider the generalized eigenvalue problem. (A − λM)x = 0, where A and M are large, spar...