Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
type: Item
instance of: scholarly article
title: Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
zbMATH Open document ID: 1415.65099
author: I. Georgieva
author: C. Hofreither
published in: Journal of Computational and Applied Mathematics
publication date: 2019-06-28T00:00:00Z
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A69
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 7074968
zbMATH Keywords: tensor approximation
zbMATH Keywords: Tucker tensors
zbMATH Keywords: greedy algorithms
zbMATH Keywords: tensor linear systems
zbMATH Keywords: proper generalized decomposition
MaRDI profile type: Publication
full work available at URL: j.cam.2019.03.002
OpenAlex ID: W2922332560
cites work: Tensor Decompositions and Applications
cites work: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
cites work: Tensor Spaces and Numerical Tensor Calculus
cites work: A new scheme for the tensor representation
cites work: Tensor-Train Decomposition
cites work: \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
cites work: Tensor product analysis of partial difference equations
cites work: Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
cites work: A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis
cites work: A literature survey of low-rank tensor approximation techniques
cites work: Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
cites work: TT-cross approximation for multidimensional arrays
cites work: A Multilinear Singular Value Decomposition
cites work: Hierarchical Singular Value Decomposition of Tensors
cites work: On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
cites work: A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
cites work: Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
cites work: Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
cites work: Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
cites work: Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
cites work: A projection method to solve linear systems in tensor format
cites work: TT-GMRES: solution to a linear system in the structured tensor format
cites work: Truncated low‐rank methods for solving general linear matrix equations
cites work: Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
cites work: Approximate iterations for structured matrices
cites work: Iterative methods based on soft thresholding of hierarchical tensors
cites work: On the convergence of a greedy rank-one update algorithm for a class of linear systems
cites work: Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
cites work: Model Reduction and Approximation
cites work: On the Global Convergence of the Alternating Least Squares Method for Rank-One Approximation to Generic Tensors
cites work: A new convergence proof for the higher-order power method and generalizations
cites work: Local convergence of the alternating least squares algorithm for canonical tensor approximation
cites work: Q4300595
cites work: Efficient Computer Manipulation of Tensor Products
cites work: An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition
cites work: Adaptive cross approximation of multivariate functions
cites work: A randomized algorithm for a tensor-based generalization of the singular value decomposition
cites work: Enhanced Line Search: A Novel Method to Accelerate PARAFAC
Wikidata QID: Q128218069
DOI: 10.1016/J.CAM.2019.03.002
description: scientific article; zbMATH DE number 7074968