{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T06:03:16Z","timestamp":1780293796911,"version":"3.54.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002862","name":"China University of Petroleum, Beijing","doi-asserted-by":"publisher","award":["2462024BJRC012"],"award-info":[{"award-number":["2462024BJRC012"]}],"id":[{"id":"10.13039\/501100002862","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372467"],"award-info":[{"award-number":["62372467"]}],"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":[[2026,6]]},"DOI":"10.1007\/s40314-025-03582-4","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T07:03:24Z","timestamp":1767596604000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Schur complement based multicoloring low-rank correction preconditioner for linear systems"],"prefix":"10.1007","volume":"45","author":[{"given":"QingQing","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"3582_CR1","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/S1064827595294691","volume":"19","author":"M Benzi","year":"1998","unstructured":"Benzi M, Tuma M (1998) A sparse approximate inverse preconditioner for nonsymmetric linear systems. SIAM J Sci Comput 19:968\u2013994","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR2","unstructured":"Board OAR (2011) OpenMP application program interface. Version 3.1"},{"key":"3582_CR3","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1137\/S1064827594270415","volume":"19","author":"E Chow","year":"1998","unstructured":"Chow E, Saad Y (1998) Approximate inverse preconditioners via sparse-sparse iterations. SIAM J Sci Comput 19:995\u20131023","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR4","doi-asserted-by":"publisher","first-page":"A2234","DOI":"10.1137\/17M1143320","volume":"40","author":"G Dillon","year":"2018","unstructured":"Dillon G, Kalantzis V, Xi Y, Saad Y (2018) A hierarchical low-rank schur complement preconditioner for indefinite linear systems. SIAM J Sci Comput 40:A2234\u2013A2252","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR5","volume-title":"Matrix computations","author":"GH Golub","year":"2013","unstructured":"Golub GH, Loan CFV (2013) Matrix computations, 4th edn. Johns Hopkins University Press, Baltimore, MD","edition":"4"},{"key":"3582_CR6","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S1064827594276552","volume":"18","author":"M Grote","year":"1997","unstructured":"Grote M, Huckle T (1997) Parallel preconditioning with sparse approximate inverses. SIAM J Sci Comput 18:838\u2013853","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR7","doi-asserted-by":"publisher","first-page":"2266","DOI":"10.1137\/040608258","volume":"28","author":"P H\u00e9non","year":"2006","unstructured":"H\u00e9non P, Saad Y (2006) A parallel multistage ILU factorization based on a hierarchical graph decomposition. SIAM J Sci Comput 28:2266\u20132293","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR8","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1137\/S1064827599361308","volume":"22","author":"JC Haws","year":"2000","unstructured":"Haws JC, Benzi M, T\u00fcma M (2000) Preconditioning highly indefinite and nonsymmetric matrices. SIAM J Sci Comput 22:1333\u20131353","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes MR, Stiefel EL (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bur Stands 49:409\u2013436","journal-title":"J Res Nat Bur Stands"},{"key":"3582_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/nla.614","volume":"16","author":"Z Jia","year":"2009","unstructured":"Jia Z, Zhu B (2009) A power sparse approximate inverse preconditioning procedure for large linear systems. Numer Linear Algebra Appl 16:259\u2013299","journal-title":"Numer Linear Algebra Appl"},{"key":"3582_CR11","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s10543-013-0434-4","volume":"53","author":"Z Jia","year":"2013","unstructured":"Jia Z, Zhu B (2013) Robust dropping criteria for $$F$$-norm minimization based sparse approximate inverse preconditioning. BIT Numer Math 53:959\u2013985","journal-title":"BIT Numer Math"},{"key":"3582_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20:359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR13","doi-asserted-by":"publisher","first-page":"A2069","DOI":"10.1137\/120872735","volume":"35","author":"R Li","year":"2013","unstructured":"Li R, Saad Y (2013) Divide and conquer low-rank preconditioners for symmetric matrices. SIAM J Sci Comput 35:A2069\u2013A2095","journal-title":"SIAM J Sci Comput"},{"key":"3582_CR14","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1002\/nla.2051","volume":"23","author":"R Li","year":"2016","unstructured":"Li R, Xi Y, Saad Y (2016) Schur complement-based domain decomposition preconditioners with low-rank corrections. Numer Linear Algebra Appl 23:706\u2013729","journal-title":"Numer Linear Algebra Appl"},{"key":"3582_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1002\/nla.1680010405","volume":"1","author":"Y Saad","year":"1994","unstructured":"Saad Y (1994) ILUT: a dual threshold incomplete ILU factorization. Numer Linear Algebra Appl 1:387\u2013402","journal-title":"Numer Linear Algebra Appl"},{"key":"3582_CR16","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 (2003) Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelpha, PA","edition":"2"},{"key":"3582_CR17","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y Saad","year":"1986","unstructured":"Saad Y, Schultz MH (1986) GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J Sci Statist Comput 7:856\u2013869","journal-title":"SIAM J Sci Statist Comput"},{"key":"3582_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/15M1021830","volume":"37","author":"Y Xi","year":"2016","unstructured":"Xi Y, Li R, Saad Y (2016) An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices. SIAM J Matrix Anal Appl 37:235\u2013259","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3582_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2316","volume":"27","author":"Q Zheng","year":"2020","unstructured":"Zheng Q, Xi Y, Saad Y (2020) Multicoloring low-rank correction preconditioner for general sparse linear systems. Numer Linear Algebra Appl 27:e2316","journal-title":"Numer Linear Algebra Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03582-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03582-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03582-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:38:56Z","timestamp":1780292336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03582-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3582"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03582-4","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"23 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 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 author declares that she has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"189"}}