Black box low tensor-rank approximation using fiber-crosses

Constructive Approximation

Volumn 30, Issue 3, 2009, Pages 557-597

  Espig, Mike ^a   Grasedyck, Lars ^a,b   Hackbusch, Wolfgang ^a  

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

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Black box; Cross approximation; Fiber crosses; Low rank; Newton; Tensor

Indexed keywords

EID: 70449522299     PISSN: 01764276     EISSN: 14320940     Source Type: Journal    
DOI: 10.1007/s00365-009-9076-9     Document Type: Article

References (17)

1. Beylkin, G., Mohlenkamp, M. J.: Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26(6), 2133-2159 (2005).
2. Beylkin, G., Garcke, J., Mohlenkamp, M.: Multivariate regression and machine learning with sums of separable functions. SIAM J. Sci. Comput. 31, 1840-1857 (2009).
3. Börm, S., Grasedyck, L.: Hybrid cross approximation of integral operators. Numer. Math. 101, 221-249 (2005).
4. Chinnamsetty, S. R., Espig, M., Khoromskij, B. N., Hackbusch, W., Flad, H. J.: Tensor product approximation with optimal rank in quantum chemistry. J. Chem. Phys. 127(8) (2007).
5. De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253-1278 (2000).
6. 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).
7. Espig, M.: Effiziente Bestapproximation mittels Summen von Elementartensoren in hohen Dimensionen. PhD thesis, Universität Leipzig (2008).
8. Flad, H.-J., Khoromskij, B. N., Savostyanov, D., Tyrtyshnikov, E. E.: Verification of the cross 3D algorithm on quantum chemistry data. Russ. J. Numer. Anal. Math. Model. 23, 329-344 (2008).
9. Grasedyck, L.: Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72, 247-265 (2004).
10. Khoromskij, B. N., Khoromskaia, V.: Multigrid accelerated approximation of function related multi-dimensional arrays. Preprint 40/2008, Max Planck Institute for Mathematics in the Sciences (2008).
11. Kolda, T. G.: Orthogonal tensor decompositions. SIAM J. Matrix Anal. Appl. 23(1), 243-255 (2001).
12. Oseledets, I. V., Savost'yanov, D. V.: Minimization methods for approximating tensors and their comparison. Comput. Math. Math. Phys. 46(10), 1641-1650 (2006).
13. Oseledets, I. V., Tyrtyshnikov, E. E., Savost'yanov, D. V.: Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM J. Matrix Anal. Appl. (2008, to appear).
14. Paatero, P.: A weighted non-negative least squares algorithm for three-way 'PARAFAC' factor analysis. Chemometrics Intel. Lab. Syst. 38, 223-242 (1997).
15. Ten Berge, J. M. F.: Kruskal's polynomial for 2×2×2 arrays and a generalization to 2×n×n. Psychometrika 56, 631-636 (1991).
16. Young, F. W., de Leeuw, J., Takane, Y.: Additive structure in qualitative data: an alternating least squares method with optimal scaling features. Psychometrika 41, 471-503 (1976).
17. Zhang, T., Golub, G. H.: Rank-one approximation to high order tensors. SIAM J. Matrix Anal. Appl. 23(2), 534-550 (2001).