Variational calculus with sums of elementary tensors of fixed rank

Numerische Mathematik

Volumn 122, Issue 3, 2012, Pages 469-488

  Espig, Mike ^a   Hackbusch, Wolfgang ^a   Rohwedder, Thorsten ^b   Schneider, Reinhold ^b  

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

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867502565     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00211-012-0464-x     Document Type: Article

References (32)

1. Beylkin G., Mohlenkamp M. J.: Numerical operator calculus in higher dimensions. Proc. Natl. Acad. Sci. USA 99(16), 10246-10251 (2002).
2. Beylkin G., Mohlenkamp M. J.: Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26(6), 2133-2159 (2005).
3. Beylkin, G., Mohlenkamp, M. J., Pérez, F.: Approximating a wavefunction as an unconstrained sum of Slater determinants. J. Math. Phys. 49(3): 032107 (2008).
4. Braess D., Hackbusch W.: Approximation of 1/x by exponential sums in [1,∞). IMA Numer. Anal. 25, 685-697 (2005).
5. de Silva, V., Lim, L.-H.: Tensor rank and the ill-posedness of the best low-rank approximation problem. Technical Report SCCM-06-06, Stanford University (2006).
6. 3) approximation of a tensor. SIAM J. Mat. Anal. Appl. 31, 248-271 (2009).
7. Espig, M.: Effiziente Bestapproximation mittels Summen von Elementartensoren in hohen Dimensionen. PhD thesis, Universität Leipzig (2008).
8. Espig, M., Grasedyck, L., Hackbusch, W.: Black box low tensor rank approximation using fibre-crosses. Const. Approx. 30, 557-597 (2009).
9. Espig, M., Hackbusch, W.: A regularized newton method for the efficient approximation of tensors represented in the canonical tensor format. Submitted to Num. Math. (2010).
10. Falcó, A., Hackbusch, W.: On minimal subspaces in tensor representations. MIS Preprint 70 (2010).
11. Gavrilyuk I. P., Hackbusch W., Khoromskij B. N.: Hierarchical tensor-product approximation to the inverse and related operators for high-dimensional elliptic problems. Computing 74(2), 131-157 (2005).
12. Grasedyck L.: Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72, 247-265 (2004).
13. Greub W. H.: Multilinear Algebra. Springer, Berlin (1967).
14. Hackbusch W., Khoromskij B. N.: Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators. Part I. Separable approximation of multi-variate functions. Computing 76(3-4), 177-202 (2006).
15. Hackbusch W., Khoromskij B. N.: Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators. Part II. HKT representation of certain operators. Computing 76(3-4), 203-225 (2006).
16. Hackbusch W., Khoromskij B. N., Tyrtyshnikov E. E.: Approximate iterations for structured matrices. Numer. Math. 109(3), 365-383 (2008).
17. Hackbusch W., Kühn S.: A new scheme for the tensor representation. J. Fourier Anal. 15, 706-722 (2009).
18. Holtz, S., Rohwedder, T., Schneider, R.: The alternating linear scheme for tensor optimisation in the tt format. SISC (2010).
19. Holtz, S., Rohwedder, T., Schneider, R.: On manifolds of tensors of fixed tt rank. Numer. Math 120, 701-731 (2012).
20. Ishteva M., Absil P.-A., van Huffel S., de Lathauwer L.: Best low multilinear rank approximation of higher-order tensors based on the riemannian trust region scheme. SIAM J. Matrix Anal. Appl. 32, 115-135 (2011).
21. Kapteyn A., Neudecker H., Wansbeek T.: An approach to n-mode components analysis. Psychometrika 51, 269 (1986).
22. Koch O., Lubich C.: Dynamical low-rank approximation of tensors. SIAM J. Matrix Anal. 31, 2360 (2010).
23. Kosmol, P.: A new class of derivative-free procedures for finding zeros of a function. Computing (1993).
24. Kroonenberg P. M., De Leeuw J.: Principal component analysis of three-mode data by means of alternating least squares algorithms. Psychometrika 45, 69 (1980).
25. Max-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig. http://www. mis. mpg. de/scicomp/exp_sum.
26. Oseledets, I.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295-2317 (2011).
27. Oseledets I. V.: On a new tensor decomposition. Doklady Math. 427, 2 (2009).
28. Oseledets, I. V., Tyrtyshnikov, E. E.: Tensor tree decomposition does not need a tree. Institute of Numerical Mathematics RAS (2009, preprint).
29. Savas B., Lim L.-H.: Quasi-newton methods on grassmannians and multilinear approximations of tensors. SIAM J. Sci. Comput. 32, 3352-3393 (2010).
30. Tucker L. R.: Some mathematical notes on three-mode factor analysis. Psychometrica 31, 279-311 (1966).
31. Uschmajew, A.: Well-posedness of convex maximization problems on stiefel manifolds and orthogonal tensor product approximations. Numer. Math 115, 309-331 (2010).
32. Yokonuma T.: Tensor Spaces and Exterior Algebra. American Mathematical Society, Providence, R. I. (1991).