Greedy low-rank approximation in Tucker format of solutions of tensor linear systems

DOI10.1016/J.CAM.2019.03.002zbMATH Open1415.65099OpenAlexW2922332560WikidataQ128218069 ScholiaQ128218069MaRDI QIDQ2000621FDOQ2000621

C. Hofreither, I. 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

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

zbMATH Keywords

greedy algorithmstensor approximationproper generalized decompositiontensor linear systemsTucker tensors

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Iterative numerical methods for linear systems (65F10)

Cites Work

• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• TT-cross approximation for multidimensional arrays
• Hierarchical Singular Value Decomposition of Tensors
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Tensor Spaces and Numerical Tensor Calculus
• Title not available (Why is that?)
• Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
• Local convergence of the alternating least squares algorithm for canonical tensor approximation
• A literature survey of low-rank tensor approximation techniques
• Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
• Adaptive cross approximation of multivariate functions
• A new scheme for the tensor representation
• Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
• A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
• On the convergence of a greedy rank-one update algorithm for a class of linear systems
• \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
• A projection method to solve linear systems in tensor format
• Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
• Truncated low‐rank methods for solving general linear matrix equations
• Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
• Approximate iterations for structured matrices
• Efficient Computer Manipulation of Tensor Products
• An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition
• Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
• Iterative methods based on soft thresholding of hierarchical tensors
• A new convergence proof for the higher-order power method and generalizations
• Enhanced Line Search: A Novel Method to Accelerate PARAFAC
• On the Global Convergence of the Alternating Least Squares Method for Rank-One Approximation to Generic Tensors
• Tensor product analysis of partial difference equations
• TT-GMRES: solution to a linear system in the structured tensor format
• A randomized algorithm for a tensor-based generalization of the singular value decomposition
• Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
• Model Reduction and Approximation
• A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis

Cited In (13)

• Tucker-3 decomposition with sparse core array using a penalty function based on Gini-index
• Robust Preconditioners for Multiple Saddle Point Problems and Applications to Optimal Control Problems
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product
• Identification of dominant subspaces for model reduction of structured parametric systems
• Iterative hard thresholding for low CP-rank tensor models
• On manifolds of tensors of fixed TT-rank
• A low-rank isogeometric solver based on Tucker tensors
• Black box approximation of tensors in hierarchical Tucker format
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching
• Iterative low-rank approximation solvers for the extension method for fractional diffusion
• Structure and approximation properties of Laplacian-like matrices
• Solving coupled tensor equations via higher order LSQR methods

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)