Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems

References

• Bai , Z. , Barrett , R. , Day , D. , Demmel , J. and Dongarra , J. 1997 . A test matrix collection for non-Hermitian eigenvalue problems , Knoxville, TN : University of Tennessee . Technical Report CS-97-355
   Google Scholar
• Bai , Z. , Demmel , J. , Dongarra , J. , Ruhe , A. and van der Vorst , H. A. 2000 . Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide , Philadelphia, PA : SIAM .
   Google Scholar
• Cao , Z. and Yu , X. 2004 . A note on weighted FOM and GMRES for solving nonsymmetric linear systems . Appl. Math. Comput. , 151 : 719 – 727 .
   Google Scholar
• Chen , T. and Demmel , J. 2000 . Balancing sparse matrices for computing eigenvalues . Linear Algebra Appl. , 309 : 261 – 287 .
   Google Scholar
• Duff , I. , Grimes , R. and Lewis , J. 1989 . Sparse matrix test problems . ACM Trans. Math. Softw. , 15 : 1 – 14 .
   Web of Science ®Google Scholar
• Essai , A. 1998 . Weighted FOM and GMRES for solving nonsymmetric linear systems . Numer. Algorithm , 18 : 277 – 292 .
   Google Scholar
• Freund , R. 1992 . Quasi-kernel polynomials and their use in non-Hermitian matrix iterations . J. Comput. Appl. Math. , 43 : 135 – 158 .
   Google Scholar
• Golub , G. H. and Van Loan , C. 1996 . Matrix Computation , 3 , Baltimore, MD : Johns Hopkins University Press .
   Google Scholar
• Heyouni , M. and Essai , A. 2005 . Matrix Krylov subspace methods for linear systems with multiple right-hand sides . Numer. Algorithm , 40 : 137 – 156 .
   Web of Science ®Google Scholar
• Jing , Y. and Huang , T. 2009 . Restarted weighted full orthogonalization method for shifted linear systems . Comput. Math. Appl. , 57 : 1583 – 1591 .
   Google Scholar
• Lehoucq , R. and Sorensen , D. 1996 . Deflation techniques for an implicitly restarted Arnoldi iteration . SIAM J. Matrix Anal. Appl. , 17 : 789 – 829 .
   Web of Science ®Google Scholar
• Lewis , J. PLSK1919: Platzman's oceanographic models – skew-symmetric full model. Matrix Market; software available at http://math.nist.gov/MatrixMarket/data/Harwell-Boeing/platz/plsk1919.html. .
   Google Scholar
• MATLAB 7. The MathWorks, Inc.; software available at: http://www.mathworks.com
   Google Scholar
• Meerbergen , K. 1998 . A theoretical comparison between inner productions in the shift-invert Arnoldi method and the spectral transformation Lanczos method . Electron. Trans. Numer. Anal. , 7 : 90 – 103 .
   Google Scholar
• Morgan , R. B. 1991 . Computing interior eigenvalues of large matrices . Linear Algebra Appl. , 154–156 : 289 – 209 .
   Google Scholar
• Morgan , R. B. 1996 . On restarting the Arnoldi methods for nonsymmetric eigenvalue problems . Math. Comput. , 65 : 1213 – 1230 .
   Google Scholar
• Morgan , R. B. 2002 . GMRES with deflated restarting . SIAM J. Sci. Comput. , 24 : 20 – 37 .
   Google Scholar
• Morgan , R. B. and Zeng , M. 1998 . Harmonic projection methods for large non-symmetric eigenvalue problems . Numer. Linear Algebra Appl. , 5 : 33 – 55 .
   Google Scholar
• Morgan , R. B. and Zeng , M. 2006 . A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity . Linear Algebra Appl. , 415 : 96 – 113 .
   Google Scholar
• Osborne , E. 1960 . On pre-conditioning of matrices . J. ACM , 7 : 338 – 345 .
   Google Scholar
• Paige , C. , Parlett , B. and van der Vorst , H. A. 1995 . Approximate solutions and eigenvalue bounds from Krylov subspace . Numer. Linear Algebra Appl. , 2 : 115 – 133 .
   Web of Science ®Google Scholar
• Parlett , B. N. 1980 . The Symmetric Eigenvalue Problem , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Parlett , B. and Reinsch , C. 1969 . Balancing a matrix for calculation of eigenvalues and eigenvectors . Numer. Math. , 13 : 293 – 304 .
   Web of Science ®Google Scholar
• Saad , Y. 1992 . “ Numerical Methods for Large Eigenvalue Problem ” . New York, NY : Halsted Press .
   Google Scholar
• Saad , Y. 2003 . Iteration Method for Sparse Linear Systems , 2 , Philadelphia, PA : SIAM .
   Google Scholar
• Sleijpen , G. and Van der Vorst , H. 1996 . A Jacobi–Davidson iteration method for linear eigenvalue problems . SIAM J. Matrix Anal. Appl. , 17 : 401 – 425 .
   Web of Science ®Google Scholar
• Sorensen , D. 1992 . Implicit application of polynomial filters in a k-step Arnoldi method . SIAM J. Matrix Anal. Appl. , 13 : 357 – 385 .
   Web of Science ®Google Scholar
• Stathopoulos , A. , Saad , Y. and Wu , K. 1998 . Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods . SIAM J. Sci. Comput. , 19 : 227 – 245 .
   Web of Science ®Google Scholar
• Stewart , G. W. 2001 . Matrix Algorithms II: Eigensystems , Philadelphia : SIAM .
   Google Scholar
• Watkins , D. 2006 . A case where balancing is harmful . Electron. Trans. Numer. Anal. , 23 : 1 – 4 .
   Google Scholar
• Wu , G. 2007 . A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigenproblems . J. Comput. Appl. Math. , 205 : 343 – 363 .
   Google Scholar
• Wu , K. and Simon , H. 2000 . Thick-restart Lanczos method for symmetric eigenvalue problems . SIAM J. Matrix Anal. Appl. , 22 : 602 – 616 .
   Web of Science ®Google Scholar
• Wu , G. and Wei , Y. 2007 . A Power-Arnoldi algorithm for computing PageRank . Numer. Linear Algebra Appl. , 14 ( 7 ) : 521 – 546 .
   Google Scholar