{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:29:18Z","timestamp":1787336958650,"version":"3.56.0"},"reference-count":35,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"name":"INdAM-GNCS"},{"name":"European Union - NextGenerationEU","award":["20227PCCKZ - CUP J53D23003620006"],"award-info":[{"award-number":["20227PCCKZ - CUP J53D23003620006"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2025,12,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>The efficient solution of large-scale multiterm linear matrix equations is a challenging task in numerical linear algebra, and it is a largely open problem. We propose a new iterative scheme for symmetric and positive definite operators, significantly advancing methods such as truncated matrix-oriented conjugate gradients (cg). The new algorithm capitalizes on the low-rank matrix format of its iterates by fully exploiting the subspace information of the factors as iterations proceed. The approach implicitly relies on orthogonality conditions imposed over much larger subspaces than in cg, unveiling insightful connections with subspace projection methods. The new method is also equipped with memory-saving strategies. In particular, we show that for a given matrix [Formula: see text], the action [Formula: see text] in low-rank format may not be evaluated exactly due to memory constraints. This problem is often underestimated, though it will eventually produce out-of-memory breakdowns for a sufficiently large number of terms. We propose an ad hoc randomized range-finding strategy that appears to fully resolve this shortcoming. Experimental results with typical application problems illustrate the potential of our approach over various methods developed in the recent literature.<\/jats:p>\n                  <jats:p>Reproducibility of computational results. This paper has been awarded the \u201cSIAM Reproducibility Badge: Code and data available\u201d as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https:\/\/github.com\/palittaUniBO . [Formula: see text]<\/jats:p>","DOI":"10.1137\/25m1723402","type":"journal-article","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T07:45:22Z","timestamp":1759823122000},"page":"2197-2225","source":"Crossref","is-referenced-by-count":1,"title":["A Subspace-Conjugate Gradient Method for Linear Matrix Equations"],"prefix":"10.1137","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6987-4430","authenticated-orcid":true,"given":"Davide","family":"Palitta","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica and (AM), Alma Mater Studiorum Universit\u00e0 di Bologna, Piazza di Porta San Donato 5, I-40127 Bologna, Italy."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3354-2538","authenticated-orcid":true,"given":"Martina","family":"Iannacito","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica and (AM), Alma Mater Studiorum Universit\u00e0 di Bologna, Piazza di Porta San Donato 5, I-40127 Bologna, Italy."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0795-5865","authenticated-orcid":true,"given":"Valeria","family":"Simoncini","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica and (AM), Alma Mater Studiorum Universit\u00e0 di Bologna, Piazza di Porta San Donato 5, I-40127 Bologna, Italy."},{"name":"IMATI-CNR, Pavia, Italy."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2025,10,7]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718713"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/120900204"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-013-0521-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974829"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/09075041X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2009.08.108"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/130937251"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/24M1688540"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/nla.603"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/15M1040414"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/100813257"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2014.09.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1051\/m2an\/2022035"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2176"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1919"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1973"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/100799010"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2020.09.014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139017329"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90247-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-021-01080-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10013-020-00390-7"},{"key":"ref25","unstructured":"K. B. Petersen and M. S. Pedersen, The Matrix Cookbook, Version 20081110, Technical University of Denmark, 2008, http:\/\/www2.imm.dtu.dk\/pubdb\/p.php?3274."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drn014"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032399"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-015-0777-7"},{"key":"ref29","unstructured":"D. Silvester, A. Bespalov, and C. Powell, S-IFISS Version 1.0, 2014, https:\/\/personalpages.manchester.ac.uk\/staff\/david.silvester\/ifiss\/sifiss.html."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/130912839"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/22M147880X"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/130926365"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/080742853"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/nla.70020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5122-8"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/25M1723402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:38:11Z","timestamp":1787333891000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/25M1723402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,7]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12,31]]}},"alternative-id":["10.1137\/25M1723402"],"URL":"https:\/\/doi.org\/10.1137\/25m1723402","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,7]]}}}