Fast multidimensional convolution in low-rank tensor formats via cross approximation

SIAM Journal on Scientific Computing

Volumn 37, Issue 2, 2015, Pages A565-A582

  Rakhuba, M V ^a,b   Oseledets, I V ^a,c  

^a SKOLKOVO INSTITUTE OF SCIENCE AND TECHNOLOGY   (Russian Federation)

^b MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

^c INSTITUTE OF NUMERICAL MATHEMATICS   (Russian Federation)

Author keywords

Black box approximation; Cross approximation; Multidimensional convolution; Multilinear algebra; Tensor decompositions; Tensor train

Indexed keywords

CONVOLUTION; EQUATIONS OF MOTION; FREQUENCY DOMAIN ANALYSIS; HARTREE APPROXIMATION;

APPROXIMATE COMPUTATION; BLACK BOX APPROXIMATION; BLACK BOXES; CROSS APPROXIMATION; HIGH POTENTIAL; MULTI-LINEAR ALGEBRAS; MULTIDIMENSIONAL CONVOLUTION; TENSOR DECOMPOSITION; TENSOR RANKS; TENSOR TRAINS;

TENSORS;

EID: 84928966851     PISSN: 10648275     EISSN: 10957197     Source Type: Journal    
DOI: 10.1137/140958529     Document Type: Article

References (67)

1. J. Ballani, L. Grasedyck, and M. Kluge, Black box approximation of tensors in hierarchical Tucker format, Linear Algebra Appl., 428 (2013), pp. 639-657.
2. M. Bebendorf, Approximation of boundary element matrices, Numer. Math., 86 (2000), pp. 565-589.
3. M. Bebendorf, Adaptive cross approximation of multivariate functions, Constr. Approx., 34 (2011), pp. 149-179.
4. G. Beylkin, G. Fann, Z. Gan, R. Harrison, and T. Yanai, Multiresolution quantum chemistry: Basic theory and initial applications, J. Chem. Phys., 121 (2004), pp. 11587-11598.
5. G. Beylkin and M. J. Mohlenkamp, Numerical operator calculus in higher dimensions, Proc. Natl. Acad. Sci. USA, 99 (2002), pp. 10246-10251.
6. G. Beylkin and M. J. Mohlenkamp, Algorithms for numerical analysis in high dimensions, SIAM J. Sci. Comput., 26 (2005), pp. 2133-2159.
7. C. F. Caiafa and A. Cichocki, Generalizing the column-row matrix decomposition to multiway arrays, Linear Algebra Appl., 433 (2010), pp. 557-573.
8. A. Chaudhury, I. Oseledets, and R. Ramachandran, A computationally efficient technique for the solution of multi-dimensional PBMs of granulation, Comput. Chem. Eng., 61 (2014), pp. 234-244.
9. J. Chiu and L. Demanet, Sublinear randomized algorithms for skeleton decompositions, SIAM J. Matrix Anal. Appl., 34 (2013), pp. 1361-1383.
10. L. de Lathauwer, B. de Moor, and J. Vandewalle, A multilinear singular value decomposition, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1253-1278.
11. L. de Lathauwer, B. de Moor, and J. Vandewalle, On best rank-1 and rank-(R1, R2, . . . ,RN) approximation of high-order tensors, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1324-1342.
12. V. de Silva and L.-H. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1084-1127.
13. S. V. Dolgov, B. N. Khoromskij, and D. V. Savostyanov, Superfast Fourier transform using QTT approximation, J. Fourier Anal. Appl., 18 (2012), pp. 915-953.
14. S. V. Dolgov and D. V. Savostyanov, Alternating minimal energy methods for linear systems in higher dimensions, SIAM J. Sci. Comput., 36 (2014), pp. A2248-A2271.
15. S. A. Goreinov, On cross approximation of multi-index array, Dokl. Math., 420 (2008), pp. 404-406.
16. S. A. Goreinov, I. V. Oseledets, and D. V. Savostyanov, Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case, SIAM J. Sci. Comput., 34 (2012), pp. A1-A27.
17. S. A. Goreinov, I. V. Oseledets, D. V. Savostyanov, E. E. Tyrtyshnikov, and N. L. Zamarashkin, How to find a good submatrix, in Matrix Methods: Theory, Algorithms, Applications, V. Olshevsky and E. Tyrtyshnikov, eds., World Scientific, Hackensack, NJ, 2010, pp. 247-256.
18. S. A. Goreinov and E. E. Tyrtyshnikov, The maximal-volume concept in approximation by low-rank matrices, Contemp. Math., 208 (2001), pp. 47-51.
19. L. Grasedyck, Hierarchical singular value decomposition of tensors, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2029-2054.
20. L. Grasedyck and W. Hackbusch, An introduction to hierarchical (H-) and TT-rank of tensors with examples, Comput. Methods Appl. Math., 3 (2011), pp. 291-304.
21. L. Grasedyck, D. Kressner, and C. Tobler, A literature survey of low-rank tensor approximation techniques, GAMM-Mitt., 36 (2013), pp. 53-78.
22. W. Hackbusch, Fast and exact projected convolution for non-equidistant grids, Computing, 80 (2007), pp. 137-168.
23. W. Hackbusch, Efficient convolution with the Newton potential in d dimensions, Numer. Math., 110 (2008), pp. 449-489.
24. W. Hackbusch, Tensor Spaces and Numerical Tensor Calculus, Springer-Verlag, Berlin, 2012.
25. W. Hackbusch and B. N. Khoromskij, Low-rank Kronecker-product approximation to multidimensional nonlocal operators. I. Separable approximation of multi-variate functions, Computing, 76 (2006), pp. 177-202.
26. W. Hackbusch and B. N. Khoromskij, Low-rank Kronecker-product approximation to multidimensional nonlocal operators. II. HKT representation of certain operators, Computing, 76 (2006), pp. 203-225.
27. W. Hackbusch and S. Kühn, A new scheme for the tensor representation, J. Fourier Anal. Appl., 15 (2009), pp. 706-722.
28. F. L. Hitchcock, Multiple invariants and generalized rank of a p-way matrix or tensor, J. Math. Phys., 7 (1927), pp. 39-79.
29. V. Kazeev, B. Khoromskij, and E. Tyrtyshnikov, Multilevel Toeplitz matrices generated by tensor-structured vectors and convolution with logarithmic complexity, SIAM J. Sci. Comput., 35 (2013), pp. A1511-A1536.
30. V. Khoromskaia, Computation of the Hartree-Fock exchange by tensor-structured methods, Comput. Methods Appl. Math., 10 (2008).
31. V. Khoromskaia, Numerical Solution of the Hartree-Fock Equation by Multilevel Tensor-Structured Methods, Ph.D. thesis, TU Berlin, 2010.
32. V. Khoromskaia, Black-box Hartree-Fock solver by tensor numerical methods, Comput. Methods Appl. Math., 14 (2014), pp. 89-111.
33. V. Khoromskaia, B. N. Khoromskij, and R. Schneider, QTT representation of the Hartree and exchange operators in electronic structure calculations, Comput. Methods Appl. Math., 11 (2011), pp. 327-341.
34. V. Khoromskaia, B. N. Khoromskij, and R. Schneider, Tensor-structured factorized calculation of two-electron integrals in a general basis, SIAM J. Sci. Comput., 35 (2013), pp. A987-A1010.
35. B. N. Khoromskij, Structured rank-(r1, . . . , rd) decomposition of function-related operators in Rd, Comput. Methods Appl. Math., 6 (2006), pp. 194-220.
36. B. N. Khoromskij, Fast and accurate tensor approximation of multivariate convolution with linear scaling in dimension, J. Comput. Appl. Math., 234 (2010), pp. 3122-3139.
37. B. N. Khoromskij, O(d log n)-quantics approximation of N-d tensors in high-dimensional numerical modeling, Constr. Approx., 34 (2011), pp. 257-280.
38. B. N. Khoromskij, Tensor-structured numerical methods in scientific computing: Survey on recent advances, Chemom. Intell. Lab. Syst., 110 (2012), pp. 1-19.
39. B. N. Khoromskij and V. Khoromskaia, Low rank Tucker-type tensor approximation to classical potentials, Cent. Eur. J. Math., 5 (2007), pp. 523-550.
40. B. N. Khoromskij and V. Khoromskaia, Multigrid accelerated tensor approximation of function related multidimensional arrays, SIAM J. Sci. Comput., 31 (2009), pp. 3002-3026.
41. B. N. Khoromskij, V. Khoromskaia, S. R. Chinnamsetty, and H.-J. Flad, Tensor decomposition in electronic structure calculations on 3D Cartesian grids, J. Comput. Phys., 228 (2009), pp. 5749-5762.
42. B. N. Khoromskij, V. Khoromskaia, and H.-J. Flad., Numerical solution of the Hartree-Fock equation in multilevel tensor-structured format, SIAM J. Sci. Comput., 33 (2011), pp. 45-65.
43. T. G. Kolda and B. W. Bader, Tensor decompositions and applications, SIAM Rev., 51 (2009), pp. 455-500.
44. Y. K. Kwok, K. S. Leung, and H. Y. Wong, Efficient options pricing using the fast Fourier transform, in Handbook of Computational Finance, Springer, New York, 2012, pp. 579-604.
45. I. V. Oseledets, Approximation of 2d × 2d matrices using tensor decomposition, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2130-2145.
46. I. V. Oseledets, DMRG approach to fast linear algebra in the TT-format, Comput. Methods Appl. Math., 11 (2011), pp. 382-393.
47. I. V. Oseledets, Tensor-train decomposition, SIAM J. Sci. Comput., 33 (2011), pp. 2295-2317.
48. I. V. Oseledets et al., MATLAB TT-Toolbox Version 2.2, Math Works, Natick, MA, 2011.
49. I. V. Oseledets, D. V. Savostianov, and E. E. Tyrtyshnikov, Tucker dimensionality reduction of three-dimensional arrays in linear time, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 939-956.
50. I. V. Oseledets, D. V. Savostyanov, and E. E. Tyrtyshnikov, Linear algebra for tensor problems, Computing, 85 (2009), pp. 169-188.
51. I. V. Oseledets and E. E. Tyrtyshnikov, Breaking the curse of dimensionality, or how to use SVD in many dimensions, SIAM J. Sci. Comput., 31 (2009), pp. 3744-3759.
52. I. V. Oseledets and E. E. Tyrtyshnikov, TT-cross approximation for multidimensional arrays, Linear Algebra Appl., 432 (2010), pp. 70-88.
53. S. Ostlund and S. Rommer, Thermodynamic limit of density matrix renormalization, Phys. Rev. Lett., 75 (1995), pp. 3537-3540.
54. G. Palaniswaamy and S. K. Loyalka, Direct simulation monte carlo aerosol dynamics: Collisional sampling algorithms, Ann. Nuclear Energy, 34 (2007), pp. 13-21.
55. R. D. Johnson III, NIST Computational Chemistry Comparison and Benchmark Database Number 101 Release 16a, 2013.
56. D. V. Savostyanov, Quasioptimality of maximum-volume cross interpolation of tensors, Linear Algebra Appl., 458 (2014), pp. 217-244.
57. D. V. Savostyanov and I. V. Oseledets, Fast adaptive interpolation of multi-dimensional arrays in tensor train format, in Proceedings of 7th International Workshop on Multidimensional Systems, IEEE, 2011.
58. D. V. Savostyanov and E. E. Tyrtyshnikov, Approximate multiplication of tensor matrices based on the individual filtering of factors, J. Comp. Math. Math. Phys., 49 (2009), pp. 1662-1677.
59. D. V. Savostyanov, E. E. Tyrtyshnikov, and N. L. Zamarashkin, Fast truncation of mode ranks for bilinear tensor operations, Numer. Linear Algebra Appl., 19 (2012), pp. 103-111.
60. U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys., 326 (2011), pp. 96-192.
61. L. R. Tucker, Some mathematical notes on three-mode factor analysis, Psychometrika, 31 (1966), pp. 279-311.
62. E. E. Tyrtyshnikov, Optimal and superoptimal circulant preconditioners, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 459-473.
63. E. E. Tyrtyshnikov, Incomplete cross approximation in the mosaic-skeleton method, Computing, 64 (2000), pp. 367-380.
64. J. Wattis, An introduction to mathematical models of coagulation-fragmentation processes: A discrete deterministic mean-field approach, Phys. D, 222 (2006), pp. 1-20.
65. S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett., 69 (1992), pp. 2863-2866.
66. J. W. Woods, Multidimensional Signal, Image, and Video Processing and Coding, Academic Press, New York, 2006.
67. T. Yanai, G. I. Fann, Z. Gan, R. J. Harrison, and G. Beylkin, Multiresolution quantum chemistry in multiwavelet bases: Hartree-Fock exchange, J. Chem. Phys., 121 (2004), pp. 6680-6688.