{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T17:23:18Z","timestamp":1777915398316,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10915-022-02053-w","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T16:24:06Z","timestamp":1669307046000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Cross-Product Free Jacobi\u2013Davidson Type Method for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair"],"prefix":"10.1007","volume":"94","author":[{"given":"Jinzhi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9761-8517","authenticated-orcid":false,"given":"Zhongxiao","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"key":"2053_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)"},{"issue":"3","key":"2053_CR2","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(3), 1278\u20131295 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"2053_CR3","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":"2053_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0024-3795(87)90104-2","volume":"88","author":"KWE 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":"2053_CR5","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":"2053_CR6","volume-title":"Matrix Computations","author":"GH Golub","year":"2012","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. John Hopkins University Press, Baltimore (2012)","edition":"4"},{"key":"2053_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970937","volume-title":"Iterative methods for solving linear systems","author":"A Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Iterative methods for solving linear systems. SIAM, Philadephia, PA (1997)"},{"issue":"3","key":"2053_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/BF02219234","volume":"29","author":"PC Hansen","year":"1989","unstructured":"Hansen, P.C.: Regularization, GSVD and truncated GSVD. BIT 29(3), 491\u2013504 (1989)","journal-title":"BIT"},{"key":"2053_CR9","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)"},{"issue":"3\u20134","key":"2053_CR10","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(3\u20134), 471\u2013487 (2009)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2053_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/S0895479801393666","volume":"25","author":"P Howland","year":"2003","unstructured":"Howland, P., Jeon, M., Park, H.: Structure preserving dimension reduction for clustered text data based on the generalized singular value decomposition. SIAM J. Matrix Anal. Appl. 25(1), 165\u2013179 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2053_CR12","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(3), A1574\u2013A1603 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"2053_CR13","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."},{"issue":"2","key":"2053_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10915-022-01993-07","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(2), 41 (2022). https:\/\/doi.org\/10.1007\/s10915-022-01993-07","journal-title":"J. Sci. Comput."},{"key":"2053_CR15","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":"2053_CR16","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":"2053_CR17","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."},{"issue":"234","key":"2053_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1090\/S0025-5718-00-01208-4","volume":"70","author":"Z Jia","year":"2001","unstructured":"Jia, Z., Stewart, G.: An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Math. Comput. 70(234), 637\u2013647 (2001)","journal-title":"Math. Comput."},{"key":"2053_CR19","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 iterative algorithm for large scale general-form tikhonov regularization. Appl. Numer. Math. 157, 159\u2013177 (2020)","journal-title":"Appl. Numer. Math."},{"issue":"4","key":"2053_CR20","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(4), 568\u2013583 (1984)","journal-title":"BIT"},{"issue":"3","key":"2053_CR21","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(3), 398\u2013405 (1981)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"2053_CR22","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/040607599","volume":"27","author":"CH Park","year":"2005","unstructured":"Park, C.H., Park, H.: A relationship between linear discriminant analysis and the generalized minimum squared error solution. SIAM J. Matrix Anal. Appl. 27(2), 474\u2013492 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2053_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s40096-017-0223-3","volume":"11","author":"AH Refahi Sheikhani","year":"2017","unstructured":"Refahi Sheikhani, A.H., Kordrostami, S.: New iterative methods for generalized singular value problems. Math. Sci. 11, 247\u2013265 (2017)","journal-title":"Math. Sci."},{"key":"2053_CR24","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":"2053_CR25","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":"2053_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718058","volume-title":"Matrix algorithms eigen systems","author":"GW Stewart","year":"2001","unstructured":"Stewart, G.W.: Matrix algorithms eigen systems, vol. II. SIAM, Philadephia, PA (2001)"},{"key":"2053_CR27","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":"2053_CR28","doi-asserted-by":"crossref","unstructured":"van der Vorst, H.A.: Computational Methods for Large Eigenvalue Problems. Handbook of Numerical Analysis, Vol. VIII, Ciarlet, P.G., Lions, J.L. (eds), Elsvier (2002)","DOI":"10.1016\/S1570-8659(02)08003-1"},{"key":"2053_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3552-0","volume-title":"Total least squares and errors-in-variables modeling","author":"S Van Huffel","year":"2002","unstructured":"Van Huffel, S., Lemmerling, P.: Total least squares and errors-in-variables modeling. Kluwer Academic Publishers (2002)"},{"issue":"1","key":"2053_CR30","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(1), 76\u201383 (1976)","journal-title":"SIAM J. Numer. Anal."},{"key":"2053_CR31","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1017\/S0962492915000021","volume":"24","author":"AJ Wathen","year":"2015","unstructured":"Wathen, A.J.: Preconditioning. Acta Numer. 24, 329\u2013376 (2015)","journal-title":"Acta Numer."},{"issue":"3","key":"2053_CR32","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(3), 391\u2013417 (1996)","journal-title":"Numer. Math."},{"key":"2053_CR33","unstructured":"Zwaan, I.N.: Cross product-free matrix pencils for computing generalized singular values (2019). arXiv:1912.08518 [math.NA]"},{"key":"2053_CR34","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-02053-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-02053-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-02053-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T17:55:10Z","timestamp":1701453310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-02053-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,23]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["2053"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-02053-w","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,23]]},"assertion":[{"value":"7 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 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 algorithmic Matlab code is available upon reasonable request from the corresponding author.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}