{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T09:55:49Z","timestamp":1781517349337,"version":"3.54.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T00:00:00Z","timestamp":1781481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T00:00:00Z","timestamp":1781481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Natural Science Foundation of China under grant","award":["No.12561069,12061009"],"award-info":[{"award-number":["No.12561069,12061009"]}]},{"name":"Doctoral Research of ECUT","award":["No. DHBK2023003"],"award-info":[{"award-number":["No. DHBK2023003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s40314-026-03829-8","type":"journal-article","created":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T09:47:14Z","timestamp":1781516834000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new greedy two-dimensional extended Gauss-Seidel method for least squares problems"],"prefix":"10.1007","volume":"45","author":[{"given":"Jianhua","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuling","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,15]]},"reference":[{"key":"3829_CR1","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 (2023) On convergence rates of Kaczmarz-type methods with different selection rules of working rows. Appl Numer Math 186:289\u2013319","journal-title":"Appl Numer Math"},{"key":"3829_CR2","doi-asserted-by":"publisher","first-page":"A592","DOI":"10.1137\/17M1137747","volume":"40","author":"Z-Z Bai","year":"2018","unstructured":"Bai Z-Z, Wu W-T (2018) On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM J Sci Comput 40:A592\u2013A606","journal-title":"SIAM J Sci Comput"},{"key":"3829_CR3","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 (2018) On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems. Appl Math Lett 83:21\u201326","journal-title":"Appl Math Lett"},{"key":"3829_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/nla.2237","volume":"26","author":"Z-Z Bai","year":"2019","unstructured":"Bai Z-Z, Wu W-T (2019) On greedy randomized coordinate descent methods for solving large linear least-squares problems. Numer Linear Algebra Appl 26:1\u201315","journal-title":"Numer Linear Algebra Appl"},{"key":"3829_CR5","doi-asserted-by":"publisher","first-page":"A3892","DOI":"10.1137\/20M1352235","volume":"43","author":"Z-Z Bai","year":"2021","unstructured":"Bai Z-Z, Wu W-T (2021) On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems. SIAM J Sci Comput 43:A3892\u2013A3911","journal-title":"SIAM J Sci Comput"},{"key":"3829_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2233","volume":"26","author":"K Du","year":"2019","unstructured":"Du K (2019) Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms. Numer Linear Algebra Appl 26:e2233","journal-title":"Numer Linear Algebra Appl"},{"key":"3829_CR7","volume":"408","author":"K Du","year":"2021","unstructured":"Du K, Sun X-H (2021) A doubly stochastic block Gauss-Seidel algorithm for solving linear equations. Appl Math Comput 408:126373","journal-title":"Appl Math Comput"},{"key":"3829_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant representations: From theory to applications in signal and image processing","author":"M Elad","year":"2010","unstructured":"Elad M (2010) Sparse and redundant representations: From theory to applications in signal and image processing. Springer Science and Business Media, Berlin"},{"key":"3829_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/rtim.1995.1002","volume":"1","author":"GT Herman","year":"1995","unstructured":"Herman GT (1995) Image reconstruction from projections. Real-Time Imag 1:3\u201318","journal-title":"Real-Time Imag"},{"key":"3829_CR10","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1259\/0007-1285-46-552-1016","volume":"46","author":"GN Hounsfield","year":"1973","unstructured":"Hounsfield GN (1973) Computerized transverse axial scanning (tomography): Part 1. description of system. Br J Radiol 46:1016\u20131022","journal-title":"Br J Radiol"},{"key":"3829_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10444-023-10018-2","volume":"49","author":"Y Jiang","year":"2023","unstructured":"Jiang Y, Wu G, Jiang L (2023) A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems. Adv Comput Math 49:20","journal-title":"Adv Comput Math"},{"key":"3829_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2023.102029","volume":"70","author":"L-L Jin","year":"2023","unstructured":"Jin L-L, Li H-B (2023) Greedy double subspaces coordinate descent method for solving linear least-squares problems. J Comput Sci 70:102029","journal-title":"J Comput Sci"},{"key":"3829_CR13","first-page":"355","volume":"35","author":"S Karczmarz","year":"1937","unstructured":"Karczmarz S (1937) Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bull Int Acad Pol Sic Let 35:355\u2013357","journal-title":"Bull Int Acad Pol Sic Let"},{"key":"3829_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal D, Lewis AS (2010) Randomized methods for linear constraints: convergence rates and conditioning. Math Oper Res 35:641\u2013654","journal-title":"Math Oper Res"},{"key":"3829_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10092-021-00404-x","volume":"58","author":"Y Liu","year":"2021","unstructured":"Liu Y, Jiang X-L, Gu C-Q (2021) On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems. Calcolo 58:1\u201332","journal-title":"Calcolo"},{"key":"3829_CR16","doi-asserted-by":"crossref","unstructured":"Liu R, Yang A-L, Ma J (2025) Maximal residual coordinate descent method with k-means clustering for solving large linear least-squares problems, Numer. Algorithms. https:\/\/doi.org\/10.1007\/s11075-025-02036-6","DOI":"10.1007\/s11075-025-02036-6"},{"key":"3829_CR17","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1137\/15M1014425","volume":"36","author":"A Ma","year":"2015","unstructured":"Ma A, Needell D, Ramdas A (2015) Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods. SIAM J Matrix Anal Appl 36:1590\u20131604","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3829_CR18","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 (2022) On greedy randomized average block Kaczmarz method for solving large linear systems. J Comput Appl Math 413:114372","journal-title":"J Comput Appl Math"},{"key":"3829_CR19","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s11075-023-01661-3","volume":"96","author":"A Mustafa","year":"2024","unstructured":"Mustafa A, Saha M (2024) A two-dimensional randomized extended Gauss-Seidel algorithm for solving least squares problems. Numer Algorithms 96:665\u2013686","journal-title":"Numer Algorithms"},{"key":"3829_CR20","doi-asserted-by":"crossref","unstructured":"Mustafa A, Saha M (2025) A maximal residual two subspace projection algorithm for solving least-squares problems. Commun Appl Math Comput 1\u201317","DOI":"10.1007\/s42967-025-00495-1"},{"key":"3829_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2021.107057","volume":"116","author":"Y-Q Niu","year":"2021","unstructured":"Niu Y-Q, Zheng B (2021) A new randomized Gauss-Seidel method for solving linear least-squares problems. Appl Math Lett 116:107057","journal-title":"Appl Math Lett"},{"key":"3829_CR22","doi-asserted-by":"publisher","first-page":"17453","DOI":"10.3934\/math.2024848","volume":"9","author":"F Sha","year":"2024","unstructured":"Sha F, Zhang J (2024) Randomized symmetric Gauss-Seidel method for solving linear least squares problems. AIMS Math 9:17453\u201317463","journal-title":"AIMS Math"},{"key":"3829_CR23","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 (2009) A randomized Kaczmarz algorithm with exponential convergence. J Fourier Anal Appl 15:262\u2013278","journal-title":"J Fourier Anal Appl"},{"key":"3829_CR24","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s10092-025-00639-y","volume":"62","author":"L Wang","year":"2025","unstructured":"Wang L, Wu W-T (2025) The equivalence of the randomized extended Gauss-Seidel and randomized extended Kaczmarz methods. Calcolo 62:16","journal-title":"Calcolo"},{"key":"3829_CR25","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1007\/s11075-023-01540-x","volume":"94","author":"Y Zeng","year":"2023","unstructured":"Zeng Y, Han D, Su Y et al (2023) Randomized Kaczmarzmethod with adaptive stepsizes for inconsistent linear systems. Numer Algorithms 94:1403\u20131420","journal-title":"Numer Algorithms"},{"key":"3829_CR26","doi-asserted-by":"publisher","unstructured":"Zeng Y, Han D, Su Y, et al (2025) On adaptive stochastic extended iterative methods for solving least squares, Math. Comp, https:\/\/doi.org\/10.1090\/mcom\/4168","DOI":"10.1090\/mcom\/4168"},{"key":"3829_CR27","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.apnum.2020.06.014","volume":"157","author":"J Zhang","year":"2020","unstructured":"Zhang J, Guo J (2020) On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems. Appl Numer Math 157:372\u2013384","journal-title":"Appl Numer Math"},{"key":"3829_CR28","doi-asserted-by":"publisher","unstructured":"Zhang K, Deng J-Y, Jiang X-L (2025) A block coordinate descent linear least squares solver by quantile statistics, Japan J. Indust. Appl. Math. https:\/\/doi.org\/10.1007\/s13160-025-00694-6","DOI":"10.1007\/s13160-025-00694-6"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03829-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03829-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03829-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T09:47:20Z","timestamp":1781516840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03829-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,15]]},"references-count":28,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["3829"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03829-8","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,15]]},"assertion":[{"value":"23 February 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2026","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 authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"438"}}