{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T17:28:03Z","timestamp":1776101283358,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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":["12361082"],"award-info":[{"award-number":["12361082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s40314-024-03016-7","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T04:21:01Z","timestamp":1733199661000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Block-splitting preconditioners for indefinite least squares problem"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-6065-6450","authenticated-orcid":false,"given":"Kailiang","family":"Xin","sequence":"first","affiliation":[]},{"given":"Lingsheng","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"3016_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical methods for least squares problems","author":"A Bjorck","year":"1996","unstructured":"Bjorck A (1996) Numerical methods for least squares problems. SIAM, Philadelphia"},{"key":"3016_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.laa.2020.09.006","volume":"623","author":"AW Bojanczyk","year":"2021","unstructured":"Bojanczyk AW (2021) Algorithms for indefinite linear least squares problems. Linear Algebra Appl 623:104\u2013127","journal-title":"Linear Algebra Appl"},{"key":"3016_CR3","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1137\/S0895479802401497","volume":"24","author":"A Bojanczyk","year":"2003","unstructured":"Bojanczyk A, Higham NJ, Patel H (2003) Solving the indefinite least squares problem by hyperbolic QR factorization. SIAM J Matrix Anal Appl 24:914\u2013931","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3016_CR4","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1137\/S0895479896302229","volume":"20","author":"S Chandrasekaran","year":"1998","unstructured":"Chandrasekaran S, Gu M, Sayed AH (1998) A stable and efficient algorithm for the indefinite linear least-squares problem. SIAM J Matrix Anal Appl 20:354\u2013362","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3016_CR5","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1080\/00207160.2018.1467007","volume":"96","author":"HA Diao","year":"2019","unstructured":"Diao HA, Zhou TY (2019) Backward error and condition number analysis for the indefinite linear least squares problem. Int J Comput Math 96:1603\u20131622","journal-title":"Int J Comput Math"},{"key":"3016_CR6","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1137\/0717073","volume":"17","author":"GH Golub","year":"1980","unstructured":"Golub GH, Van Loan CF (1980) An analysis of the total least squares problem. SIAM J Numer Anal 17:883\u2013893","journal-title":"SIAM J Numer Anal"},{"key":"3016_CR7","doi-asserted-by":"crossref","unstructured":"Hassibi B, Sayed AH, Kailath T (1993) Recursive linear estimation in Krein spaces. I. Theory. In: Proceedings of 32nd IEEE conference on decision and control, pp 3489\u20133494. IEEE, New York","DOI":"10.1109\/CDC.1993.325867"},{"key":"3016_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"RA Horn","year":"1985","unstructured":"Horn RA, Johnson CR (1985) Matrix analysis. Cambridge University Press, Cambridge"},{"key":"3016_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s11075-018-0555-6","volume":"81","author":"N Huang","year":"2019","unstructured":"Huang N, Ma C-F (2019) Spectral analysis of the preconditioned system for the $$3\\times 3$$ block saddle point problem. Numer Algorithms 81:421\u2013444","journal-title":"Numer Algorithms"},{"key":"3016_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.apnum.2017.09.006","volume":"123","author":"HY Li","year":"2018","unstructured":"Li HY, Wang SX (2018) On the partial condition numbers for the indenite least squares problem. Appl Numer Math 123:200\u2013220","journal-title":"Appl Numer Math"},{"key":"3016_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10092-011-0039-8","volume":"48","author":"QH Liu","year":"2011","unstructured":"Liu QH, Li XJ (2011) Preconditioned conjugate gradient methods for the solution of indefinite least squares problems. Calcolo 48:261\u2013271","journal-title":"Calcolo"},{"key":"3016_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10092-013-0090-8","volume":"51","author":"QH Liu","year":"2014","unstructured":"Liu QH, Liu AJ (2014) Block SOR methods for the solution of indefinite least squares problems. Calcolo 51:367\u2013379","journal-title":"Calcolo"},{"key":"3016_CR13","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.cam.2013.02.016","volume":"250","author":"QH Liu","year":"2013","unstructured":"Liu QH, Zhang FD (2013) Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems. J Comput Appl Math 250:210\u2013216","journal-title":"J Comput Appl Math"},{"key":"3016_CR14","doi-asserted-by":"publisher","unstructured":"Meng LS, Xin KL, Li J (2024) Variable parameter Uzawa method for solving the indefinite least squares problem. Numer Algorithms. https:\/\/doi.org\/10.1007\/s11075-024-01905-w","DOI":"10.1007\/s11075-024-01905-w"},{"key":"3016_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/97.484217","volume":"3","author":"AH Sayed","year":"1996","unstructured":"Sayed AH, Hassibi B, Kailath T (1996) Inertia properties of indefinite quadratic forms. IEEE Signal Process Lett 3:57\u201359","journal-title":"IEEE Signal Process Lett"},{"key":"3016_CR16","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1080\/00207160.2019.1658869","volume":"97","author":"J Song","year":"2020","unstructured":"Song J (2020) USSOR method for solving the indefinite least squares problem. Int J Comput Math 97:1781\u20131791","journal-title":"Int J Comput Math"},{"key":"3016_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971002","volume-title":"The total least squares problem: computational aspects and analysis","author":"S Van Huffel","year":"1991","unstructured":"Van Huffel S, Vandewalle J (1991) The total least squares problem: computational aspects and analysis. SIAM, Philadelphia"},{"key":"3016_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11741-004-0049-8","volume":"8","author":"HG Xu","year":"2004","unstructured":"Xu HG (2004) A backward stable hyperbolic QR factorization method for solving indefinite least squares problem. J Shanghai Univ 8:391\u2013396","journal-title":"J Shanghai Univ"},{"key":"3016_CR19","first-page":"127892","volume":"446","author":"YJ Zhang","year":"2023","unstructured":"Zhang YJ, Li HY (2023) Splitting-based randomized iterative methods for solving indefinite least squares problem. Appl Math Comput 446:127892","journal-title":"Appl Math Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03016-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03016-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03016-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T07:57:44Z","timestamp":1741420664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03016-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["3016"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03016-7","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"5 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"61"}}