A Test Matrix Collection for Non-Hermitian Eigenvalue Problems

The primary purpose of this collection is to provide a testbed for the development of numerical algorithms for solving nonsymmetric eigenvalue problems. In addition, as with many other existing collections of test matrices, our goal includes providing an easy access to \practical" eigenproblems for researchers, educators and students in the community who are interested in the origins of large scale nonsymmetric eigenvalue problems, and in the development and testing of numerical algorithms for solving challenging non-Hermitian eigenvalue problems in real applications. In this document, we describe the mechanism for obtaining a copy of the matrices and for using the collection. All test matrices currently included in the collection are documented in Appendices.

[1]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[2]  B. Friedman.  Eigenvalues of Composite Matrices , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  William J. Stewart,et al.  A comparison of numerical techniques in Markov modeling , 1978, CACM.

[4]  G W Stewart,et al.  SRRIT - A FORTRAN Subroutine to Calculate the Dominant Invariant Subspaces of a Real Matrix. , 1978 .

[5]  Y. Saad.  Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices , 1980 .

[6]  B. Hassard,et al.  Theory and applications of Hopf bifurcation , 1981 .

[7]  William J. Stewart,et al.  A Simultaneous Iteration Algorithm for Real Matrices , 1981, TOMS.

[8]  R. F. Heinemann,et al.  Multiplicity, stability, and oscillatory dynamics of the tubular reactor , 1981 .

[9]  H. Elman.  Iterative methods for large, sparse, nonsymmetric systems of linear equations , 1982 .

[10]  H. Elman,et al.  Polynomial iteration for nonsymmetric indefinite linear systems , 1986 .

[11]  J. Cullum,et al.  A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric Matrices , 1986 .

[12]  N. Higham.  A Collection of Test Matrices in MATLAB , 1989 .

[13]  W. Kerner.  Large-scale complex eigenvalue problems , 1989 .

[14]  J. Cullum,et al.  A generalized nonsymmetric Lanczos procedure , 1989 .

[15]  M. Marcus,et al.  A Survey of Matrix Theory and Matrix Inequalities , 1965 .

[16]  Yilong Lu,et al.  Variational finite element analysis of dielectric waveguides with no spurious solutions , 1990 .

[17]  Earl H. Dowell,et al.  Eigenvalue calculation procedure for an Euler/Navier-Stokes solver with application to flows over airfoils , 1991 .

[18]  S. Chu.  Complex quasivibrational energy formalism for intense‐field multiphoton and above‐threshold dissociation: Complex‐scaling Fourier‐grid Hamiltonian method , 1991 .

[19]  Lloyd N. Trefethen,et al.  A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems , 1992, SIAM J. Matrix Anal. Appl..

[20]  Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration , 1993, TOMS.

[21]  Dinesh Manocha,et al.  Multipolynomial Resultant Algorithms , 1993, J. Symb. Comput..

[22]  Roland W. Freund,et al.  An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices , 1993, SIAM J. Sci. Comput..

[23]  P. M. Meijer,et al.  A preconditioned Jacobi-Davidson method for solving large generalized eigenvalue problems , 1994 .

[24]  Henk A. van der Vorst,et al.  Parallel Arnoldi Method for the Construction of a Krylov Subspace Basis: an Application in Magnetohydrodynamics , 1994, HPCN.

[25]  A. Spence,et al.  A spectral transformation for finding complex eigenvalues of large sparse nonsymmetric matrices , 1994 .

[26]  Jilin Tan,et al.  A new edge element analysis of dispersive waveguiding structures , 1995 .

[27]  H. V. D. Vorst,et al.  Application of the Implicitly Updated Arnoldi Method with a Complex Shift-and-Invert Strategy in MHD , 1995 .

[28]  R. Lehoucq.  Analysis and implementation of an implicitly restarted Arnoldi iteration , 1996 .

[29]  G. W. Stewart,et al.  SRRIT--A FORTRAN Subroutine to Calculate the Dominant InvariantSubspace of a Nonsymmetric Matrix , 1998 .

[30]  Axel Ruhe,et al.  Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils , 1998, SIAM J. Sci. Comput..