{"id":"https://openalex.org/W7160237800","doi":"https://doi.org/10.48550/arxiv.2605.01276","title":"A class of low-rank short recurrences for nonsymmetric linear matrix equations","display_name":"A class of low-rank short recurrences for nonsymmetric linear matrix equations","publication_year":2026,"publication_date":"2026-05-02","ids":{"openalex":"https://openalex.org/W7160237800","doi":"https://doi.org/10.48550/arxiv.2605.01276"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.01276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.01276","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014648561","display_name":"Davide Palitta","orcid":"https://orcid.org/0000-0002-6987-4430"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Palitta, Davide","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135401155","display_name":"Catherine E. Powell","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Powell, Catherine E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081841768","display_name":"Valeria Simoncini","orcid":"https://orcid.org/0000-0003-0795-5865"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simoncini, Valeria","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.5372999906539917,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.5372999906539917,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.17299999296665192,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.15700000524520874,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5996999740600586},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5601000189781189},{"id":"https://openalex.org/keywords/krylov-subspace","display_name":"Krylov subspace","score":0.5414000153541565},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5034000277519226},{"id":"https://openalex.org/keywords/truncation","display_name":"Truncation (statistics)","score":0.503000020980835},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5023000240325928},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.49549999833106995},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.47290000319480896},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4708000123500824},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45100000500679016}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.800599992275238},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.6128000020980835},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5996999740600586},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5601000189781189},{"id":"https://openalex.org/C147060835","wikidata":"https://www.wikidata.org/wiki/Q1757151","display_name":"Krylov subspace","level":3,"score":0.5414000153541565},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5034000277519226},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.503000020980835},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5023000240325928},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.49549999833106995},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.47290000319480896},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4708000123500824},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45100000500679016},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.42809998989105225},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.41940000653266907},{"id":"https://openalex.org/C77346573","wikidata":"https://www.wikidata.org/wiki/Q484637","display_name":"Linear equation","level":2,"score":0.41830000281333923},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.40220001339912415},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C60866291","wikidata":"https://www.wikidata.org/wiki/Q5140577","display_name":"Coefficient matrix","level":3,"score":0.3853999972343445},{"id":"https://openalex.org/C104942944","wikidata":"https://www.wikidata.org/wiki/Q3434686","display_name":"Truncation error","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.30970001220703125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2944999933242798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29249998927116394},{"id":"https://openalex.org/C21556879","wikidata":"https://www.wikidata.org/wiki/Q43219517","display_name":"Moore\u2013Penrose pseudoinverse","level":3,"score":0.2924000024795532},{"id":"https://openalex.org/C54219892","wikidata":"https://www.wikidata.org/wiki/Q4080929","display_name":"Matrix-free methods","level":4,"score":0.2870999872684479},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C49766605","wikidata":"https://www.wikidata.org/wiki/Q207643","display_name":"Linear map","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C46030957","wikidata":"https://www.wikidata.org/wiki/Q1238125","display_name":"Kronecker product","level":3,"score":0.2694000005722046},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.01276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.01276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,45,51,57],"new":[3],"class":[4],"of":[5,12,16,56,66],"short":[6],"matrix":[7],"recurrences":[8],"for":[9],"the":[10,17,64,67],"solution":[11],"nonsymmetric":[13],"linear":[14],"equations":[15],"type":[18],"$\\mathbf{A}_1\\mathbf{X}\\mathbf{B}_1+\\ldots+\\mathbf{A}_p\\mathbf{X}\\mathbf{B}_p=CD^T$.":[19],"These":[20],"iterative":[21],"methods":[22],"combine":[23],"local":[24],"subspace":[25],"projection":[26],"to":[27,38],"speed":[28],"up":[29],"convergence":[30],"with":[31,60],"rank":[32],"truncation":[33],"strategies":[34],"and":[35],"randomization":[36],"procedures":[37],"limit":[39],"memory":[40],"consumption.":[41],"Computational":[42],"experiments":[43],"on":[44],"benchmark":[46],"problem":[47],"as":[48,50],"well":[49],"challenging":[52],"discretized":[53],"mixed":[54],"formulation":[55],"diffusion":[58],"equation":[59],"random":[61],"inputs":[62],"illustrate":[63],"potential":[65],"proposed":[68],"methodology.":[69]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-06T00:00:00"}