{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:24:33Z","timestamp":1787336673679,"version":"build-2736575974"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100006469","name":"FDCT","doi-asserted-by":"crossref","award":["0090\/2022\/A2"],"award-info":[{"award-number":["0090\/2022\/A2"]}],"id":[{"id":"10.13039\/501100006469","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006469","name":"FDCT","doi-asserted-by":"crossref","award":["0141\/2020\/A3"],"award-info":[{"award-number":["0141\/2020\/A3"]}],"id":[{"id":"10.13039\/501100006469","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006469","name":"FDCT","doi-asserted-by":"crossref","award":["0079\/2021\/AFJ"],"award-info":[{"award-number":["0079\/2021\/AFJ"]}],"id":[{"id":"10.13039\/501100006469","id-type":"DOI","asserted-by":"crossref"}]},{"name":"MYRG","award":["2022-00051-FST"],"award-info":[{"award-number":["2022-00051-FST"]}]},{"name":"MYRG","award":["2020-00162-FST"],"award-info":[{"award-number":["2020-00162-FST"]}]},{"name":"SRG","award":["2021-00024-FST"],"award-info":[{"award-number":["2021-00024-FST"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2023,4,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Nonlinearly preconditioned inexact Newton methods have been applied successfully for some difficult nonlinear systems of algebraic equations arising from the discretization of partial differential equations. The preconditioning step involves identifying and balancing the nonlinearities in the system. One of the challenging tasks when applying the methods is to accurately and efficiently identify the unbalanced nonlinearities. In this work, we propose an unsupervised learning strategy based on the classical principal component analysis that learns the bad behavior of a Newton solver in the nonlinear residual subspace of a training problem. A new initial guess is produced by the nonlinear preconditioner where a projected low dimensional Jacobian system corresponding to the slow subspace of the current residuals is solved for the Newton correction vector. Numerical experiments for high Reynolds number incompressible flow problems show that the proposed method is more robust and efficient compared with existing nonlinear solvers.<\/jats:p>","DOI":"10.1137\/22m1507942","type":"journal-article","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T04:03:05Z","timestamp":1682568185000},"page":"A849-A871","source":"Crossref","is-referenced-by-count":13,"title":["\\(\\text{PIN}^{\\mathcal L}\\)  : Preconditioned Inexact Newton with Learning Capability for Nonlinear System of Equations"],"prefix":"10.1137","volume":"45","author":[{"given":"Li","family":"Luo","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Macau, Macao SAR, China."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0296-8640","authenticated-orcid":true,"given":"Xiao-Chuan","family":"Cai","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Macau, Macao SAR, China."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,4,27]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827598334514"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2006102"},{"key":"ref4","volume-title":"PETSc Users Manual","author":"Balay S.","year":"2022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/atmos13020180"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-fluid-010719-060214"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S106482750037620X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080736272"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/16M1057693"},{"key":"ref10","unstructured":"F. Chaouqui , \nM. J. Gander , \nP. M. Kumbhar , and \nT. Vanzan , Linear and nonlinear substructured restricted additive Schwarz iterations and preconditioning, Numer Algorithms, to appear."},{"key":"ref11","first-page":"808","volume":"78","author":"Chatterjee A.","year":"2000","journal-title":"Curr. Sci."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976908"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/15M102887X"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0917003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(82)90058-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/15M1028078"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2004.10.025"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.compfluid.2014.04.005"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00314-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2010.10.009"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/130920563"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/140997907"},{"key":"ref24","volume-title":"Adaptive Nonlinear Elimination in Nonlinear FETI-DP Methods","author":"Klawonn A.","year":"2021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2003.08.010"},{"key":"ref26","first-page":"492","volume":"40","author":"Kunisch K.","year":"2002","journal-title":"SIAM J. Sci. Comput."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596306045"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2370"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/140970379"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/15M1028182"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/17M1128502"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2018.2789354"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2019.108926"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/19M1307184"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/20M1344652"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1721"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/nme.5320"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/040602997"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2018.10.045"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1997.5798"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/15M1041882"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2016.11.036"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2018.01.008"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/22M1507942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:26:10Z","timestamp":1787333170000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M1507942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,27]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4,30]]}},"alternative-id":["10.1137\/22M1507942"],"URL":"https:\/\/doi.org\/10.1137\/22m1507942","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,27]]}}}