MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Numerical solution of large nonsymmetric eigenvalue problems (1989) [9 citations — 0 self]

Download:
pdf | ps
by Youcef Saad
Comput. Phys. Comm
ftp://ftp.cs.umn.edu/dept/users/saad/reports/FILES/RIACS-397.ps.gz
Add To MetaCart

Abstract:

We describe several methods based on combinations of Krylov subspace techniques, de-ation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most eective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or the Lanczos procedure. We consider two forms of preconditionings: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel / vector processing but may be ineective if eigenvalues inside the spectrum are sought. We provide some algorithmic details that improve the reliability and eectiveness of these techniques.

Citations

1143 Matrix Computations – Golub, Loan - 1989
842 GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems – Saad, Schultz - 1986
754 The Algebraic Eigenvalue Problem – Wilkinson - 1965
537 The Symmetric Eigenvalue Problem – Parlett - 1980
271 An iteration method for the solution of the eigenvalue problem of linear differential and integral operators – Lanczos - 1950
188 The principle of minimized iterations in the solution of the matrix eigenvalue problem – Arnoldi - 1951
120 Hybrid Krylov methods for nonlinear systems of equations – BROWN, SAAD - 1990
94 A look-ahead Lanczos algorithm for unsymmetric matrices – Parlett, Taylor, et al. - 1985
71 Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices," Linear Algebra Apps – Saad - 1980
52 Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices – MORGAN, SCOTT - 1986
44 Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems – SAAD - 1984
42 The spectral transformation Lanczos method for the numerical solution of large space generalized symmetric eigenvalue problems – Ericsson, Ruhe - 1980
41 Analysis of the Look Ahead Lanczos Algorithm – Taylor - 1982
36 Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices – Stewart - 1976
34 Conjugate gradient-like algorithms for solving nonsymmetric linear systems – Saad, Schultz - 1985
33 Rational Krylov sequence methods for eigenvalue computation – Ruhe - 1984
27 Matrix-free methods for stiff systems of ODE’s – BROWN, HINDMARSH - 1986
26 Iterative solution of linear equations in ODE codes – Gear, Saad - 1983
25 A simultaneous iteration algorithm for real matrices – J, JENNINGS - 1981
24 The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems – Saad - 1982
24 SRRIT - A FORTRAN subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix – Bai, Stewart - 1992
18 Complex shift and invert strategies for real matrices – PARLETT, SAAD - 1987
18 GMRES acceleration of computational fluid dynamics codes – Wigton, Yu, et al. - 1985
17 Das verfahren der treppeniteration und verwandte verfahren zur losung algebraischer eigenwertprobleme – Bauer - 1957
12 Matrix-free methods for sti# systems of ODE's – Brown, Hindmarsh - 1986
11 Least squares polynomials in the complex plane and their use for solving sparse nonsymmetric linear systems – Saad
11 Solving sparse symmetric generalized eigenvalue problems without factorization – Scott - 1981
11 The advantages of inverted operators in Rayleigh-Ritz approximations – SCOTT - 1982
10 Simultaneous iteration for partial eigensolution of real matrices – Jennings, Stewart - 1975
9 A look-ahead Lanczos algorithm for nonsymmetric matrices – Parlett, Taylor, et al.
8 Iterative solution of linear equations in ODE codes – Gear, Saad - 1983
7 Nonlinearly preconditioned Krylov subspace methods for discrete Newton algorithms – Chan, Jackson - 1984
7 The evaluation of eigenvalues and eigenvectors of a real symmetric matrix by simultaneous iteration – Clint, Jennings - 1970
5 Analysis of the symmetric Lanczos process – Scott - 1978
4 A Lanczos procedure for the modal analysis of very large nonsymmetric matrices – Cullum, Willoughby - 1984
4 Large Scale Eigenvalue Problems – Cullum, Willoughby - 1986
4 Acceleration techniques for decoupling algorithms in semiconductor simulation – Kerkhoven, Saad - 1987
3 Numerical Hopf Bifurcation – Jepson - 1982
2 On the practical use of the Lanczos algorithm in finite element applications to vibration and bifurcation problems – Carnoy, Geradin - 1982
2 Analysis by computer of the convergence of discrete approximations to the euler equations – Eriksson, Rizzi - 1983
2 Bifurcating time periodic solutions and their – Joseph, Sattinger - 1972
2 Finite element analysis of supersonic panel flutter – Sander, Bon, et al. - 1973
2 GMRES acceleration of computational dynamics codes – Wigton, Yu, et al. - 1985
1 Modeling of chemical reactors XVI – Hlavacek, Hofmann - 1970
1 Generalizations of davidsoh's method for computing eigenvalues of sparse symmetric matrices – Morgan, Scott - 1986
1 How to solve (K-XM)z = 0 for large K and M – Parlett - 1980
1 Waves in distributed chemical systems: experiments and computations – Raschman, Kubicek, et al. - 1979
1 Partial eigensolutions of large nonsymmetric matrices – Saad - 1985
1 On the practical use of the Lanczos algorithm in element applications to vibration and bifurcation problems – Carnoy, Geradin - 1982
1 How to solve (K M)z = 0 for large K – Parlett - 1980