Low-rank tensor methods with subspace correction for symmetric eigenvalue problems

SIAM Journal on Scientific Computing

Volumn 36, Issue 5, 2014, Pages A2346-A2368

  Kressner, Daniel ^a   Steinlechner, Michael ^a   Uschmajew, André ^a  

^a Section de Mathematiques Ecole Polytechnique Federale de Lausanne   (Switzerland)

Author keywords

ALS; DMRG; High dimensional eigenvalue problems; LOBPCG; Low rank tensor methods; Tensor train format; Trace minimization

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; TENSORS;

ALS; DMRG; EIGENVALUE PROBLEM; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL EIGENVALUE PROBLEM; HIGHER-DIMENSIONAL; LOBPCG; LOW-RANK TENSOR METHOD; TENSOR METHOD; TENSOR TRAIN FORMAT; TENSOR TRAINS; TRACE MINIMIZATION;

LINEAR SYSTEMS;

EID: 84911401665     PISSN: 10648275     EISSN: 10957197     Source Type: Journal    
DOI: 10.1137/130949919     Document Type: Article

References (43)

1. P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Princeton University Press, Princeton, NJ, 2008.
2. P. A. Absil, R. Mahony, R. Sepulchre, and P. Van Dooren, A Grassmann-Rayleigh quotient iteration for computing invariant subspaces, SIAM Rev., 44 (2002), pp. 57-73.
3. D. Baye and P.-H. Heenen, Generalised meshes for quantum mechanical problems, J. Phys. A, 19 (1986), pp. 2041-2059.
4. J. H. Bramble, J. E. Pasciak, and A. V. Knyazev, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Adv. Comput. Math., 6 (1996), pp. 159-189.
5. E. Cances, V. Ehrlacher, and Y. Maday, Periodic Schrödinger operators with local defects and spectral pollution, SIAM J. Numer. Anal., 50 (2012), pp. 3016-3035.
6. S. V. Dolgov, B. N. Khoromskij, I. V. Oseledets, and D. V. Savostyanov, Computation of extreme eigenvalues in higher dimensions using block tensor train format, Comput. Phys. Comm., 185 (2014), pp. 1207-1216.
7. S. V. Dolgov, B. N. Khoromskij, I. V. Oseledets, and E. E. Tyrtyshnikov, Low-rank tensor structure of solutions to elliptic problems with jumping coefficients, J. Comput. Math., 30 (2012), pp. 14-23.
8. S. V. Dolgov and D. V. Savostyanov, Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions. Part I: SPD Systems, preprint, arXiv:1301.6068, 2013.
9. S. V. Dolgov and D. V. Savostyanov, Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions. Part II: Faster Algorithm and Application to Nonsymmetric Systems, preprint, arXiv:1304.1222, 2013.
10. S. V. Dolgov and D. V. Savostyanov, One-Site Density Matrix Renormalization Group and Alternating Minimum Energy Algorithm, preprint, arXiv:1312.6542, 2013.
11. A. Edelman, T. A. Arias, and S. T. Smith, The geometry of algorithms with orthogonality constraints, SIAM J. Matrix Anal. Appl., 20 (1998), pp. 303-353.
12. E. Faou, V. Gradinaru, and C. Lubich, Computing semiclassical quantum dynamics with Hagedorn wavepackets, SIAM J. Sci. Comput., 31 (2009), pp. 3027-3041.
13. L. Grasedyck, Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure, Computing, 72 (2004), pp. 247-265.
14. L. Grasedyck, Hierarchical singular value decomposition of tensors, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2029-2054.
15. L. Grasedyck, D. Kressner, and C. Tobler, A literature survey of low-rank tensor approximation techniques, GAMM Mitt. Ges. Angew. Math. Mech., 36 (2013), pp. 53-78.
16. W. Hackbusch, Entwicklungen nach Exponentialsummen, Technical report 4/2005, MPI MIS, Leipzig, Germany, 2010.
17. W. Hackbusch, Tensor Spaces and Numerical Tensor Calculus, Springer, Heidelberg, 2012.
18. W. Hackbusch, B. N. Khoromskij, S. A. Sauter, and E. E. Tyrtyshnikov, Use of tensor formats in elliptic eigenvalue problems, Numer. Linear Algebra Appl., 19 (2012), pp. 133-151.
19. W. Hackbusch and S. Kühn, A new scheme for the tensor representation, J. Fourier Anal. Appl., 15 (2009), pp. 706-722.
20. R. J. Harrison, G. I. Fann, T. Yanai, Z. Gan, and G. Beylkin, Multiresolution quantum chemistry: Basic theory and initial applications, J. Chem. Phys., 121 (2004), pp. 11587-11598.
21. S. Holtz, T. Rohwedder, and R. Schneider, The alternating linear scheme for tensor optimization in the tensor train format, SIAM J. Sci. Comput., 34 (2012), pp. A683-A713.
22. T. Huckle and K. Waldherr, Subspace iteration methods in terms of matrix product states, PAMM Proc. Appl. Math. Mech., 12 (2012), pp. 641-642.
23. V. A. Kazeev and B. N. Khoromskij, Low-rank explicit QTT representation of the Laplace operator and its inverse, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 742-758.
24. V. Khoromskaia, Black-box Hartree-Fock solver by tensor numerical methods, Comput. Methods Appl. Math., 14 (2014), pp. 89-111.
25. 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.
26. B. N. Khoromskij and I. V. Oseledets, DMRG+QTT Approach to Computation of the Ground State for the Molecular Schrödinger Operator, Technical report 69/2010, MPI MIS, Leipzig, Germany, 2010.
27. B. N. Khoromskij and I. V. Oseledets, Quantics-TT collocation approximation of parameterdependent and stochastic elliptic PDEs, Comput. Methods Appl. Math., 10 (2010), pp. 376-394.
28. A. V. Knyazev, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23 (2001), pp. 517-541.
29. D. Kressner and C. Tobler, Preconditioned low-rank methods for high-dimensional elliptic PDE eigenvalue problems, Comput. Methods Appl. Math., 11 (2011), pp. 363-381.
30. O. S. Lebedeva, Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format, Russian J. Numer. Anal. Math. Modelling, 26 (2011), pp. 465-489.
31. H.-D. Meyer, U. Manthe, and L.-S. Cederbaum, The multiconfigurational time-dependent Hartree approach, Chem. Phys. Lett., 165 (1990), pp. 73-78.
32. K. Neymeyr, A geometric theory for preconditioned inverse iteration applied to a subspace, Math. Comp., 71 (2002), pp. 197-216.
33. I. V. Oseledets, Tensor-train decomposition, SIAM J. Sci. Comput., 33 (2011), pp. 2295-2317.
34. 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.
35. I. Pi?zorn and F. Verstraete, Variational numerical renormalization group: Bridging the gap between NRG and density matrix renormalization group, Phys. Rev. Lett., 108 (2012), 067202.
36. A. Raab and H.-D. Meyer, A numerical study on the performance of the multiconfigurational time-dependent Hartree method for density operators, J. Chem. Phys., 112 (2000), pp. 10718-10729.
37. T. Rohwedder and A. Uschmajew, On local convergence of alternating schemes for optimization of convex problems in the tensor train format, SIAM J. Numer. Anal., 51 (2013), pp. 1134-1162.
38. A. H. Sameh and Z. Tong, The trace minimization method for the symmetric generalized eigenvalue problem, J. Comput. Appl. Math., 123 (2000), pp. 155-175.
39. A. H. Sameh and J. A. Wisniewski, A trace minimization algorithm for the generalized eigenvalue problem, SIAM J. Numer. Anal., 19 (1982), pp. 1243-1259.
40. U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Physics, 326 (2011), pp. 96-192.
41. A. Weichselbaum, F. Verstraete, U. Schollwöck, J. I. Cirac, and J. von Delft, Variational matrix-product-state approach to quantum impurity models, Phys. Rev. B, 80 (2009), 165117.
42. S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett., 69 (1992), pp. 2863-2866.
43. S. R. White, Density matrix renormalization group algorithms with a single center site, Phys. Rev. B, 72 (2005), 180403.