Harmonic Projection Methods for Large Non-symmetric Eigenvalue Problems

Numerical Linear Algebra with Applications

Volumn 5, Issue 1, 1998, Pages 33-55

  Morgan, Ronald B ^a   Zeng, Min ^b  

^a BAYLOR UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI   (United States)

Author keywords

Arnoldi; Davidson's method; Eigenvalues; Krylov subspaces; Preconditioning

Indexed keywords

EID: 0032361805     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199801/02)5:1<33::AID-NLA125>3.0.CO;2-1     Document Type: Article

References (54)

1. S. F. Ashby, T. A. Manteuffel and P. E. Saylor. Adaptive polynomial preconditioning for Hermitian indefinite linear systems. BIT, 29, 583-609, 1989.
2. W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quart. Appl. Math., 9, 17-29, 1951.
3. Z. Bai, D. Day, J. Demmel and J. Dongarra. A test matrix collection for non-hermitian eigenvalue problems. LAPACK Working Note, 1996.
4. J. G. L. Booten, P. M. Meijer, H. J. J. te Riele and H. A. van der Vorst. Parallel Arnoldi method for the construction of a Krylov subspace basis: an application in magnetohydrodynamics. Proceedings of High Performance Computing and Networking, Vol. 2; Lecture Notes in Computer Science 797, Wolfgang Gentzsch and Uwe Harms, editors, Springer-Verlag, New York, NY, 1994, pp. 196-201.
5. D. Calvetti and L. Reichel. An adaptive Richardson iteration method for indefinite linear systems. Numer. Algorithms, 12, 125-150, 1996.
6. E. Chow and Y. Saad. Approximate inverse preconditioners for general sparse matrices. SIAM J. Sci. Comput., 18, 1657-1675, 1997.
7. A. K. Cline, G. H. Golub and G. W. Platzman. Calculation of normal modes of oceans using a Lanczos method. J. R. Bunch and D. J. Rose, editors, Sparse Matrix Computations, pages 409-426, Academic Press, New York, NY, 1976.
8. B. N. Datta and Y. Saad. Arnoldi's methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment. Linear Algebra Appl., 154-156, 225-244, 1991.
9. E. R. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Comput. Phys., 17, 87-94, 1975.
10. I. S. Duff, R. G. Grimes and J. G. Lewis. Sparse matrix test problems. ACM Trans. Math. Soft., 15, 1-14, 1989.
11. T. Ericsson and A. Ruhe. The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems. Math. Comp., 35, 1251-1268, 1980.
12. B. Fischer. On polynomial iterative methods for indefinite linear systems. Presentation at The Copper Mountain Conference on Iterative Methods, 1990.
13. R. Freund. On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrice. Linear Algebra Appl., 154-156, 259-288, 1991.
14. R. W. Freund. Quasi-kernel polynomials and their use in non-Hermitian matrix iterations. J. Comput. Appl. Math., 43, 135-158, 1992.
15. R. W. Freund, G. H. Golub and N. M. Nachtigal. Iterative solution of linear systems. Acta Numerica, 1, 57-100, 1992.
16. R. W. Freund and N. M. Nachtigal. QMRPACK: a package of QMR algorithms. ACM Trans. Math. Soft., 22, 46-77, 1996.
17. S. Goossens and D. Roose. Ritz and harmonic Ritz values and the convergence of FOM and GMRES. Report TW257, K.U. Leuven, 1997.
18. A. Jennings and W. J. Stewart. A simultaneous iteration algorithm for real matrices. J. Math. Inst. Appl., 15, 351-361, 1980.
19. A. V. Knyazev. Convergence rate estimates for iterative methods for mesh symmetric eigenvalue problem. Soviet J. Numer. Anal. and Math. Model., 2, 371-396, 1987.
20. A. V. Knyazev. The Temple-Lehmann methods in iterative algorithms. Soviet J. Numer. Anal. and Math. Model., 5, 265-273, 1990.
21. C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand., 45, 255-282, 1950.
22. T. A. Manteuffel and J. Otto. On the roots of orthogonal polynomials and residual polynomials associated with a conjugate gradient method. Num. Lin. Alg. with Appl., 1, 449-475, 1994.
23. T. A. Manteuffel and G. Starke. On hybrid iterative methods for nonsymetric systems of linear equations. Numer. Math., 73, 489-506, 1996.
24. J. A. Meijerink and H. A. van der Vorst. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comp., 31 , 148-162, 1977.
25. H. Mittelman, C. C. Law, D. F. Jankowski and G. P. Neitzel. A large, sparse, and indefinite generalized eigenvalue problem from fluid mechanics. SIAM J. Sci. Statist. Comput., 13, 411-424, 1992.
26. R. B. Morgan. Computing interior eigenvalues of large matrices. Linear Algebra Appl., 154-156, 289-309, 1991.
27. R. B. Morgan. Generalizations of Davidson's method for computing eigenvalues of large non-symmetric matrices. J. Comput. Phys., 101, 287-291, 1992.
28. R. B. Morgan. On restarting the Arnoldi method for large non-symmetric eigenvalue problems. Math. Comp., 65, 1213-1230, 1996.
29. R. B. Morgan and D. S. Scott. Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems. SIAM J. Sci. Comput., 14, 585-593, 1993.
30. R. B. Morgan. A restarted GMRES method augmented with eigenvectors. SIAM J. Matrix Anal. Appl., 16, 1154-1171, 1995.
31. R. B. Morgan and D. S. Scott. Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Statist. Comput., 1, 817-825, 1986.
32. N. M. Nachtigal, L. Reichel and L. N. Trefethen. A hybrid GMRES algorithm for non-symmetric linear systems. SIAM J. Matrix Anal. Appl., 13, 796-825, 1992.
33. C. C. Paige, B. N. Parlett and H. A. van der Vorst. Approximate solutions and eigenvalue bounds from Krylov subspaces. Num. Lin. Alg. with Appl., 2, 115-133, 1995.
34. C. C. Paige and M. A. Saunders. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal., 12, 617-629, 1975.
35. B. N. Parlett. The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, NJ, 1980.
36. B. N. Parlett, D. R. Taylor and Z. A. Liu. A look-ahead Lanczos algorithm for unsymmetric matrices. Math. Comp., 44, 105-124, 1985.
37. Y. Saad. ILUT: a dual threshold incomplete LU factorization. Num. Lin. Alg. with Appl., 1, 387-402, 1994.
38. Y. Saad. Iterative Methods for Sparse Linear Systems. PWS Publishing, Boston, MA, 1996.
39. Y. Saad. Numerical Methods for Large Eigenvalue Problems. Halsted Press, New York, NY, 1992.
40. Y. Saad. Numerical solution of large non-symmetric eigenvalue problems. Comput. Phys. Commun., 53, 71-90, 1989.
41. Y. Saad. Preconditioning techniques for non-symmetric and indefinite linear systems. J. Comput. Appl. Math., 24, 89-105, 1988.
42. Y. Saad. Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl., 34, 269-295, 1980.
43. Y. Saad and M. H. Schultz. GMRES: a generalized minimal residual algorithm for solving non-symmetric linear systems. SIAM J. Sci. Statist. Comput., 1, 856-869, 1986.
44. P. E. Saylor and D. C. Smolarski. Implementation of an adaptive algorithm for Richardson's method. Linear Algebra Appl., 154-156, 615-646, 1991.
45. D. S. Scott. The advantages of inverted operators in Rayleigh-Ritz approximations. SIAM J. Sci. Statist. Comput., 3, 68-75, 1982.
46. A. Sidi. Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods. SIAM J. Matrix Anal. Appl., 16, 1341-1369, 1995.
47. V. Simoncini. Ritz and pseudo-Ritz values using matrix polynomials. Linear Algebra Appl., 241-243, 787-801, 1996.
48. G. L. G. Sleijpen and H. A. van der Vorst. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl., 17, 401-425, 1996.
49. D. C. Sorensen. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl., 13, 357-385, 1992.
50. A. Stathopoulos, Y. Saad and F. Fischer. Robust preconditioning of large, sparse, symmetric eigenvalue problems. J. Comput. Appl. Math., 64, 197-215, 1995.
51. H. L. Tanaka and E. C. Kung. Normal mode energetics of the general circulation during FGGE winter. J. Atmos. Sci., 45, 3723-3736, 1988.
52. L. N. Trefethen. Approximation theory and linear algebra. In J. C. Mason and M. G. Cox, editors, Algorithms for Approximations, II, pages 336-360, Chapman and Hall, New York, NY, 1990.
53. R. Varga. Algorithms for iteratively solving large non-symmetric matrix equations. Presentation at The Copper Mountain Conference on Iterative Methods, 1990.
54. M. Zeng. Finding interior eigenvalues of large non-symmetric matrices. Ph.D. thesis, University of Missouri, Columbia, MO, 1996.