Modified iterations for data-sparse solution of linear systems

  • A modification of standard linear iterative methods for the solution of linear equations is investigated aiming at improved data-sparsity with respect to a rank function. The convergence speed of the modified method is compared to the rank growth of its iterates for certain model cases. The considered general setup is common in the data-sparse treatment of high dimensional problems such as sparse approximation and low rank tensor calculus.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Wolfgang Hackbusch, André UschmajewGND
URN:urn:nbn:de:bvb:384-opus4-1031153
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/103115
ISSN:2305-221XOPAC
ISSN:2305-2228OPAC
Parent Title (English):Vietnam Journal of Mathematics
Publisher:Springer
Place of publication:Berlin
Type:Article
Language:English
Year of first Publication:2021
Publishing Institution:Universität Augsburg
Release Date:2023/03/23
Tag:General Mathematics
Volume:49
First Page:493
Last Page:512
DOI:https://doi.org/10.1007/s10013-021-00504-9
Institutes:Mathematisch-Naturwissenschaftlich-Technische Fakultät
Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik
Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik / Lehrstuhl für Mathematical Data Science
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):CC-BY 4.0: Creative Commons: Namensnennung (mit Print on Demand)