{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:08:18Z","timestamp":1768547298189,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s0096-3003(03)00655-6","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T17:49:34Z","timestamp":1060278574000},"page":"611-643","source":"Crossref","is-referenced-by-count":6,"title":["An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems"],"prefix":"10.1016","volume":"153","author":[{"given":"Gang","family":"Wu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0096-3003(03)00655-6_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0024-3795(80)90169-X","article-title":"Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices","volume":"34","author":"Saad","year":"1980","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB2","series-title":"Algorithms and Architecture for Advanced Scientific Computing","article-title":"Numerical methods for large eigenproblems","author":"Saad","year":"1992"},{"key":"10.1016\/S0096-3003(03)00655-6_BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/qam\/42792","article-title":"The principle of minimized iteration in the solution of the matrix eigenvalue problem","volume":"9","author":"Arnoldi","year":"1951","journal-title":"Quart. Appl. Math."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01388686","article-title":"A block Arnoldi\u2013Chebyshev method for computing the leading eigen-pairs for unsymmetric large eigenvalue problems","volume":"64","author":"Sadkine","year":"1993","journal-title":"Numer. Math."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01388687","article-title":"Block Arnoldi and Davision method for unsymmetric large eigenvalue problems","volume":"64","author":"Sadkine","year":"1993","journal-title":"Numer. Math."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB6","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1145\/212066.212091","article-title":"An Arnoldi code for computing selected eigenvalues of sparse real unsymmetric matrices","volume":"21","author":"Scott","year":"1995","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB7","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/s002110050367","article-title":"Generalized block Lanczos methods for large unsymmetric eigenproblems","volume":"80","author":"Jia","year":"1998","journal-title":"Numer. Math."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1093\/imamat\/8.1.111","article-title":"A simultaneous iteration method for the unsymmetric eigenvalue problem","volume":"8","author":"Clint","year":"1971","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0021-9991(75)90065-0","article-title":"The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices","volume":"17","author":"Davision","year":"1975","journal-title":"J. Comput. Phy."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB10","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1137\/S0895479893246753","article-title":"The convergence of generalized Lanczos methods for large unsymmetric eigenvalue problems","volume":"16","author":"Jia","year":"1995","journal-title":"SIAM. J. Matrix Anal. Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0025-5718-00-01208-4","article-title":"An analysis of the Rayleigh\u2013Ritz method for approximating eigenspaces","volume":"70","author":"Jia","year":"2001","journal-title":"Math.Comput."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB12","unstructured":"Z. Jia, Some numerical methods for large unsymmetric eigenproblems, Ph.D. Thesis, Department of Mathematics, University of Bielefeld, Germany, 1994"},{"key":"10.1016\/S0096-3003(03)00655-6_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0024-3795(96)00238-8","article-title":"Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems","volume":"259","author":"Jia","year":"1997","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB14","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","year":"1998","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB15","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF02683827","article-title":"A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems","volume":"14","author":"Jia","year":"1998","journal-title":"Acta. Math. Appl. Sinica"},{"key":"10.1016\/S0096-3003(03)00655-6_BIB16","first-page":"265","article-title":"Improving eigenvectors in Arnoldi's method","volume":"18","author":"Jia","year":"2000","journal-title":"J. Comput. Math."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB17","first-page":"772","article-title":"Reorthogonalization and stable algorithms for updating the Gram\u2013Schmidt QR factorization","volume":"30","author":"Daniel","year":"1974","journal-title":"Math. Comput."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/0613025","article-title":"Implicitly application of polynomials filters in a k-step Arnoldi method","volume":"13","author":"Sorensen","year":"1992","journal-title":"SIAM. J. Matrix Anal. Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB19","doi-asserted-by":"crossref","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","year":"2000","journal-title":"Appl. Numer. Math."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB20","series-title":"Matrix Computations","author":"Gloub","year":"1996"},{"key":"10.1016\/S0096-3003(03)00655-6_BIB21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0024-3795(99)00104-4","article-title":"Absolute and relative perturbation bounds for invariant subspaces of matrices","volume":"309","author":"Ipsen","year":"2000","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB22","unstructured":"Z. Jia, A theoretical comparison of two classes of projection methods, Technical Report, Department of Applied Mathematics, Dalian University of Technology, 2000"},{"key":"10.1016\/S0096-3003(03)00655-6_BIB23","doi-asserted-by":"crossref","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","year":"1999","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB24","unstructured":"Z. Bai, R. Barret, D. Day, J. Demmel, J. Dongarra, Test matrix collection for non-Hermitian eigenvalue problems, Technical report, Department of Mathematics, University of Kentucky, US, 1995"},{"key":"10.1016\/S0096-3003(03)00655-6_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","article-title":"Sparse matrix test problems","volume":"15","author":"Duff","year":"1989","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/S0096-3003(03)00655-6_BIB26","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1090\/S0025-5718-1984-0736453-8","article-title":"Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems","volume":"42","author":"Saad","year":"1984","journal-title":"Math. Comput."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300303006556?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300303006556?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:52:21Z","timestamp":1552629141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300303006556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S0096300303006556"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(03)00655-6","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}