Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
From MaRDI portal
Publication:2000621
Recommendations
- A projection method to solve linear systems in tensor format
- A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
- Low-rank approximate inverse for preconditioning tensor-structured linear systems
- SOTT: greedy approximation of a tensor as a sum of tensor trains
- An optimization approach for dynamical Tucker tensor approximation
Cites work
- scientific article; zbMATH DE number 613872 (Why is no real title available?)
- A Multilinear Singular Value Decomposition
- A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
- A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis
- A literature survey of low-rank tensor approximation techniques
- A new convergence proof for the higher-order power method and generalizations
- A new scheme for the tensor representation
- A projection method to solve linear systems in tensor format
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Adaptive cross approximation of multivariate functions
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- Alternating minimal energy methods for linear systems in higher dimensions
- An adaptive algebraic multigrid algorithm for low-rank canonical tensor decomposition
- Approximate iterations for structured matrices
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
- Efficient Computer Manipulation of Tensor Products
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Hierarchical Singular Value Decomposition of Tensors
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- Iterative methods based on soft thresholding of hierarchical tensors
- Local convergence of the alternating least squares algorithm for canonical tensor approximation
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Model reduction and approximation. Theory and algorithms
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the convergence of a greedy rank-one update algorithm for a class of linear systems
- On the global convergence of the alternating least squares method for rank-one approximation to generic tensors
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- TT-GMRES: solution to a linear system in the structured tensor format
- TT-cross approximation for multidimensional arrays
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor product analysis of partial difference equations
- Tensor spaces and numerical tensor calculus
- Tensor-train decomposition
- Truncated low-rank methods for solving general linear matrix equations.
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
Cited in
(18)- Identification of dominant subspaces for model reduction of structured parametric systems
- On the convergence of a greedy rank-one update algorithm for a class of linear systems
- On manifolds of tensors of fixed TT-rank
- Iterative hard thresholding for low CP-rank tensor models
- Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Robust preconditioners for multiple saddle point problems and applications to optimal control problems
- Structure and approximation properties of Laplacian-like matrices
- Black box approximation of tensors in hierarchical Tucker format
- Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product
- Solving coupled tensor equations via higher order LSQR methods
- Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
- SOTT: greedy approximation of a tensor as a sum of tensor trains
- Iterative low-rank approximation solvers for the extension method for fractional diffusion
- Tucker-3 decomposition with sparse core array using a penalty function based on Gini-index
- Low-rank approximate inverse for preconditioning tensor-structured linear systems
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- A low-rank isogeometric solver based on Tucker tensors
This page was built for publication: Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000621)
