Using generalized Cayley transformations within an inexact rational Krylov sequence method

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 1, 1998, Pages 131-148

  Lehoucq, R B ^a,b   Meerbergen, Karl ^c  

^a ARGONNE NATIONAL LABORATORY   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Arnoldi method; Cayley transformation; Eigenvalues; Generalized eigenvalue problem; Rational krylov sequence

Indexed keywords

EID: 0032217348     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896311220     Document Type: Article

References (42)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, 2nd ed., SIAM, Philadelphia, PA, 1995.
2. W. E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
3. R. BARRETT, M. BERRY, T. CHAN, J. DEMMEL, J. DONATO, J. DONGARRA, V. EIJKHOUT, R. POZO, C. ROMINE, AND H. VAN DER VORST, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, PA, 1993.
4. J. H. BRAMBLE, A. V. KNYAZEV, AND J. E. PASCIAK, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Adv. Comput. Math., 6 (1996), pp. 159-189.
5. J. W. DANIEL, W. B. GRAGG, L. KAUFMAN, AND G. W. STEWART, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-795.
6. 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 (1975), pp. 87-94.
7. T. A. DAVIS AND I. S. DUFF, An unsymmetric-pattern multifrontal method for sparse LU factorization, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 140-158.
8. T. A. DAVIS AND I. S. DUFF, A combined unifrontal/multifrontal method for unsymmetric sparse matrices, ACM Trans. Math. Software, to appear.
9. J. W. DEMMEL, S. C. EISENSTAT, J. R. GILBERT, X. S. LI, AND J. W. H. LIU, A supernodal approach to sparse partial pivoting, SIAM J. Matrix Anal. Appl., to appear.
10. I. S. DUFF, ME28 : A sparse unsymmetric linear equation solver for complex equations, ACM Trans. Math. Software, 7 (1981), pp. 505-511.
11. I. S. DUFF AND J. K. REID, The design of MA48, a code for direct solution of sparse unsymmetric linear systems of equations, ACM Trans. Math. Software, 22 (1996), pp. 187-226.
12. I. S. DUFF AND J. A. SCOTT, The design of a new frontal code for solving sparse unsymmetric systems, ACM Trans. Math. Software, 22 (1996), pp. 30-45.
13. T. ERICSSON AND A. RUHE, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. Comp., 35 (1980), pp. 1251-1268.
14. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson style QR and QZ algorithms for the partial reduction of matrix pencils, SIAM J. Sci. Comput., 20 (1999), pp. 94-125.
15. R. W. FREUND, G. H. GOLUB, AND N. M. NACHTIGAL, Iterative solution of linear systems, in Acta Numerica, A. Iserles, ed., Cambridge University Press, Cambridge, UK, 1992, pp. 57-100.
16. R. W. FREUND AND N. M. NACHTIGAL, QMRPACK: A package of QMR algorithms, ACM Trans. Math. Software, 22 (1996), pp. 46-77.
17. G. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
18. A. V. KNYAZEV, Convergence rate estimates for iterative methods for mesh symmetric eigenvalue problem, Soviet J. Numer. Anal. Math. Modelling, 2 (1987), pp. 371-396.
19. A. V. KNYAZEV AND A. L. SKOROKHODOV, Preconditioned gradient-type iterative methods in a subspace for partial generalized symmetric eigenvalue problems, SIAM J. Numer. Anal., 31 (1994), pp. 1226-1239.
20. Y.-L. LAI, K.-Y. LIN, AND W.-W. LIN, An inexact inverse iteration for large sparse eigenvalue problems, Numer. Linear Algebra Appl., 4 (1997), pp. 425-437.
21. R. B. LEHOUCQ, D. C. SORENSEN, AND C. YANG, ARPACK Users' Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, PA, 1998.
22. K. MEERBERGEN AND D. ROOSE, Matrix transformations for computing rightmost eigenvalues of real nonsymmetric matrices, IMA J. Numer. Anal., 16 (1996), pp. 297-346.
23. K. MEERBERGEN AND D. ROOSE, The restarted Arnoldi method applied to iterative linear system solvers for the computation of rightmost eigenvalues, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 1-20.
24. K. MEERBERGEN AND A. SPENCE, Implicitly restarted Arnoldi with purification for the shift-invert transformation, Math. Comp., 218 (1997), pp. 667-689.
25. R. B. MORGAN, Davidson's method and preconditioning for generalized eigenvalue problems, J. Comput. Phys., 89 (1990), pp. 241-245.
26. R. B. MORGAN, Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, J. Comput. Phys. 101 (1992), pp. 287-291.
27. B. NOUR-OMID, B. N. PARLETT, T. ERICSSON, AND P. S. JENSEN, How to implement the spectral transformation, Math. Comp., 48 (1987), pp. 663-673.
28. W. E. OLMSTEAD, S. H. DAVIS, S. ROSENBLAT, AND W. L. KATH, Bifurcation with memory, SIAM J. Appl. Math., 46 (1986), pp. 171-188.
29. B. PHILIPPE AND M. SADKANE, Improving the spectral transformation block Arnoldi method, in Proc. Second IMACS Internat. Symposium on Iterative Methods in Linear Algebra, Blagoevgrad, Bulgaria, 1995, IMACS Series in Computational and Applied Mathematics, vol. 3, P. S. Vassilevski and S. D. Margenov, eds., pp. 57-63.
30. A. RUHE, Rational Krylov sequence methods for eigenvalue computation, Linear Algebra Appl., 58 (1984), pp. 391-405.
31. A. RUHE, The rational Krylov algorithm for nonsymmetric eigenvalue problems, III: Complex shifts for real matrices, BIT, 34 (1994), pp. 165-176.
32. A. RUHE, Rational Krylov: A practical algorithm for large sparse nonsymmetric matrix pencils, SIAM J. Sci. Comput., 19 (1998), pp. 1535-1551.
33. Y. SAAD, SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations, Technical Report 90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA, 1990.
34. Y. SAAD, Iterative Methods for Sparse Linear Systems. PWS, Boston, MA, 1996.
35. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869.
36. G. DE SAMBLANX, K. MEERBERGEN, AND A. BULTHEEL, The implicit application of a rational filter in the rks method, BIT, 37 (1997), pp. 925-947.
37. G. L. G. SLEIJPEN, D. R. FOKKEMA, AND H. A VAN DER VORST, BiCGstab(ℓ) and other hybrid Bi-CG methods, Numer. Algorithms, 7 (1994), pp. 75-109.
38. 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 (1996), pp. 401-425.
39. G. L. G. SLEIJPEN, J. G. L. BOOTEN, D. R. FOKKEMA, AND H. A. VAN DER VORST, Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, BIT, 36 (1996), pp. 595-633.
40. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
41. D.C. SORENSEN, Truncated QZ Methods for Large Scale Generalized Eigenvalue Problems, Technical Report TR98-01, Rice University, Houston, TX, 1998.
42. DANIEL B. SZYLD, Criteria for combining inverse and Rayleigh quotient iteration, SIAM J. Numer. Anal., 25 (1988), pp. 1369-1375.