Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
From MaRDI portal
Publication:2000621
DOI10.1016/j.cam.2019.03.002zbMath1415.65099OpenAlexW2922332560WikidataQ128218069 ScholiaQ128218069MaRDI QIDQ2000621
Clemens Hofreither, Irina Georgieva
Publication date: 28 June 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2019.03.002
greedy algorithmsproper generalized decompositiontensor approximationtensor linear systemsTucker tensors
Related Items (8)
Solving coupled tensor equations via higher order LSQR methods ⋮ Iterative hard thresholding for low CP-rank tensor models ⋮ Iterative low-rank approximation solvers for the extension method for fractional diffusion ⋮ Structure and approximation properties of Laplacian-like matrices ⋮ A low-rank isogeometric solver based on Tucker tensors ⋮ Robust Preconditioners for Multiple Saddle Point Problems and Applications to Optimal Control Problems ⋮ Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- TT-cross approximation for multidimensional arrays
- On the convergence of a greedy rank-one update algorithm for a class of linear systems
- Adaptive cross approximation of multivariate functions
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- Approximate iterations for structured matrices
- Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
- A new scheme for the tensor representation
- A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis
- Iterative methods based on soft thresholding of hierarchical tensors
- A literature survey of low-rank tensor approximation techniques
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- On the Global Convergence of the Alternating Least Squares Method for Rank-One Approximation to Generic Tensors
- Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
- A new convergence proof for the higher-order power method and generalizations
- Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
- Hierarchical Singular Value Decomposition of Tensors
- Tensor Spaces and Numerical Tensor Calculus
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Truncated low‐rank methods for solving general linear matrix equations
- A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
- Efficient Computer Manipulation of Tensor Products
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Model Reduction and Approximation
- An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition
- TT-GMRES: solution to a linear system in the structured tensor format
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Tensor product analysis of partial difference equations
- A projection method to solve linear systems in tensor format
This page was built for publication: Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
