{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T11:07:11Z","timestamp":1748516831001,"version":"3.40.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"The National Science Foundation of China","award":["12301485","12171273"],"award-info":[{"award-number":["12301485","12171273"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s11075-024-01901-0","type":"journal-article","created":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T11:14:16Z","timestamp":1722424456000},"page":"895-920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Refined and refined harmonic Jacobi\u2013Davidson methods for computing several GSVD components of a large regular matrix pair"],"prefix":"10.1007","volume":"99","author":[{"given":"Jinzhi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongxiao","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,31]]},"reference":[{"key":"1901_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719581","volume-title":"Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide","author":"Z Bai","year":"2000","unstructured":"Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., Van der Vorst, H.A.: Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. SIAM, Philadelphia, PA (2000)"},{"key":"1901_CR2","doi-asserted-by":"crossref","unstructured":"Cullum, J.K., Willoughby, R.A.: Lanczos Algorithms for Large Symmetric Eigenvalue Computations: Vol. I: Theory, SIAM, Philadelphia, PA, (2002)","DOI":"10.1137\/1.9780898719192"},{"key":"1901_CR3","doi-asserted-by":"crossref","unstructured":"Davis, T.A.,\u00a0Hu, Y.: The University of Florida sparse matrix collection, ACM Trans. Math. Software, 38 (2011), pp.\u00a01\u201325. Data available online at http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/","DOI":"10.1145\/2049662.2049663"},{"key":"1901_CR4","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations, 4th edn. The John Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"1901_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719697","volume-title":"Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion","author":"PC Hansen","year":"1998","unstructured":"Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, Philadelphia, PA (1998)"},{"key":"1901_CR6","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/S1064827500372973","volume":"23","author":"ME Hochstenbach","year":"2001","unstructured":"Hochstenbach, M.E.: A Jacobi-Davidson type SVD method. SIAM J. Sci. Comput. 23, 606\u2013628 (2001)","journal-title":"SIAM J. Sci. Comput."},{"key":"1901_CR7","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10543-004-5244-2","volume":"44","author":"ME Hochstenbach","year":"2004","unstructured":"Hochstenbach, M.E.: Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems. BIT 44, 721\u2013754 (2004)","journal-title":"BIT"},{"key":"1901_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.laa.2009.03.003","volume":"431","author":"ME Hochstenbach","year":"2009","unstructured":"Hochstenbach, M.E.: A Jacobi-Davidson type method for the generalized singular value problem. Linear Algebra Appl. 431, 471\u2013487 (2009)","journal-title":"Linear Algebra Appl."},{"key":"1901_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/nla.562","volume":"15","author":"ME Hochstenbach","year":"2008","unstructured":"Hochstenbach, M.E., Sleijpen, G.L.: Harmonic and refined Rayleigh-Ritz for the polynomial eigenvalue problem. Numer. Linear Algebra Appl. 15, 35\u201354 (2008)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1901_CR10","doi-asserted-by":"publisher","first-page":"A1574","DOI":"10.1137\/18M1192019","volume":"41","author":"J Huang","year":"2019","unstructured":"Huang, J., Jia, Z.: On inner iterations of Jacobi-Davidson type methods for large SVD computations. SIAM J. Sci. Comput. 41, A1574\u2013A1603 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"1901_CR11","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s11075-020-00984-9","volume":"87","author":"J Huang","year":"2021","unstructured":"Huang, J., Jia, Z.: On choices of formulations of computing the generalized singular value decomposition of a matrix pair. Numer. Algorithms 87, 689\u2013718 (2021)","journal-title":"Numer. Algorithms"},{"key":"1901_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10915-022-01993-7","volume":"93","author":"J Huang","year":"2022","unstructured":"Huang, J., Jia, Z.: Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair. J. Sci. Comput. 93, 41 (2022)","journal-title":"J. Sci. Comput."},{"key":"1901_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10915-022-02053-w","volume":"94","author":"J Huang","year":"2023","unstructured":"Huang, J., Jia, Z.: A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair. J. Sci. Comput. 94, 3 (2023)","journal-title":"J. Sci. Comput."},{"key":"1901_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00238-8","volume":"259","author":"Z Jia","year":"1997","unstructured":"Jia, Z.: Refined iterative algorithms based on Arnoldi\u2019s process for large unsymmetric eigenproblems. Linear Algebra Appl. 259, 1\u201323 (1997)","journal-title":"Linear Algebra Appl."},{"key":"1901_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0024-3795(98)10197-0","volume":"287","author":"Z Jia","year":"1999","unstructured":"Jia, Z.: Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm. Linear Algebra Appl. 287, 191\u2013214 (1999)","journal-title":"Linear Algebra Appl."},{"key":"1901_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0168-9274(01)00132-5","volume":"42","author":"Z Jia","year":"2002","unstructured":"Jia, Z.: The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices. Appl. Numer. Math. 42, 489\u2013512 (2002)","journal-title":"Appl. Numer. Math."},{"key":"1901_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1360\/04za0020","volume":"47","author":"Z Jia","year":"2004","unstructured":"Jia, Z.: Some theoretical comparisons of refined Ritz vectors and Ritz vectors. Sci. China Ser. A 47, 222\u2013233 (2004)","journal-title":"Sci. China Ser. A"},{"key":"1901_CR18","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1090\/S0025-5718-04-01684-9","volume":"74","author":"Z Jia","year":"2005","unstructured":"Jia, Z.: The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors. Math. Comput. 74, 1441\u20131456 (2005)","journal-title":"Math. Comput."},{"key":"1901_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s11075-006-9022-x","volume":"42","author":"Z Jia","year":"2006","unstructured":"Jia, Z.: Using cross-product matrices to compute the SVD. Numer. Algorithms 42, 31\u201361 (2006)","journal-title":"Numer. Algorithms"},{"key":"1901_CR20","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1007\/s11425-014-4791-5","volume":"57","author":"Z Jia","year":"2014","unstructured":"Jia, Z., Li, C.: Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method. Sci. China Math. 57, 1733\u20131752 (2014)","journal-title":"Sci. China Math."},{"key":"1901_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cam.2014.12.043","volume":"282","author":"Z Jia","year":"2015","unstructured":"Jia, Z., Li, C.: Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems. J. Comput. Appl. Math. 282, 83\u201397 (2015)","journal-title":"J. Comput. Appl. Math."},{"key":"1901_CR22","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/S0895479802404192","volume":"25","author":"Z Jia","year":"2003","unstructured":"Jia, Z., Niu, D.: An implicitly restarted refined bidiagonalization Lanczos method for computing a partial singular value decomposition. SIAM J. Matrix Anal. Appl. 25, 246\u2013265 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1901_CR23","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1137\/080733383","volume":"32","author":"Z Jia","year":"2010","unstructured":"Jia, Z., Niu, D.: A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices. SIAM J. Sci. Comput. 32, 714\u2013744 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1901_CR24","first-page":"737","volume":"70","author":"Z Jia","year":"2001","unstructured":"Jia, Z., Stewart, G.W.: An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Math. Comput. 70, 737\u2013747 (2001)","journal-title":"Math. Comput."},{"key":"1901_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.apnum.2003.11.011","volume":"49","author":"E Kokiopoulou","year":"2004","unstructured":"Kokiopoulou, E., Bekas, C., Gallopoulos, E.: Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization. Appl. Numer. Math. 49, 39\u201361 (2004)","journal-title":"Appl. Numer. Math."},{"key":"1901_CR26","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","volume":"5","author":"RB Morgan","year":"1998","unstructured":"Morgan, R.B., Zeng, M.: Harmonic projection methods for large non-symmetric eigenvalue problems. Numer. Linear Algebra Appl. 5, 33\u201355 (1998)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1901_CR27","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.laa.2005.07.024","volume":"415","author":"RB Morgan","year":"2006","unstructured":"Morgan, R.B., Zeng, M.: A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity. Linear Algebra Appl. 415, 96\u2013113 (2006)","journal-title":"Linear Algebra Appl."},{"key":"1901_CR28","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0718026","volume":"18","author":"CC Paige","year":"1981","unstructured":"Paige, C.C., Saunders, M.A.: Towards a generalized singular value decomposition. SIAM J. Numer. Anal. 18, 398\u2013405 (1981)","journal-title":"SIAM J. Numer. Anal."},{"key":"1901_CR29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971163","volume-title":"The Symmetric Eigenvalue Problem","author":"BN Parlett","year":"1998","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem. SIAM, Philadelphia, PA (1998)"},{"key":"1901_CR30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia, PA (2003)","edition":"2"},{"key":"1901_CR31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y Saad","year":"2011","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems. SIAM, Philadelphia, PA (2011)"},{"key":"1901_CR32","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1137\/S1064827597327309","volume":"21","author":"HD Simon","year":"2000","unstructured":"Simon, H.D., Zha, H.: Low-rank matrix approximation using the Lanczos bidiagonalization process with applications. SIAM J. Sci. Comput. 21, 2257\u20132274 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"1901_CR33","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S1064827596304162","volume":"19","author":"A Stathopoulos","year":"1998","unstructured":"Stathopoulos, A., Saad, Y., Wu, K.: Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods. SIAM J. Sci. Comput. 19, 227\u2013245 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"1901_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718058","volume-title":"Matrix Algorithms II: Eigensystems","author":"GW Stewart","year":"2001","unstructured":"Stewart, G.W.: Matrix Algorithms II: Eigensystems. SIAM, Philadelphia, PA (2001)"},{"key":"1901_CR35","volume-title":"Matrix Perturbation Theory","author":"GW Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.-G.: Matrix Perturbation Theory. Acadmic Press Inc, Boston (1990)"},{"key":"1901_CR36","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1016\/j.laa.2011.07.022","volume":"436","author":"M Stoll","year":"2012","unstructured":"Stoll, M.: A Krylov-Schur approach to the truncated SVD. Linear Algebra Appl. 436, 2795\u20132806 (2012)","journal-title":"Linear Algebra Appl."},{"key":"1901_CR37","volume-title":"Computational Methods for Large Eigenvalue Problems","author":"H Van der Vorst","year":"2002","unstructured":"Van der Vorst, H.: Computational Methods for Large Eigenvalue Problems. Elsevier, Holland (2002)"},{"key":"1901_CR38","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1137\/0713009","volume":"13","author":"CF Van Loan","year":"1976","unstructured":"Van Loan, C.F.: Generalizing the singular value decomposition. SIAM J. Numer. Anal. 13, 76\u201383 (1976)","journal-title":"SIAM J. Numer. Anal."},{"key":"1901_CR39","doi-asserted-by":"publisher","first-page":"S248","DOI":"10.1137\/16M1082214","volume":"39","author":"L Wu","year":"2017","unstructured":"Wu, L., Romero, E., Stathopoulos, A.: PRIMME_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations. SIAM J. Sci. Comput. 39, S248\u2013S271 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"1901_CR40","doi-asserted-by":"publisher","first-page":"S365","DOI":"10.1137\/140979381","volume":"37","author":"L Wu","year":"2015","unstructured":"Wu, L., Stathopoulos, A.: A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices. SIAM J. Sci. Comput. 37, S365\u2013S388 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"1901_CR41","unstructured":"Zwaan, I.N.: Cross product-free matrix pencils for computing generalized singular values, (2019). arXiv:1912.08518"},{"key":"1901_CR42","unstructured":"Zwaan, I.N., Hochstenbach, M.E.: Generalized Davidson and multidirectional-type methods for the generalized singular value decomposition, (2017). arXiv:1705.06120"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01901-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01901-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01901-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T07:51:16Z","timestamp":1746863476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01901-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,31]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1901"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01901-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2024,7,31]]},"assertion":[{"value":"28 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}