Computing eigenspaces with low rank constraints
From MaRDI portal
Recommendations
- Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
- Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format
- Jacobi-Davidson method on low-rank matrix manifolds
- Low rank solution of a class of minimization problem on Stiefel manifold
- Computing low-rank rightmost eigenpairs of a class of matrix-valued linear operators
Cites work
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
- A new scheme for the tensor representation
- Alternating minimal energy methods for linear systems in higher dimensions
- An area law for one-dimensional quantum systems
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Computation of extreme eigenvalues in higher dimensions using block tensor train format
- Corrected one-site density matrix renormalization group and alternating minimal energy algorithm
- Ground state entanglement in quantum spin chains
- scientific article; zbMATH DE number 3562121 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- Jacobi-Davidson method on low-rank matrix manifolds
- Low-rank matrix completion by Riemannian optimization
- Low-rank tensor methods with subspace correction for symmetric eigenvalue problems
- Manopt, a Matlab toolbox for optimization on manifolds
- On manifolds of tensors of fixed TT-rank
- Optimization algorithms exploiting unitary constraints
- Projection-like retractions on matrix manifolds
- Solid state physics.
- Tensor Decompositions and Applications
- Tensor numerical methods in scientific computing
- Tensor spaces and numerical tensor calculus
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
- The density-matrix renormalization group in the age of matrix product states
- The Geometry of Algorithms with Orthogonality Constraints
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(6)- Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
- Computing low-rank rightmost eigenpairs of a class of matrix-valued linear operators
- scientific article; zbMATH DE number 7626764 (Why is no real title available?)
- Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format
- Low-rank tensor methods for partial differential equations
- Optimization on the extended tensor-train manifold with shared factors
This page was built for publication: Computing eigenspaces with low rank constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857626)
