{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:16:29Z","timestamp":1757618189503,"version":"3.44.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T00:00:00Z","timestamp":1748822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T00:00:00Z","timestamp":1748822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s40314-025-03243-6","type":"journal-article","created":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T01:59:23Z","timestamp":1748829563000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable s-step technique for Planar algorithms in solving indefinite linear systems"],"prefix":"10.1007","volume":"44","author":[{"given":"Hojjatollah","family":"Shokri Kaveh","sequence":"first","affiliation":[]},{"given":"Masoud","family":"Hajarian","sequence":"additional","affiliation":[]},{"given":"Anthony T.","family":"Chronopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,2]]},"reference":[{"issue":"12","key":"3243_CR1","doi-asserted-by":"publisher","first-page":"2938","DOI":"10.1016\/j.cam.2012.01.028","volume":"236","author":"JA Alvarez-Dios","year":"2012","unstructured":"Alvarez-Dios JA, Cabaleiro JC, Casal G (2012) A generalization of s-step variants of gradient methods. J Comput Appl Math 236(12):2938\u20132953","journal-title":"J Comput Appl Math"},{"issue":"12","key":"3243_CR2","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/12.9733","volume":"37","author":"C Aykanat","year":"1988","unstructured":"Aykanat C, Ozguner F, Ercal F, Sadayappan P (1988) Iterative algorithms for solution of large sparse systems of linear equations on hypercubes. IEEE Trans Comput 37(12):1554\u20131568","journal-title":"IEEE Trans Comput"},{"key":"3243_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cam.2015.01.025","volume":"283","author":"Z-Z Bai","year":"2015","unstructured":"Bai Z-Z (2015) Motivations and realizations of Krylov subspace methods for large sparse linear systems. J Comput Appl Math 283:71\u201378","journal-title":"J Comput Appl Math"},{"issue":"3","key":"3243_CR4","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1137\/090769156","volume":"32","author":"G Ballard","year":"2011","unstructured":"Ballard G, Demmel J, Holtz O, Schwartz O (2011) Minimizing communication in numerical linear algebra. SIAM J Matrix Anal Appl 32(3):866\u2013901","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3243_CR5","doi-asserted-by":"crossref","unstructured":"Carlon AG, Torii AJ, Lopez RH, de\u00a0Cursi JES (2021) \u201cStochastic gradient descent for risk optimization,\u201d in Proceedings of the 5th International Symposium on Uncertainty Quantification and Stochastic Modelling: Uncertainties 2020, pp.\u00a0424\u2013435, Springer","DOI":"10.1007\/978-3-030-53669-5_31"},{"key":"3243_CR6","volume-title":"Communication-avoiding Krylov subspace methods in theory and practice","author":"EC Carson","year":"2015","unstructured":"Carson EC (2015) Communication-avoiding Krylov subspace methods in theory and practice. University of California, Berkeley"},{"issue":"3","key":"3243_CR7","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/16M1107942","volume":"39","author":"EC Carson","year":"2018","unstructured":"Carson EC (2018) The adaptive s-step conjugate gradient method. SIAM J Matrix Anal Appl 39(3):1318\u20131338","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"3243_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1137\/120893057","volume":"35","author":"E Carson","year":"2014","unstructured":"Carson E, Demmel J (2014) A residual replacement strategy for improving the maximum attainable accuracy of s-step Krylov subspace methods. SIAM J Matrix Anal Appl 35(1):22\u201343","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"3243_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2425","volume":"29","author":"E Carson","year":"2022","unstructured":"Carson E, Gergelits T, Yamazaki I (2022) Mixed precision s-step Lanczos and conjugate gradient algorithms. Numerical Linear Algebra with Applications 29(3):e2425","journal-title":"Numerical Linear Algebra with Applications"},{"key":"3243_CR10","doi-asserted-by":"crossref","unstructured":"Chronopoulos AT, Kucherov AB (2001) \u201cA parallel Krylov-type method for nonsymmetric linear systems,\u201d in International Conference on High-Performance Computing, pp.\u00a0104\u2013114, Springer","DOI":"10.1007\/3-540-45307-5_10"},{"key":"3243_CR11","unstructured":"Chronopoulos AT, Pernice M (1991) \u201cVector Preconditioned s-Step Methods on the IBM 3090\/6005\/6VF,\u201d in Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, pp.\u00a0130\u2013137"},{"issue":"6","key":"3243_CR12","doi-asserted-by":"publisher","first-page":"1776","DOI":"10.1137\/0728088","volume":"28","author":"AT Chronopoulos","year":"1991","unstructured":"Chronopoulos AT (1991) S-step iterative methods for (non) symmetric (in) definite linear systems. SIAM J Numer Anal 28(6):1776\u20131789","journal-title":"SIAM J Numer Anal"},{"issue":"2","key":"3243_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0377-0427(89)90045-9","volume":"25","author":"AT Chronopoulos","year":"1989","unstructured":"Chronopoulos AT, Gear CW (1989) S-step iterative methods for symmetric linear systems. J Comput Appl Math 25(2):153\u2013168","journal-title":"J Comput Appl Math"},{"issue":"1","key":"3243_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/nla.643","volume":"17","author":"AT Chronopoulos","year":"2010","unstructured":"Chronopoulos AT, Kucherov AB (2010) Block s-step Krylov iterative methods. Numerical Linear Algebra with Applications 17(1):3\u201315","journal-title":"Numerical Linear Algebra with Applications"},{"issue":"5","key":"3243_CR15","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/0167-8191(96)00022-1","volume":"22","author":"AT Chronopoulos","year":"1996","unstructured":"Chronopoulos AT, Swanson CD (1996) Parallel iterative s-step methods for unsymmetric linear systems. Parallel Comput 22(5):623\u2013641","journal-title":"Parallel Comput"},{"issue":"11","key":"3243_CR16","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1109\/TPDS.2019.2917663","volume":"30","author":"S Cools","year":"2019","unstructured":"Cools S, Cornelis J, Vanroose W (2019) Numerically stable recurrence relations for the communication hiding pipelined conjugate gradient method. IEEE Trans Parallel Distrib Syst 30(11):2507\u20132522","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3243_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10589-017-9957-y","volume":"71","author":"R De Leone","year":"2018","unstructured":"De Leone R, Fasano G, Sergeyev YD (2018) Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming. Comput Optim Appl 71:73\u201393","journal-title":"Comput Optim Appl"},{"issue":"4","key":"3243_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0168-9274(95)00079-A","volume":"18","author":"E De Sturler","year":"1995","unstructured":"De Sturler E, van der Vorst HA (1995) Reducing the effect of global communication in GMRES (m) and CG on parallel distributed memory computers. Appl Numer Math 18(4):441\u2013459","journal-title":"Appl Numer Math"},{"issue":"1","key":"3243_CR19","doi-asserted-by":"publisher","first-page":"A206","DOI":"10.1137\/080731992","volume":"34","author":"J Demmel","year":"2012","unstructured":"Demmel J, Grigori L, Hoemmen M, Langou J (2012) Communication-optimal parallel and sequential QR and LU factorizations. SIAM J Sci Comput 34(1):A206\u2013A239","journal-title":"SIAM J Sci Comput"},{"key":"3243_CR20","doi-asserted-by":"crossref","unstructured":"Fasano G (2003) \u201cPlanar-CG methods and matrix tridiagonalization in large scale unconstrained optimization,\u201d High Performance Algorithms and Software for Nonlinear Optimization, pp.\u00a0243\u2013263","DOI":"10.1007\/978-1-4613-0241-4_11"},{"issue":"3\u20134","key":"3243_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1080\/10556780410001689234","volume":"19","author":"G Fasano","year":"2004","unstructured":"Fasano G (2004) Conjugate gradient (CG)-type method for the solution of Newton\u2019s equation within optimization frameworks. Optimization Methods and Software 19(3\u20134):267\u2013290","journal-title":"Optimization Methods and Software"},{"issue":"3","key":"3243_CR22","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10957-005-2087-1","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano G (2005) Planar conjugate gradient algorithm for large-scale unconstrained optimization, part 1: theory. J Optim Theory Appl 125(3):523\u2013541","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"3243_CR23","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10957-005-2088-0","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano G (2005) Planar conjugate gradient algorithm for large-scale unconstrained optimization, part 2: application. J Optim Theory Appl 125(3):543\u2013558","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"3243_CR24","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1515\/amcs-2015-0055","volume":"25","author":"S Feuerriegel","year":"2015","unstructured":"Feuerriegel S, B\u00fccker H (2015) The non-symmetric s-step Lanczos algorithm: Derivation of efficient recurrences and synchronization-reducing variants of BICG and QMR. Int J Appl Math Comput Sci 25(4):769\u2013785","journal-title":"Int J Appl Math Comput Sci"},{"issue":"2","key":"3243_CR25","doi-asserted-by":"publisher","first-page":"C217","DOI":"10.1137\/130930376","volume":"37","author":"L Grigori","year":"2015","unstructured":"Grigori L, Moufawad S (2015) Communication avoiding ILU0 preconditioner. SIAM J Sci Comput 37(2):C217\u2013C246","journal-title":"SIAM J Sci Comput"},{"key":"3243_CR26","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s40314-013-0065-z","volume":"33","author":"M Hajarian","year":"2014","unstructured":"Hajarian M (2014) Solving the general coupled and the periodic coupled matrix equations via the extended QMRCGSTAB algorithms. Comput Appl Math 33:349\u2013362","journal-title":"Comput Appl Math"},{"key":"3243_CR27","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s40314-014-0138-7","volume":"34","author":"M Hajarian","year":"2015","unstructured":"Hajarian M (2015) Developing CGNE algorithm for the periodic discrete-time generalized coupled Sylvester matrix equations. Comput Appl Math 34:755\u2013771","journal-title":"Comput Appl Math"},{"issue":"1","key":"3243_CR28","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s40314-014-0114-2","volume":"34","author":"M Hajarian","year":"2015","unstructured":"Hajarian M (2015) The PMCGAOR and PMCSSOR methods for solving linear complementarity problems. Comput Appl Math 34(1):251\u2013264","journal-title":"Comput Appl Math"},{"key":"3243_CR29","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1007\/s40314-017-0497-y","volume":"37","author":"M Hajarian","year":"2018","unstructured":"Hajarian M (2018) On the convergence of conjugate direction algorithm for solving coupled Sylvester matrix equations. Comput Appl Math 37:3077\u20133092","journal-title":"Comput Appl Math"},{"issue":"4","key":"3243_CR30","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s40314-021-01523-5","volume":"40","author":"M Hajarian","year":"2021","unstructured":"Hajarian M (2021) Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems. Comput Appl Math 40(4):137","journal-title":"Comput Appl Math"},{"key":"3243_CR31","doi-asserted-by":"crossref","unstructured":"Jolivet P, Tournier P-H (2016) \u201cBlock iterative methods and recycling for improved scalability of linear solvers,\u201d in SC\u201916: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp.\u00a0190\u2013203, IEEE","DOI":"10.1109\/SC.2016.16"},{"key":"3243_CR32","unstructured":"Ju L, Leng W, Wang Z, Yuan S (2017) \u201cNumerical investigation of ensemble methods with block iterative solvers for evolution problems,\u201d Discrete & Continuous Dynamical Systems-B, vol.\u00a022, no.\u00a011"},{"key":"3243_CR33","doi-asserted-by":"crossref","unstructured":"Kaveh HS, Hajarian M, Chronopoulos AT (2025) \u201cEfficient image reconstruction via regularized variable s-step conjugate gradient method for Sylvester matrix equations,\u201d Journal of the Franklin Institute, p.\u00a0107634","DOI":"10.1016\/j.jfranklin.2025.107634"},{"issue":"14","key":"3243_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2024.107071","volume":"361","author":"HS Kaveh","year":"2024","unstructured":"Kaveh HS, Hajarian M, Chronopoulos AT (2024) Developing variable s-step CGNE and CGNR algorithms for non-symmetric linear systems. J Franklin Inst 361(14):107071","journal-title":"J Franklin Inst"},{"issue":"3","key":"3243_CR35","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0377-0427(92)90085-C","volume":"42","author":"S Kim","year":"1992","unstructured":"Kim S, Chronopoulos A (1992) An efficient nonsymmetric Lanczos method on parallel vector computers. J Comput Appl Math 42(3):357\u2013374","journal-title":"J Comput Appl Math"},{"issue":"6","key":"3243_CR36","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1137\/0117118","volume":"17","author":"DG Luenberger","year":"1969","unstructured":"Luenberger DG (1969) Hyperbolic pairs in the method of conjugate gradients. SIAM J Appl Math 17(6):1263\u20131267","journal-title":"SIAM J Appl Math"},{"key":"3243_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55251-0","volume-title":"Krylov methods for nonsymmetric linear systems","author":"G Meurant","year":"2020","unstructured":"Meurant G, Tebbens JD (2020) Krylov methods for nonsymmetric linear systems. Springer, Cham"},{"key":"3243_CR38","unstructured":"Moufawad S (2018) \u201cNumerical Stability of s-step Enlarged Krylov Subspace Conjugate Gradient Methods,\u201d arXiv preprint arXiv:1804.10629"},{"key":"3243_CR39","unstructured":"National Institute of Standards and Technology: Matrix Market, https:\/\/math.nist.gov\/MatrixMarket\/"},{"issue":"131","key":"3243_CR40","first-page":"1","volume":"23","author":"J Nutini","year":"2022","unstructured":"Nutini J, Laradji I, Schmidt M (2022) Let\u2019s Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence. J Mach Learn Res 23(131):1\u201374","journal-title":"J Mach Learn Res"},{"key":"3243_CR41","doi-asserted-by":"crossref","unstructured":"Saad Y (2003) Iterative Methods for Sparse Linear Systems. SIAM","DOI":"10.1137\/1.9780898718003"},{"key":"3243_CR42","doi-asserted-by":"crossref","unstructured":"Shokri\u00a0Kaveh H, Adibi H (2021) \u201cMapped regularization methods for the Cauchy problem of the Helmholtz and Laplace equations,\u201d Iranian Journal of Science and Technology, Transactions A: Science, vol.\u00a045, pp.\u00a0669\u2013682","DOI":"10.1007\/s40995-020-01050-8"},{"key":"3243_CR43","doi-asserted-by":"crossref","unstructured":"Shokri\u00a0Kaveh H, Hajarian M, Chronopoulos AT (2024) \u201cFinding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms,\u201d Computational and Applied Mathematics, vol.\u00a043, no.\u00a06, p.\u00a0360","DOI":"10.1007\/s40314-024-02867-4"},{"issue":"4","key":"3243_CR44","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/0916053","volume":"16","author":"V Simoncini","year":"1995","unstructured":"Simoncini V, Gallopoulos E (1995) An iterative method for nonsymmetric systems with multiple right-hand sides. SIAM J Sci Comput 16(4):917\u2013933","journal-title":"SIAM J Sci Comput"},{"key":"3243_CR45","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1012013911053","volume":"17","author":"F Toutounian","year":"1998","unstructured":"Toutounian F (1998) The stable AT A-orthogonal s-step Orthomin (k) algorithm with the CADNA library. Numerical Algorithms 17:105\u2013119","journal-title":"Numerical Algorithms"},{"key":"3243_CR46","unstructured":"van Rosendale J (1983) \u201cMinimizing inner product data dependence in conjugate gradient iteration,\u201d No. NASA-CR-172178"},{"key":"3243_CR47","doi-asserted-by":"crossref","unstructured":"Van\u00a0der Vorst HA (2003) Iterative Krylov methods for large linear systems. No.\u00a013, Cambridge University Press","DOI":"10.1017\/CBO9780511615115"},{"issue":"4","key":"3243_CR48","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1137\/23M1577109","volume":"45","author":"Z Xu","year":"2024","unstructured":"Xu Z, Alonso JJ, Darve E (2024) A Numerically Stable Communication-Avoiding-Step GMRES Algorithm. SIAM J Matrix Anal Appl 45(4):2039\u20132074","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"3243_CR49","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.camwa.2013.11.008","volume":"67","author":"S-X Zhu","year":"2014","unstructured":"Zhu S-X, Gu T-X, Liu X-P (2014) Minimizing synchronizations in sparse iterative solvers for distributed supercomputers. Computers & Mathematics with Applications 67(1):199\u2013209","journal-title":"Computers & Mathematics with Applications"},{"key":"3243_CR50","doi-asserted-by":"crossref","unstructured":"Zhuang S, Casas M (2017) \u201cIteration-fusing conjugate gradient,\u201d in Proceedings of the International Conference on Supercomputing, pp.\u00a01\u201310","DOI":"10.1145\/3079079.3079091"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03243-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03243-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03243-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T16:36:19Z","timestamp":1757176579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03243-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,2]]},"references-count":50,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["3243"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03243-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,6,2]]},"assertion":[{"value":"17 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2025","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 have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"306"}}