Krylov subspace methods for linear systems with tensor product structure

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 4, 2009, Pages 1688-1714

  Kressner, Daniel ^a   Tobler, Christine ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

High dimensionality; Krylov subspace methods; Linear systems; Low tensor rank

Indexed keywords

CLASS OF METHODS; COMPUTATIONAL COSTS; CURSE OF DIMENSIONALITY; FINITE-ELEMENT DISCRETIZATION; HIGH DIMENSIONALITY; HYPERCUBE; KRYLOV SUBSPACE METHOD; LINEAR MATRIX EQUATIONS; LOW TENSOR RANK; NATURAL EXTENSION; NUMERICAL SOLUTION; TENSOR PRODUCT STRUCTURES; TENSOR RANKS;

LINEAR SYSTEMS; NUMERICAL ANALYSIS; VECTORS;

TENSORS;

EID: 77956045829     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/090756843     Document Type: Article

References (27)

1. B. W. Bader and T. G. Kolda, Efficient MATLAB computations with sparse and factored tensors, SIAM J. Sci. Comput., 30 (2007), pp. 205-231.
2. B. W. Bader and T. G. Kolda, MATLAB Tensor Toolbox Version 2.3, http://csmr.ca.sandia.gov/?tgkolda/TensorToolbox/ (July 2009).
3. B. Beckermann and L. Reichel, Error Estimation and Evaluation of Matrix Functions via the Faber Transform, Technical report, Université de Lille, Lille, France, 2008.
4. G. Beylkin and M. J. Mohlenkamp, Algorithms for numerical analysis in high dimensions, SIAM J. Sci. Comput., 26 (2005), pp. 2133-2159.
5. 2-matrices - An Efficient Tool for the Treatment of Dense Matrices, Habilitationsschrift, Christian-Albrechts- Universität zu Kiel, Kiel, Germany, 2006.
6. D. Braess and W. Hackbusch, Approximation of 1/x by exponential sums in [1, ∞), IMA J. Numer. Anal., 25 (2005), pp. 685-697.
7. V. Druskin and L. Knizhnerman, Extended Krylov subspaces: Approximation of the matrix square root and related functions, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 755-771.
8. V. L. Druskin and L. A. Knizhnerman, Two polynomial methods for calculating functions of symmetric matrices, Zh. Vychisl. Mat. Mat. Fiz., 29 (1989), pp. 1763-1775.
9. L. Grasedyck, Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure, Computing, 72 (2004). pp. 247-265.
10. W. Hackbusch, Approximation of 1/x by Exponential Sums, http://www.mis.mpg.de/scicomp/EXPSUM/1x/tabelle (August 2008).
11. W. Hackbusch, Entwicklungen nach Exponentialsummen, Technical report, Max-PlanckInstitut für Mathematik in den Naturwissenschaften, Leipzig, Germany, 2009; revised version available online from http://www.mis.mpg.de/ preprints/tr/report-0405.pdf.
12. W. Hackbusch, Hierarchische Matrizen: Algorithmen und Analysis, Springer-Verlag, Berlin, 2009.
13. W. Hackbusch, B. N. Khoromskij, S. A. Sauter, and E. E. Tyrtyshnikov, Use of Tensor Formats in Elliptic Eigenvalue Problems, Preprint 78/2008, Max-Planck-Institut für Mathematik in den Naturwissenschaften, Leipzig, Germany, 2008.
14. M. Heyouni, Extended Arnoldi methods for large Sylvester matrix equations, Technical report, L.M.P.A., Calais, France, 2008.
15. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
16. D. Y. Hu and L. Reichel, Krylov-subspace methods for the Sylvester equation, Linear Algebra Appl., 172 (1992), pp. 283-313.
17. I. M. Jaimoukha and E. M. Kasenally, Krylov subspace methods for solving large Lyapunov equations, SIAM J. Numer. Anal., 31 (1994), pp. 227-251.
18. L. A. Knizhnerman and V. Simoncini, A New Investigation of the Extended Krylov Subspace Method for Matrix Function Evaluations, Numer. Linear Algebra Appl., to appear.
19. T. G. Kolda and B. W. Bader, Tensor decompositions and applications, SIAM Rev., 51 (2009), pp. 455-500.
20. Y. Saad, Numerical solution of large Lyapunov equations, in Signal Processing, Scattering and Operator Theory, and Numerical Methods, Progr. Systems Control Theory 5, Birkhäuser Boston, Boston, 1990, pp. 503-511.
21. Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM, Philadelphia, 2003.
22. V. Simoncini, A new iterative method for solving large-scale Lyapunov matrix equations, SIAM J. Sci. Comput., 29 (2007), pp. 1268-1288.
23. V. Simoncini and V. Druskin, Convergence analysis of projection methods for the numerical solution of large Lyapunov equations, SIAM J. Numer. Anal., 47 (2009), pp. 828-843.
24. G. Starke, Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems, Numer. Math., 78 (1997), pp. 103-117. (Pubitemid 127375363)
25. F. Stenger, Numerical methods based on sinc and analytic functions, Springer Ser. Comput. Math. 20, Springer-Verlag, New York, 1993.
26. G. W. Stewart, Matrix Algorithms, Vol.II. Eigensystems, SIAM, Philadelphia, 2001.
27. C. Tobler, Krylov Subspace Methods for Large Linear Systems with Tensor Product Structure, Master's thesis, ETH Zürich, Zürich, Switzerland, 2008.