Add to ORKGIllustrates how to solve eigenvalue problems where the matrix is defined in an implicit way, by means of a matrix-vector product subroutine (and possibly other operations)https://polimedia.upv.es/visor/?id=4de53820-4aa0-11e7-9b33-83cdd974e088Román Moltó, JE. (2017). SLEPc: Matrix-free eigenproblems. http://hdl.handle.net/10251/8445
. This paper describes programs to reduce a nonsymmetric matrix to tridiagonal form, compute the eig...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN028558 / BLDSC - British Library D...
This package is a collection of Fortran 90 subroutines for accurately and efficiently solving matrix...
How SLEPc can be used to solve standard eigenvalue problems. The different options are illustrated w...
Describes how the spectral transformation can be used in SLEPc to solve generalized eigenvalue probl...
Román Moltó, JE.; Campos González, MC. (2013). Solving symmetric quadratic eigenvalue problems with ...
Abstract. Many eigenvalue problems are most naturally viewed as product eigenvalue problems. The eig...
A matrix polynomial (or λ-matrix) has the form P (λ) = λmAm + λ m−1Am−1 + · · ·+ A0, where Ak ∈ C ...
Matrix polynomial eigenproblems arise in many application areas, both directly and as approximations...
Illustrates the use of monitors and options for viewing the solution computed by the eigensolvers, i...
We implement an eigenvalue solving algorithm proposed by Ng and Trench, specialized for Toeplitz(-li...
http://deepblue.lib.umich.edu/bitstream/2027.42/6667/5/bac9269.0001.001.pdfhttp://deepblue.lib.umich...
Methods for the polynomial eigenvalue problem often require to be followed by an iterative refinemen...
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solve effective...
Abstract. Balancing a matrix is a preprocessing step while solving the nonsymmetric eigenvalue probl...
. This paper describes programs to reduce a nonsymmetric matrix to tridiagonal form, compute the eig...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN028558 / BLDSC - British Library D...
This package is a collection of Fortran 90 subroutines for accurately and efficiently solving matrix...
How SLEPc can be used to solve standard eigenvalue problems. The different options are illustrated w...
Describes how the spectral transformation can be used in SLEPc to solve generalized eigenvalue probl...
Román Moltó, JE.; Campos González, MC. (2013). Solving symmetric quadratic eigenvalue problems with ...
Abstract. Many eigenvalue problems are most naturally viewed as product eigenvalue problems. The eig...
A matrix polynomial (or λ-matrix) has the form P (λ) = λmAm + λ m−1Am−1 + · · ·+ A0, where Ak ∈ C ...
Matrix polynomial eigenproblems arise in many application areas, both directly and as approximations...
Illustrates the use of monitors and options for viewing the solution computed by the eigensolvers, i...
We implement an eigenvalue solving algorithm proposed by Ng and Trench, specialized for Toeplitz(-li...
http://deepblue.lib.umich.edu/bitstream/2027.42/6667/5/bac9269.0001.001.pdfhttp://deepblue.lib.umich...
Methods for the polynomial eigenvalue problem often require to be followed by an iterative refinemen...
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solve effective...
Abstract. Balancing a matrix is a preprocessing step while solving the nonsymmetric eigenvalue probl...
. This paper describes programs to reduce a nonsymmetric matrix to tridiagonal form, compute the eig...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN028558 / BLDSC - British Library D...
This package is a collection of Fortran 90 subroutines for accurately and efficiently solving matrix...