{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:36:19Z","timestamp":1752230179431,"version":"3.41.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1023\/a:1019192926247","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"157-164","source":"Crossref","is-referenced-by-count":5,"title":["Preconditioning projection methods for solving algebraic linear systems"],"prefix":"10.1007","volume":"21","author":[{"given":"Ubaldo M.","family":"Garc\u00eda-Palomares","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"329320_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01391414","volume":"45","author":"J. Abaffy","year":"1984","unstructured":"J. Abaffy, C.G. Broyden and E. Spedicato, A class of direct methods for linear systems, Numer. Math. 45 (1984) 361\u2013376.","journal-title":"Numer. Math."},{"key":"329320_CR2","volume-title":"ABS Projection Algorithms: Mathematical Techniques for Linear and Nonlinear Equations","author":"J. Abaffy","year":"1989","unstructured":"J. Abaffy and E. Spedicato, ABS Projection Algorithms: Mathematical Techniques for Linear and Nonlinear Equations (Ellis Horwood, Chichester, UK, 1989)."},{"key":"329320_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"H.H. Bauschke","year":"1996","unstructured":"H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996) 367\u2013426.","journal-title":"SIAM Rev."},{"key":"329320_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/0913010","volume":"13","author":"R. Bramley","year":"1992","unstructured":"R. Bramley and A. Sameh, Row projection methods for large nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 13 (1992) 168\u2013193.","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"4","key":"329320_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/83.563316","volume":"6","author":"P.L. Combettes","year":"1997","unstructured":"P.L. Combettes, Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections, IEEE Trans. Image Process. 6(4) (1997) 1\u201315.","journal-title":"IEEE Trans. Image Process."},{"key":"329320_CR6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1002\/sapm195534164","volume":"34","author":"E.J. Craig","year":"1955","unstructured":"E.J. Craig, The N-step iteration procedures, J. Math. Phys. 34 (1955) 64\u201373.","journal-title":"J. Math. Phys."},{"key":"329320_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF02017349","volume":"30","author":"S.D. Fl\u00e5m","year":"1990","unstructured":"S.D. Fl\u00e5m and J. Zowe, Relaxed outer projections, weighted averages and convex feasibility, BIT 30 (1990) 289\u2013300.","journal-title":"BIT"},{"issue":"4","key":"329320_CR8","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/0803046","volume":"3","author":"U.M. Garc\u00eda-Palomares","year":"1993","unstructured":"U.M. Garc\u00eda-Palomares, Parallel projected aggregation methods for solving the convex inequality problem, SIAM J. Optim. 3(4) (1993) 882\u2013900.","journal-title":"SIAM J. Optim."},{"key":"329320_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0167-6377(98)00003-0","volume":"22","author":"U.M. Garc\u00eda-Palomares","year":"1998","unstructured":"U.M. Garc\u00eda-Palomares, A superlinearly convergent projection algorithm for solving the convex inequality problem, Oper. Res. Lett. 22 (1998) 97\u2013103.","journal-title":"Oper. Res. Lett."},{"key":"329320_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/A:1019165330848","volume":"18","author":"U.M. Garc\u00eda-Palomares","year":"1998","unstructured":"U.M. Garc\u00eda-Palomares and F.J. Gonz\u00e1lez Casta\u00f1o, Incomplete projection algorithms for solving the convex feasibility problem, Numer. Algorithms 18 (1998) 177\u2013193.","journal-title":"Numer. Algorithms"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019192926247.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019192926247\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019192926247.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:20:46Z","timestamp":1751872846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019192926247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":10,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["329320"],"URL":"https:\/\/doi.org\/10.1023\/a:1019192926247","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}