{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:48:34Z","timestamp":1783036114369,"version":"3.54.6"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171273"],"award-info":[{"award-number":["12171273"]}],"id":[{"id":"10.13039\/501100001809","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":[[2023,10]]},"DOI":"10.1007\/s10915-023-02342-y","type":"journal-article","created":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T16:02:13Z","timestamp":1694534533000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A FEAST SVDsolver Based on Chebyshev\u2013Jackson Series for Computing Partial Singular Triplets of Large Matrices"],"prefix":"10.1007","volume":"97","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9761-8517","authenticated-orcid":false,"given":"Zhongxiao","family":"Jia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kailiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,12]]},"reference":[{"key":"2342_CR1","doi-asserted-by":"publisher","unstructured":"Avron, H., Toledo, S.: Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. J. ACM 58(2), Art. 8,17 (2011). https:\/\/doi.org\/10.1145\/1944345.1944349","DOI":"10.1145\/1944345.1944349"},{"issue":"3","key":"2342_CR2","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s10208-021-09525-9","volume":"22","author":"A Cortinovis","year":"2022","unstructured":"Cortinovis, A., Kressner, D.: On randomized trace estimates for indefinite matrices with an application to determinants. Found. Comput. Math. 22(3), 875\u2013903 (2022). https:\/\/doi.org\/10.1007\/s10208-021-09525-9","journal-title":"Found. Comput. Math."},{"key":"2342_CR3","doi-asserted-by":"publisher","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), Art. 1, 25 (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"issue":"4","key":"2342_CR4","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1002\/nla.2048","volume":"23","author":"E Di Napoli","year":"2016","unstructured":"Di Napoli, E., Polizzi, E., Saad, Y.: Efficient estimation of eigenvalue counts in an interval. Numer. Linear Algebra Appl. 23(4), 674\u2013692 (2016). https:\/\/doi.org\/10.1002\/nla.2048","journal-title":"Numer. Linear Algebra Appl."},{"key":"2342_CR5","unstructured":"Futamura, Y., Sakurai, T.: z-Pares: Parallel Eigenvalue Solver (2014). https:\/\/zpares.cs.tsukuba.ac.jp\/"},{"key":"2342_CR6","doi-asserted-by":"publisher","unstructured":"Futamura, Y., Tadano, H., Sakurai, T.: Parallel stochastic estimation method of eigenvalue distribution. JSIAM Lett. 2, 127\u2013130 (2010). https:\/\/doi.org\/10.14495\/jsiaml.2.127","DOI":"10.14495\/jsiaml.2.127"},{"key":"2342_CR7","doi-asserted-by":"publisher","unstructured":"Gavin, B., Polizzi, E.: Krylov eigenvalue strategy using the FEAST algorithm with inexact system solves. Numer. Linear Algebra Appl. 25(5), e2188 (2018). https:\/\/doi.org\/10.1002\/nla.2188","DOI":"10.1002\/nla.2188"},{"key":"2342_CR8","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2013)"},{"issue":"4","key":"2342_CR9","doi-asserted-by":"publisher","first-page":"A2100","DOI":"10.1137\/140980090","volume":"37","author":"S G\u00fcttel","year":"2015","unstructured":"G\u00fcttel, S., Polizzi, E., Tang, P.T.P., Viaud, G.: Zolotarev quadrature rules and load balancing for the FEAST eigensolver. SIAM J. Sci. Comput. 37(4), A2100\u2013A2122 (2015). https:\/\/doi.org\/10.1137\/140980090","journal-title":"SIAM J. Sci. Comput."},{"key":"2342_CR10","doi-asserted-by":"publisher","unstructured":"Ikegami, T., Sakurai, T.: Contour integral eigensolver for non-Hermitian systems: a Rayleigh\u2013Ritz-type approach. Taiwan. J. Math. 14(3A), 825\u2013837 (2010). https:\/\/doi.org\/10.11650\/twjm\/1500405869","DOI":"10.11650\/twjm\/1500405869"},{"issue":"8","key":"2342_CR11","doi-asserted-by":"publisher","first-page":"1927","DOI":"10.1016\/j.cam.2009.09.029","volume":"233","author":"T Ikegami","year":"2010","unstructured":"Ikegami, T., Sakurai, T., Nagashima, U.: A filter diagonalization for generalized eigenvalue problems based on the Sakurai\u2013Sugiura projection method. J. Comput. Appl. Math. 233(8), 1927\u20131936 (2010). https:\/\/doi.org\/10.1016\/j.cam.2009.09.029","journal-title":"J. Comput. Appl. Math."},{"key":"2342_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.aml.2014.02.007","volume":"32","author":"A Imakura","year":"2014","unstructured":"Imakura, A., Du, L., Sakurai, T.: A block Arnoldi-type contour integral spectral projection method for solving generalized eigenvalue problems. Appl. Math. Lett. 32, 22\u201327 (2014). https:\/\/doi.org\/10.1016\/j.aml.2014.02.007","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"2342_CR13","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s13160-016-0224-x","volume":"33","author":"A Imakura","year":"2016","unstructured":"Imakura, A., Du, L., Sakurai, T.: Relationships among contour integral-based methods for solving generalized eigenvalue problems. Jpn. J. Ind. Appl. Math. 33(3), 721\u2013750 (2016). https:\/\/doi.org\/10.1007\/s13160-016-0224-x","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"1","key":"2342_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0010-4655(98)00192-1","volume":"118","author":"LO Jay","year":"1999","unstructured":"Jay, L.O., Kim, H., Saad, Y., Chelikowsky, J.R.: Electronic structure calculations for plane-wave codes without diagonalization. Comput. Phys. Commun. 118(1), 21\u201330 (1999). https:\/\/doi.org\/10.1016\/S0010-4655(98)00192-1","journal-title":"Comput. Phys. Commun."},{"issue":"1\u20133","key":"2342_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(1\u20133), 191\u2013214 (1999). https:\/\/doi.org\/10.1016\/S0024-3795(98)10197-0","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2342_CR16","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(1), 246\u2013265 (2003). https:\/\/doi.org\/10.1137\/S0895479802404192","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2342_CR17","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(2), 714\u2013744 (2010). https:\/\/doi.org\/10.1137\/080733383","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"2342_CR18","doi-asserted-by":"publisher","first-page":"S772","DOI":"10.1137\/15M1026572","volume":"38","author":"J Kestyn","year":"2016","unstructured":"Kestyn, J., Polizzi, E., Tang, P.T.P.: FEAST eigensolver for non-Hermitian problems. SIAM J. Sci. Comput. 38(5), S772\u2013S799 (2016). https:\/\/doi.org\/10.1137\/15M1026572","journal-title":"SIAM J. Sci. Comput."},{"key":"2342_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719628","volume-title":"ARPACK Users\u2019 Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods","author":"RB Lehoucq","year":"1998","unstructured":"Lehoucq, R.B., Sorensen, D., Yang, C.: ARPACK Users\u2019 Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods. SIAM, Philadephia (1998)"},{"key":"2342_CR20","volume-title":"Chebyshev Polynomials","author":"JC Mason","year":"2003","unstructured":"Mason, J.C., Handscomb, D.C.: Chebyshev Polynomials. Chapman & Hall\/CRC, Boca Raton (2003)"},{"key":"2342_CR21","doi-asserted-by":"publisher","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem, Classics in Applied Mathematics, vol.\u00a020. SIAM, Philadelphia (1998). https:\/\/doi.org\/10.1137\/1.9781611971163","DOI":"10.1137\/1.9781611971163"},{"key":"2342_CR22","doi-asserted-by":"publisher","unstructured":"Polizzi, E.: Density-matrix-based algorithm for solving eigenvalue problems. Phys. Rev. B 79(11), e115112 (2009). https:\/\/doi.org\/10.1103\/PhysRevB.79.115112","DOI":"10.1103\/PhysRevB.79.115112"},{"key":"2342_CR23","doi-asserted-by":"publisher","unstructured":"Polizzi, E.: FEAST eigenvalue solver v4.0 user guide (2020). https:\/\/doi.org\/10.48550\/arXiv.2002.04807","DOI":"10.48550\/arXiv.2002.04807"},{"key":"2342_CR24","unstructured":"Rivlin, T.J.: An Introduction to the Approximation of Functions. Dover Books on Advanced Mathematics. Dover, New York (1981)"},{"issue":"1","key":"2342_CR25","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1137\/060673795","volume":"31","author":"M Robb\u00e9","year":"2009","unstructured":"Robb\u00e9, M., Sadkane, M., Spence, A.: Inexact inverse subspace iteration with preconditioning applied to non-Hermitian eigenvalue problems. SIAM J. Matrix Anal. Appl. 31(1), 92\u2013113 (2009). https:\/\/doi.org\/10.1137\/060673795","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"2342_CR26","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1007\/s10208-014-9220-1","volume":"15","author":"F Roosta-Khorasani","year":"2015","unstructured":"Roosta-Khorasani, F., Ascher, U.: Improved bounds on sample size for implicit matrix trace estimators. Found. Comput. Math. 15(5), 1187\u20131212 (2015). https:\/\/doi.org\/10.1007\/s10208-014-9220-1","journal-title":"Found. Comput. Math."},{"key":"2342_CR27","doi-asserted-by":"publisher","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","DOI":"10.1137\/1.9780898718003"},{"key":"2342_CR28","doi-asserted-by":"publisher","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems, Classics in Applied Mathematics, vol.\u00a066. SIAM, Philadelphia (2011). https:\/\/doi.org\/10.1137\/1.9781611970739","DOI":"10.1137\/1.9781611970739"},{"issue":"1","key":"2342_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0377-0427(03)00565-X","volume":"159","author":"T Sakurai","year":"2003","unstructured":"Sakurai, T., Sugiura, H.: A projection method for generalized eigenvalue problems using numerical integration. J. Comput. Appl. Math. 159(1), 119\u2013128 (2003). https:\/\/doi.org\/10.1016\/S0377-0427(03)00565-X","journal-title":"J. Comput. Appl. Math."},{"key":"2342_CR30","doi-asserted-by":"publisher","unstructured":"Sakurai, T., Tadano, H.: CIRR: a Rayleigh\u2013Ritz type method with contour integral for generalized eigenvalue problems. Hokkaido Math. J. 36(4), 745\u2013757 (2007). https:\/\/doi.org\/10.14492\/hokmj\/1272848031","DOI":"10.14492\/hokmj\/1272848031"},{"issue":"1","key":"2342_CR31","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"DC Sorensen","year":"1992","unstructured":"Sorensen, D.C.: Implicit application of polynomial filters in a $$k$$-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13(1), 357\u2013385 (1992). https:\/\/doi.org\/10.1137\/0613025","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2342_CR32","doi-asserted-by":"publisher","unstructured":"Stewart, G.W.: Matrix Algorithms, Vol. II: Eigensystems. SIAM, Philadelphia (2001). https:\/\/doi.org\/10.1137\/1.9780898718058","DOI":"10.1137\/1.9780898718058"},{"issue":"2","key":"2342_CR33","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1137\/13090866X","volume":"35","author":"PTP Tang","year":"2014","unstructured":"Tang, P.T.P., Polizzi, E.: FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection. SIAM J. Matrix Anal. Appl. 35(2), 354\u2013390 (2014). https:\/\/doi.org\/10.1137\/13090866X","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2342_CR34","doi-asserted-by":"publisher","unstructured":"Yeung, M.C., Lee, L.: A FEAST variant incorporated with a power iteration (2019). https:\/\/doi.org\/10.48550\/arXiv1912.01642","DOI":"10.48550\/arXiv1912.01642"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02342-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02342-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02342-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T11:12:13Z","timestamp":1695467533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02342-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,12]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["2342"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02342-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,12]]},"assertion":[{"value":"28 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2023","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":"21"}}