Black box low tensor-rank approximation using fiber-crosses

DOI10.1007/S00365-009-9076-9zbMath1181.65064OpenAlexW1970942811MaRDI QIDQ843731

Mike Espig, Lars Grasedyck, Wolfgang Hackbusch

Publication date: 15 January 2010

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-009-9076-9

zbMATH Keywords

Newton's methodminimization problemblack box type algorithmfiber-crosseslow rank tensor approximation

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69)

Related Items (18)

Low-rank tensor reconstruction of concentrated densities with application to Bayesian inversion ⋮ Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats ⋮ Black box approximation of tensors in hierarchical Tucker format ⋮ Variational calculus with sums of elementary tensors of fixed rank ⋮ Constructive representation of functions in low-rank tensor formats ⋮ Generalized cross approximation for 3D-tensors ⋮ Fast evaluation of singular BEM integrals based on tensor approximations ⋮ Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats ⋮ Fast truncation of mode ranks for bilinear tensor operations ⋮ A note on tensor chain approximation ⋮ A new scheme for the tensor representation ⋮ Numerical tensor calculus ⋮ HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation ⋮ A Hybrid Alternating Least Squares--TT-Cross Algorithm for Parametric PDEs ⋮ Iterative algorithms for the post-processing of high-dimensional data ⋮ Tensor representation of non-linear models using cross approximations ⋮ Valuation of Structured Financial Products by Adaptive Multiwavelet Methods in High Dimensions ⋮ A literature survey of low-rank tensor approximation techniques

Cites Work

• Kruskal's polynomial for \(2 \times{}2 \times{}2\) arrays and a generalization to \(2 \times{}n \times{}n\) arrays
• Regression with qualitative and quantitative variables: An alternating least squares method with optimal scaling features
• Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
• Hybrid cross approximation of integral operators
• Orthogonal Tensor Decompositions
• Rank-One Approximation to High Order Tensors
• Verification of the cross 3D algorithm on quantum chemistry data
• Multivariate Regression and Machine Learning with Sums of Separable Functions
• Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
• A Multilinear Singular Value Decomposition
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
• Algorithms for Numerical Analysis in High Dimensions

This page was built for publication: Black box low tensor-rank approximation using fiber-crosses