{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T17:25:52Z","timestamp":1782321952152,"version":"3.54.5"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171273"],"award-info":[{"award-number":["12171273"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018541","name":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars","doi-asserted-by":"publisher","award":["BK20220482"],"award-info":[{"award-number":["BK20220482"]}],"id":[{"id":"10.13039\/501100018541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10915-022-01993-7","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T18:05:47Z","timestamp":1663351547000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Two Harmonic Jacobi\u2013Davidson Methods for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair"],"prefix":"10.1007","volume":"93","author":[{"given":"Jinzhi","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9761-8517","authenticated-orcid":false,"given":"Zhongxiao","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,16]]},"reference":[{"key":"1993_CR1","unstructured":"Alvarruiz, F., Campos, C., Roman, J.E.: Thick-restarted joint Lanczos bidiagonalization for the GSVD, (2022). arXiv:2206.03768 [math.NA]"},{"key":"1993_CR2","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":"1993_CR3","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/060651057","volume":"30","author":"T Betcke","year":"2008","unstructured":"Betcke, T.: The generalized singular value decomposition and the method of particular solutions. SIAM J. Sci. Comput. 30, 1278\u20131295 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"1993_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"\u00c5 Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, \u00c5.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia, PA (1996)"},{"key":"1993_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0024-3795(87)90104-2","volume":"88","author":"K-WE Chu","year":"1987","unstructured":"Chu, K.-W.E.: Singular value and generalized singular value decompositions and the solution of linear matrix equations. Linear Algebra Appl. 88, 83\u201398 (1987)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR6","doi-asserted-by":"crossref","unstructured":"Chui, K., Charles, Wang, J.: Randomized anisotropic transform for nonlinear dimensionality reduction, Int. J. Geomath, 1, 23\u201350 (2010)","DOI":"10.1007\/s13137-010-0004-8"},{"key":"1993_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.acha.2006.04.006","volume":"21","author":"RR Coifman","year":"2006","unstructured":"Coifman, R.R., Lafon, S.: Diffusion maps. Appl. Comput. Harmon. Anal. 21, 5\u201330 (2006)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1993_CR8","first-page":"5","volume":"21","author":"RR Coifman","year":"2006","unstructured":"Coifman, R.R., Lafon, S., Lee, A.B., Maggioni, M., Nadler, B., Warner, F., Zucker, S.W.: Geometric diffusions as a tool for harmonic analysis and structure definition of data: Multiscale methods. PNAS 21, 5\u201330 (2006)","journal-title":"PNAS"},{"key":"1993_CR9","doi-asserted-by":"crossref","unstructured":"Davis, T.A., Hu, Y.: The University of Florida Sparse Matrix Collection, ACM Trans. Math. Software, 38, 1\u201325 (2011). Data available online at http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/","DOI":"10.1145\/2049662.2049663"},{"key":"1993_CR10","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1137\/S0036142995289883","volume":"35","author":"Z Drma\u010d","year":"1998","unstructured":"Drma\u010d, Z.: A tangent algorithm for computing the generalized singular value decomposition. SIAM J. Numer. Anal. 35, 1804\u20131832 (1998)","journal-title":"SIAM J. Numer. Anal."},{"key":"1993_CR11","doi-asserted-by":"crossref","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":"1993_CR12","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":"1993_CR13","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":"1993_CR14","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":"1993_CR15","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":"1993_CR16","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":"1993_CR17","unstructured":"Huang, J., Jia, Z.: A cross-product free Jacobi\u2013Davidson type method for computing a partial generalized singular value decomposition (GSVD) of a large matrix pair, (2020). arXiv:2004.13975 [math.NA]"},{"key":"1993_CR18","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. Algor. 87, 689\u2013718 (2021)","journal-title":"Numer. Algor."},{"key":"1993_CR19","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":"1993_CR20","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":"1993_CR21","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":"1993_CR22","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":"1993_CR23","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":"1993_CR24","unstructured":"Jia, Z., Li, H.: The joint bidiagonalization method for large GSVD computations in finite precision, (2019). arXiv:1912.08505 [math.NA], revised in January (2022)"},{"key":"1993_CR25","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s11075-020-01064-8","volume":"88","author":"Z Jia","year":"2021","unstructured":"Jia, Z., Li, H.: The joint bidiagonalization process with partial reorthogonalization. Numer. Algor. 88, 965\u2013992 (2021)","journal-title":"Numer. Algor."},{"key":"1993_CR26","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":"1993_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apnum.2020.06.001","volume":"157","author":"Z Jia","year":"2020","unstructured":"Jia, Z., Yang, Y.: A joint bidiagonalization based algorithm for large scale general-form Tikhonov regularization. Appl. Numer. Math. 157, 159\u2013177 (2020)","journal-title":"Appl. Numer. Math."},{"key":"1993_CR28","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/BF01934915","volume":"24","author":"B K\u00e5gstr\u00f6m","year":"1984","unstructured":"K\u00e5gstr\u00f6m, B.: The generalized singular value decomposition and the general (A$$-\\lambda $$B)-problem. BIT 24, 568\u2013583 (1984)","journal-title":"BIT"},{"key":"1993_CR29","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/050645592","volume":"29","author":"ME Kilmer","year":"2007","unstructured":"Kilmer, M.E., Hansen, P.C., Espanol, M.I.: A projection-based approach to general-form Tikhonov regularization. SIAM J. Sci. Comput. 29, 315\u2013330 (2007)","journal-title":"SIAM J. Sci. Comput."},{"key":"1993_CR30","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":"1993_CR31","doi-asserted-by":"crossref","unstructured":"Novakovic\u0300, V., Singer, S., Singer, S.: Blocking and parallelization of the Hari\u2013Zimmermann variant of the Falk\u2013Langemeyer algorithm for the generalized SVD. Parell Comput., 49, 136\u2013152 (2015)","DOI":"10.1016\/j.parco.2015.06.004"},{"key":"1993_CR32","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":"1993_CR33","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Soft. 8, 43\u201371 (1982)","journal-title":"ACM Trans. Math. Soft."},{"key":"1993_CR34","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":"1993_CR35","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":"1993_CR36","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":"1993_CR37","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":"1993_CR38","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. Elsvier, Holland (2002)"},{"key":"1993_CR39","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":"1993_CR40","doi-asserted-by":"publisher","first-page":"S248","DOI":"10.1137\/16M1082214","volume":"39","author":"L Wu","year":"2017","unstructured":"Wu, L., Romero, R., 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":"1993_CR41","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":"1993_CR42","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s002110050175","volume":"72","author":"H Zha","year":"1996","unstructured":"Zha, H.: Computing the generalized singular values\/vectors of large sparse or structured matrix pairs. Numer. Math. 72, 391\u2013417 (1996)","journal-title":"Numer. Math."},{"key":"1993_CR43","unstructured":"Zwaan, I.N.: Cross product-free matrix pencils for computing generalized singular values, (2019). arXiv:1912.08518 [math.NA]"},{"key":"1993_CR44","unstructured":"Zwaan, I.N., Hochstenbach, M.E.: Generalized Davidson and multidirectional-type methods for the generalized singular value decomposition, (2017). arXiv:1705.06120 [math.NA]"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01993-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-01993-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01993-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T11:09:47Z","timestamp":1676804987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-01993-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,16]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1993"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-01993-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,16]]},"assertion":[{"value":"2 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The two authors declare that they have no financial interests, and they read and approved the final manuscript. The Matlab codes of two algorithms are available from the corresponding author on reasonable request.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"41"}}