A projection method to solve linear systems in tensor format

Numerical Linear Algebra with Applications

Volumn 20, Issue 1, 2013, Pages 27-43

  Ballani, Jonas ^a   Grasedyck, Lars ^b  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

High dimension; Kronecker product matrix; Linear system; Low rank; Tucker

Indexed keywords

EID: 84870908752     PISSN: 10705325     EISSN: 10991506     Source Type: Journal    
DOI: 10.1002/nla.1818     Document Type: Article

References (17)

1. Grasedyck L. Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 2004; 72(3-4):247-265.
2. Beylkin G, Mohlenkamp MJ. Algorithms for numerical analysis in high dimensions. SIAM Journal on Scientific Computing 2005; 26(6):2133-2159.
3. Beylkin G, Mohlenkamp MJ. Numerical operator calculus in higher dimensions. Proceedings of the National Academy of Sciences of the United States of America 2002; 99:10246-10251.
4. Espig M, Hackbusch W, Rohwedder T, Schneider R. Variational calculus with sums of elementary tensors of fixed rank. Technical Report 52, Max Planck Institute for Mathematics in the Sciences, 2009.
5. Kressner D, Tobler C. Krylov subspace methods for linear systems with tensor product structure. SIAM Journal on Matrix Analysis and Applications 2010; 31(4):1688-1714.
6. Eldén L, Savas B. Krylov subspace methods for tensor computations. Technical Report 2, Linköpings Universitet, 2009.
7. Hackbusch W, Kühn S. A new scheme for the tensor representation. The Journal of Fourier Analysis and Applications 2009; 15(5):706-722.
8. Grasedyck L. Hierarchical singular value decomposition of tensors. SIAM Journal on Matrix Analysis and Applications 2010; 31:2029-2054.
9. Hackbusch W, Khoromskij BN, Tyrtyshnikov EE. Approximate iterations for structured matrices. Numerische Mathematik 2008; 109(3):365-383.
10. Saad Y. Iterative Methods for Sparse Linear Systems, Second Edition. SIAM: Philadelphia, PA, 2003.
11. Notay Y. Flexible conjugate gradients. SIAM Journal on Scientific Computing 2000; 22(4):1444-1460.
12. Saad Y. A flexible inner-outer preconditioned GMRES algorithm. SIAM Journal on Scientific Computing 1993; 14(2):461-469.
13. Espig M. Effiziente bestapproximation mittels summen von elementartensoren in hohen dimensionen. PhD thesis, Universität Leipzig, 2008.
14. de Lathauwer L, de Moor B, Vandewalle J. A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications 2000; 21(4):1253-1278.
15. Oseledets IV. Compact matrix form of the d-dimensional tensor decomposition. Preprint 09-01. Institute of Numerical Mathematics RAS: Moscow, Russia, 2009.
16. Hackbusch W. Multi-grid methods and applications. Springer: Berlin, 1985.
17. Holtz S, Rohwedder T, Schneider R. The alternating linear scheme for tensor optimisation in the TT format. Technical Report 71, DFG-Schwerpunktprogramm 1324, 2010.