An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
- 1 December 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 21 (4) , 432-475
- https://doi.org/10.1145/212066.212091
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Computing selected eigenvalues of sparse unsymmetric matrices using subspace iterationACM Transactions on Mathematical Software, 1993
- Implicit Application of Polynomial Filters in a k-Step Arnoldi MethodSIAM Journal on Matrix Analysis and Applications, 1992
- A set of level 3 basic linear algebra subprogramsACM Transactions on Mathematical Software, 1990
- Large-scale complex eigenvalue problemsJournal of Computational Physics, 1989
- A relative backward perturbation theorem for the eigenvalue problemNumerische Mathematik, 1989
- Numerical solution of large nonsymmetric eigenvalue problemsComputer Physics Communications, 1989
- Distribution of mathematical software via electronic mailCommunications of the ACM, 1987
- Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problemsMathematics of Computation, 1984
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matricesLinear Algebra and its Applications, 1980
- The Tchebychev iteration for nonsymmetric linear systemsNumerische Mathematik, 1977