{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T02:30:17Z","timestamp":1783132217608,"version":"3.54.6"},"reference-count":24,"publisher":"American Mathematical Society (AMS)","issue":"251","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"

\n This paper concerns a harmonic projection method for computing an approximation to an eigenpair\n \n \n \n \n (<\/mml:mo>\n \n \u03bb\n \n <\/mml:mi>\n ,<\/mml:mo>\n x<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n (\\lambda , x)<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n of a large matrix\n \n \n \n A<\/mml:mi>\n A<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n . Given a target point\n \n \n \n \n \u03c4\n \n <\/mml:mi>\n \\tau<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n and a subspace\n \n \n \n \n W<\/mml:mi>\n <\/mml:mrow>\n \\mathcal {W}<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n that contains an approximation to\n \n \n \n x<\/mml:mi>\n x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n , the harmonic projection method returns an approximation\n \n \n \n \n (<\/mml:mo>\n \n \u03bc\n \n <\/mml:mi>\n +<\/mml:mo>\n \n \u03c4\n \n <\/mml:mi>\n ,<\/mml:mo>\n \n \n x<\/mml:mi>\n \n ~\n \n <\/mml:mo>\n <\/mml:mover>\n <\/mml:mrow>\n )<\/mml:mo>\n <\/mml:mrow>\n (\\mu +\\tau , \\tilde x)<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n to\n \n \n \n \n (<\/mml:mo>\n \n \u03bb\n \n <\/mml:mi>\n ,<\/mml:mo>\n x<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n (\\lambda ,x)<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n . Three convergence results are established as the deviation\n \n \n \n \n \u03f5\n \n <\/mml:mi>\n \\epsilon<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n of\n \n \n \n x<\/mml:mi>\n x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n from\n \n \n \n \n W<\/mml:mi>\n <\/mml:mrow>\n \\mathcal {W}<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n approaches zero. First, the harmonic Ritz value\n \n \n \n \n \n \u03bc\n \n <\/mml:mi>\n +<\/mml:mo>\n \n \u03c4\n \n <\/mml:mi>\n <\/mml:mrow>\n \\mu +\\tau<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n converges to\n \n \n \n \n \u03bb\n \n <\/mml:mi>\n \\lambda<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n if a certain Rayleigh quotient matrix is uniformly nonsingular. Second, the harmonic Ritz vector\n \n \n \n \n \n x<\/mml:mi>\n \n ~\n \n <\/mml:mo>\n <\/mml:mover>\n <\/mml:mrow>\n \\tilde x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n converges to\n \n \n \n x<\/mml:mi>\n x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n if the Rayleigh quotient matrix is uniformly nonsingular and\n \n \n \n \n \n \u03bc\n \n <\/mml:mi>\n +<\/mml:mo>\n \n \u03c4\n \n <\/mml:mi>\n <\/mml:mrow>\n \\mu +\\tau<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n remains well separated from the other harmonic Ritz values. Third, better error bounds for the convergence of\n \n \n \n \n \n \u03bc\n \n <\/mml:mi>\n +<\/mml:mo>\n \n \u03c4\n \n <\/mml:mi>\n <\/mml:mrow>\n \\mu +\\tau<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n are derived when\n \n \n \n \n \n x<\/mml:mi>\n \n ~\n \n <\/mml:mo>\n <\/mml:mover>\n <\/mml:mrow>\n \\tilde x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n converges. However, we show that the harmonic projection method can fail to find the desired eigenvalue\n \n \n \n \n \u03bb\n \n <\/mml:mi>\n \\lambda<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n \u2014in other words, the method can miss\n \n \n \n \n \u03bb\n \n <\/mml:mi>\n \\lambda<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n if it is very close to\n \n \n \n \n \u03c4\n \n <\/mml:mi>\n \\tau<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n . To this end, we propose to compute the Rayleigh quotient\n \n \n \n \n \u03c1\n \n <\/mml:mi>\n \\rho<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n of\n \n \n \n A<\/mml:mi>\n A<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n with respect to\n \n \n \n \n \n x<\/mml:mi>\n \n ~\n \n <\/mml:mo>\n <\/mml:mover>\n <\/mml:mrow>\n \\tilde x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n and take it as a new approximate eigenvalue.\n \n \n \n \n \u03c1\n \n <\/mml:mi>\n \\rho<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n is shown to converge to\n \n \n \n \n \u03bb\n \n <\/mml:mi>\n \\lambda<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n once\n \n \n \n \n \n x<\/mml:mi>\n \n ~\n \n <\/mml:mo>\n <\/mml:mover>\n <\/mml:mrow>\n \\tilde x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n tends to\n \n \n \n x<\/mml:mi>\n x<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n , no matter how\n \n \n \n \n \u03c4\n \n <\/mml:mi>\n \\tau<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n is close to\n \n \n \n \n \u03bb\n \n <\/mml:mi>\n \\lambda<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n . Finally, we show that if the Rayleigh quotient matrix is uniformly nonsingular, then the refined harmonic Ritz vector, or more generally the refined eigenvector approximation introduced by the author, converges. We construct examples to illustrate our theory.\n <\/p>","DOI":"10.1090\/s0025-5718-04-01684-9","type":"journal-article","created":{"date-parts":[[2005,4,12]],"date-time":"2005-04-12T12:20:25Z","timestamp":1113308425000},"page":"1441-1456","source":"Crossref","is-referenced-by-count":35,"title":["The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors"],"prefix":"10.1090","volume":"74","author":[{"given":"Zhongxiao","family":"Jia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"14","published-online":{"date-parts":[[2004,6,1]]},"reference":[{"issue":"1-2","key":"1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0377-0427(92)90263-W","article-title":"Quasi-kernel polynomials and their use in non-Hermitian matrix iterations","volume":"43","author":"Freund, Roland W.","year":"1992","journal-title":"J. Comput. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-0427","issn-type":"print"},{"key":"2","series-title":"Johns Hopkins Studies in the Mathematical Sciences","isbn-type":"print","volume-title":"Matrix computations","author":"Golub, Gene H.","year":"1996","ISBN":"https:\/\/id.crossref.org\/isbn\/080185413X","edition":"3"},{"issue":"3","key":"3","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/S0895479893246753","article-title":"The convergence of generalized Lanczos methods for large unsymmetric eigenproblems","volume":"16","author":"Jia, Zhong Xiao","year":"1995","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00238-8","article-title":"Refined iterative algorithms based on Arnoldi\u2019s process for large unsymmetric eigenproblems","volume":"259","author":"Jia, Zhongxiao","year":"1997","journal-title":"Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0024-3795","issn-type":"print"},{"key":"5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0024-3795(97)00023-2","article-title":"A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems","volume":"270","author":"Jia, Zhongxiao","year":"1998","journal-title":"Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0024-3795","issn-type":"print"},{"issue":"2","key":"6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s002110050367","article-title":"Generalized block Lanczos methods for large unsymmetric eigenproblems","volume":"80","author":"Jia, Zhongxiao","year":"1998","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"},{"issue":"1-3","key":"7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0024-3795(98)10197-0","article-title":"Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm","volume":"287","author":"Jia, Zhongxiao","year":"1999","journal-title":"Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0024-3795","issn-type":"print"},{"issue":"2-3","key":"8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0168-9274(98)00108-1","article-title":"A new family of block methods","volume":"30","author":"Meier Yang, U.","year":"1999","journal-title":"Appl. Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0168-9274","issn-type":"print"},{"issue":"1","key":"9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0168-9274(99)00008-2","article-title":"A refined subspace iteration algorithm for large sparse eigenproblems","volume":"32","author":"Jia, Zhongxiao","year":"2000","journal-title":"Appl. Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0168-9274","issn-type":"print"},{"issue":"4","key":"10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0168-9274(01)00132-5","article-title":"The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices","volume":"42","author":"Jia, Zhongxiao","year":"2002","journal-title":"Appl. Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0168-9274","issn-type":"print"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Z. Jia. Some theoretical comparisons of refined Ritz vectors and Ritz vectors, Science in China, Ser.A, 47 (Supp.) (2004): 222\u2013233.","DOI":"10.1360\/04za0020"},{"issue":"234","key":"12","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1090\/S0025-5718-00-01208-4","article-title":"An analysis of the Rayleigh-Ritz method for approximating eigenspaces","volume":"70","author":"Jia, Zhongxiao","year":"2001","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"13","doi-asserted-by":"crossref","unstructured":"Z. Jia and D. Niu. An implicitly restarted refined bidiagonalization Lanczos algorithm for computing a partial singular value decomposition, SIAM J. Matrix Anal. Appl., 25 (2003): 246\u2013265.","DOI":"10.1137\/S0895479802404192"},{"issue":"5","key":"14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/nla.1680010503","article-title":"On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method","volume":"1","author":"Manteuffel, Thomas A.","year":"1994","journal-title":"Numer. Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/1070-5325","issn-type":"print"},{"key":"15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0024-3795(91)90381-6","article-title":"Computing interior eigenvalues of large matrices","volume":"154\/156","author":"Morgan, Ronald B.","year":"1991","journal-title":"Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0024-3795","issn-type":"print"},{"issue":"1","key":"16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/(SICI)1099-1506(199801\/02)5:1<33::AID-NLA125>3.0.CO;2-1","article-title":"Harmonic projection methods for large non-symmetric eigenvalue problems","volume":"5","author":"Morgan, Ronald B.","year":"1998","journal-title":"Numer. Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/1070-5325","issn-type":"print"},{"issue":"2","key":"17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/nla.1680020205","article-title":"Approximate solutions and eigenvalue bounds from Krylov subspaces","volume":"2","author":"Paige, Chris C.","year":"1995","journal-title":"Numer. Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/1070-5325","issn-type":"print"},{"key":"18","series-title":"Classics in Applied Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971163","volume-title":"The symmetric eigenvalue problem","volume":"20","author":"Parlett, Beresford N.","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/0898714028"},{"key":"19","series-title":"Algorithms and Architectures for Advanced Scientific Computing","isbn-type":"print","volume-title":"Numerical methods for large eigenvalue problems","author":"Saad, Youcef","year":"1992","ISBN":"https:\/\/id.crossref.org\/isbn\/0719033861"},{"issue":"2","key":"20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","article-title":"A Jacobi-Davidson iteration method for linear eigenvalue problems","volume":"17","author":"Sleijpen, Gerard L. G.","year":"1996","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"21","first-page":"75","article-title":"Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems","volume":"7","author":"Sleijpen, Gerard L. G.","year":"1998","journal-title":"Electron. Trans. Numer. Anal."},{"key":"22","doi-asserted-by":"crossref","unstructured":"G. W. Stewart. Matrix Algorithms: Vol. II Eigensystems, SIAM, Philadelphia, PA, 2001.","DOI":"10.1137\/1.9780898718058"},{"key":"23","series-title":"Computer Science and Scientific Computing","isbn-type":"print","volume-title":"Matrix perturbation theory","author":"Stewart, G. W.","year":"1990","ISBN":"https:\/\/id.crossref.org\/isbn\/0126702306"},{"key":"24","isbn-type":"print","first-page":"3","article-title":"Computational methods for large eigenvalue problems","author":"van der Vorst, Henk A.","year":"2002","ISBN":"https:\/\/id.crossref.org\/isbn\/0444509062"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2005-74-251\/S0025-5718-04-01684-9\/S0025-5718-04-01684-9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2005-74-251\/S0025-5718-04-01684-9\/S0025-5718-04-01684-9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:11:04Z","timestamp":1776780664000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2005-74-251\/S0025-5718-04-01684-9\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,1]]},"references-count":24,"journal-issue":{"issue":"251","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["S0025-5718-04-01684-9"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-04-01684-9","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6,1]]}}}