Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format
DOI10.1007/S10915-016-0255-0zbMATH Open1361.65021OpenAlexW2495841599MaRDI QIDQ520189FDOQ520189
Yin Zhang, Junyu Zhang, Zaiwen Wen
Publication date: 3 April 2017
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-016-0255-0
algorithmnumerical experimentseigenvector[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=stationary+Schr%EF%BF%BD%EF%BF%BDdinger+equation&go=Go stationary Schr��dinger equation]alternating least square methodhigh-dimensional eigenvalue problemsubspace optimization methodtensor-train format
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Schrödinger operator, Schrödinger equation (35J10) Estimates of eigenvalues in context of PDEs (35P15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
Cites Work
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Hierarchical Singular Value Decomposition of Tensors
- A Multilinear Singular Value Decomposition
- Tensor Spaces and Numerical Tensor Calculus
- A literature survey of low-rank tensor approximation techniques
- DMRG approach to fast linear algebra in the TT-format
- The alternating linear scheme for tensor optimization in the tensor train format
- Approximation of $2^d\times2^d$ Matrices Using Tensor Decomposition
- Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format
- Computation of extreme eigenvalues in higher dimensions using block tensor train format
- Algorithm 941
- A projection method to solve linear systems in tensor format
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- Preconditioned Low-Rank Methods for High-Dimensional Elliptic PDE Eigenvalue Problems
- Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems
- Block Algorithms with Augmented Rayleigh-Ritz Projections for Large-Scale Eigenpair Computation
Cited In (2)
Uses Software
This page was built for publication: Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520189)
