{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T10:25:16Z","timestamp":1772101516513,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T00:00:00Z","timestamp":1745366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T00:00:00Z","timestamp":1745366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Shenzhen Science and Technology Program","award":["JCYJ 20230807142002006"],"award-info":[{"award-number":["JCYJ 20230807142002006"]}]},{"name":"Shenzhen Science and Technology Program","award":["JCYJ 20230807142002006"],"award-info":[{"award-number":["JCYJ 20230807142002006"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11401305, 11571171"],"award-info":[{"award-number":["11401305, 11571171"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11401305, 11571171"],"award-info":[{"award-number":["11401305, 11571171"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s11075-025-02069-x","type":"journal-article","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T05:31:34Z","timestamp":1745386294000},"page":"1949-1963","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The global block Kaczmarz method using double greedy strategy"],"prefix":"10.1007","volume":"101","author":[{"given":"Ran-Ran","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,23]]},"reference":[{"issue":"7","key":"2069_CR1","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/8.299597","volume":"42","author":"P Soudais","year":"2004","unstructured":"Soudais, P.: Iterative solution methods of a 3-D scattering problem from arbitrary shaped multidielectric and multiconducting bodies. IEEE Trans. Antennas Propag. 42(7), 954\u2013959 (2004)","journal-title":"IEEE Trans. Antennas Propag."},{"key":"2069_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0377-0427(00)00396-4","volume":"123","author":"RW Freund","year":"2000","unstructured":"Freund, R.W.: Krylov-subspace methods for reduced-order modeling in circuit simulation. J. Comput. Appl. Math. 123, 395\u2013421 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"2069_CR3","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1137\/15M1035653","volume":"38","author":"X-W Zhang","year":"2016","unstructured":"Zhang, X.-W., Cheng, L., Chu, D.-L., Liao, L.-Z., Michael, K.N., Roger, C.E.T.: Incremental regularized least squares for dimensionality reduction of large-scale data. SIAM J. Sci. Comput. 38(3), 414\u2013439 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2069_CR4","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/0712047","volume":"12","author":"CC Paige","year":"1975","unstructured":"Paige, C.C., Saunders, M.A.: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12(4), 617\u2013629 (1975)","journal-title":"SIAM J. Numer. Anal."},{"issue":"178","key":"2069_CR5","first-page":"651","volume":"48","author":"Y Saad","year":"1987","unstructured":"Saad, Y.: On the Lanczos method for solving symmetric linear systems with several right-hand sides. Math. Comput. 48(178), 651\u2013662 (1987)","journal-title":"Math. Comput."},{"key":"2069_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cam.2014.12.040","volume":"282","author":"H-X Zhong","year":"2015","unstructured":"Zhong, H.-X., Wu, G., Chen, G.-L.: GPBi-CG: Generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems. J. Comput. Appl. Math. 282, 139\u2013156 (2015)","journal-title":"J. Comput. Appl. Math."},{"key":"2069_CR7","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1007\/s11075-021-01097-7","volume":"88","author":"A Taherian","year":"2021","unstructured":"Taherian, A., Toutounian, F.: Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis. N umer. Algorithms. 88, 1831\u20131850 (2021)","journal-title":"N umer. Algorithms."},{"key":"2069_CR8","first-page":"355","volume":"35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angen$$\\ddot{a}$$herte aufl$$\\ddot{o}$$sung von systemen linearer gleichungen. Bull. Int. Acad. Polo. Sci. Lett. A. 35, 355\u2013357 (1937)","journal-title":"Bull. Int. Acad. Polo. Sci. Lett. A."},{"key":"2069_CR9","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2009","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"key":"2069_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.laa.2018.05.009","volume":"553","author":"Z-Z Bai","year":"2018","unstructured":"Bai, Z.-Z., Wu, W.-T.: On convergence rate of the randomized Kaczmarz method. Linear Algebra Appl. 553, 252\u2013269 (2018)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2069_CR11","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/17M1137747","volume":"40","author":"Z-Z Bai","year":"2018","unstructured":"Bai, Z.-Z., Wu, W.-T.: On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM J. Sci. Comput. 40(1), 592\u2013606 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"2069_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.aml.2018.03.008","volume":"83","author":"Z-Z Bai","year":"2018","unstructured":"Bai, Z.-Z., Wu, W.-T.: On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems. Appl. Math. Lett. 83, 21\u201326 (2018)","journal-title":"Appl. Math. Lett."},{"key":"2069_CR13","first-page":"207","volume":"91","author":"J-J Zhang","year":"2019","unstructured":"Zhang, J.-J.: A new greedy Kaczmarz algorithm for the solution of very large linear systems. SIAM J. Sci. Comput. 91, 207\u2013212 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"2069_CR14","doi-asserted-by":"publisher","first-page":"2815","DOI":"10.1090\/mcom\/3644","volume":"90","author":"S Steinerberger","year":"2021","unstructured":"Steinerberger, S.: A weighted randomized Kaczmarz method for solving linear systems. Math. Comp. 90, 2815\u20132826 (2021)","journal-title":"Math. Comp."},{"key":"2069_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.apnum.2020.10.016","volume":"164","author":"X Yang","year":"2021","unstructured":"Yang, X.: A geometric probability randomized Kaczmarz method for large scale linear systems. Appl. Numer. Math. 164, 139\u2013160 (2021)","journal-title":"Appl. Numer. Math."},{"key":"2069_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.apnum.2023.01.013","volume":"186","author":"Z-Z Bai","year":"2023","unstructured":"Bai, Z.-Z., Wang, L.: On convergence rates of Kaczmarz-type methods with different selection rules of working rows. Appl. Numer. Math. 186, 289\u2013319 (2023)","journal-title":"Appl. Numer. Math."},{"key":"2069_CR17","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1007\/s13160-023-00586-7","volume":"40","author":"Z-Z Bai","year":"2023","unstructured":"Bai, Z.-Z., Wu, W.-T.: Randomized Kaczmarz iteration methods: Algorithmic extensions and convergence theory. Jpn. J. Ind. Appl. Math. 40, 1421\u20131443 (2023)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"2069_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-024-01945-2","author":"IA Ferreira","year":"2024","unstructured":"Ferreira, I.A., Acebr\u00f3n, J.A., Monteiro, J.: Survey of a class of iterative row-action methods: The Kaczmarz method. Numer. Algorithms. (2024). https:\/\/doi.org\/10.1007\/s11075-024-01945-2","journal-title":"Numer. Algorithms."},{"issue":"4","key":"2069_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01396365","volume":"35","author":"T Elfving","year":"1980","unstructured":"Elfving, T.: Block-iterative methods for consistent and inconsistent linear equations. Numer. Math. 35(4), 1\u201312 (1980)","journal-title":"Numer. Math."},{"issue":"2","key":"2069_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00211-012-0512-6","volume":"124","author":"Z-Z Bai","year":"2013","unstructured":"Bai, Z.-Z., Liu, X.-G.: On the meany inequality with applications to convergence analysis of several row-action iteration methods. Numer. Math. 124(2), 215\u2013236 (2013)","journal-title":"Numer. Math."},{"key":"2069_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2012.12.022","volume":"441","author":"D Needell","year":"2014","unstructured":"Needell, D., Tropp, J.A.: Paved with good intentions: Analysis of a randomized block Kaczmarz method. Linear Algebra Appl. 441, 199\u2013221 (2014)","journal-title":"Linear Algebra Appl."},{"key":"2069_CR22","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/s11075-021-01143-4","volume":"89","author":"J-Q Chen","year":"2022","unstructured":"Chen, J.-Q., Huang, Z.-D.: On a fast deterministic block Kaczmarz method for solving large-scale linear systems. Numer. Algorithms. 89, 1007\u20131029 (2022)","journal-title":"Numer. Algorithms."},{"key":"2069_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114372","volume":"413","author":"C-Q Miao","year":"2022","unstructured":"Miao, C.-Q., Wu, W.-T.: On greedy randomized average block Kaczmarz method for solving large linear systems. J. Comput. Appl. Math. 413, 114372 (2022)","journal-title":"J. Comput. Appl. Math."},{"key":"2069_CR24","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.laa.2021.01.024","volume":"616","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Gu, C.-Q.: On greedy randomized block Kaczmarz method for consistent linear systems. Linear Algebra Appl. 616, 178\u2013200 (2021)","journal-title":"Linear Algebra Appl."},{"key":"2069_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-022-01978-0","volume":"41","author":"R-R Li","year":"2022","unstructured":"Li, R.-R., Liu, H.: On randomized partial block Kaczmarz method for solving huge linear algebraic systems. Comput. Appl. Math. 41, 1\u201310 (2022)","journal-title":"Comput. Appl. Math."},{"issue":"4","key":"2069_CR26","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.3934\/era.2022075","volume":"30","author":"R-R Li","year":"2022","unstructured":"Li, R.-R., Liu, H.: On global randomized block Kaczmarz method for image reconstruction. Electron. Res. Arch. 30(4), 1442\u20131453 (2022)","journal-title":"Electron. Res. Arch."},{"key":"2069_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s42967-024-00427-5","author":"Y-X Tan","year":"2024","unstructured":"Tan, Y.-X., Huang, Z.-D.: On a nonlinear fast deterministic block Kaczmarz method for solving nonlinear equations. Commun. Appl. Math. Comput. (2024). https:\/\/doi.org\/10.1007\/s42967-024-00427-5","journal-title":"Commun. Appl. Math. Comput."},{"issue":"1","key":"2069_CR28","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of the Florida Sparse Matrix Collection. ACM Trans. Math. Software 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Software"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02069-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02069-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02069-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T09:33:42Z","timestamp":1772098422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02069-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,23]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2069"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02069-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,23]]},"assertion":[{"value":"7 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}