Adaptive cross approximation of multivariate functions

DOI10.1007/s00365-010-9103-xzbMath1248.41049MaRDI QIDQ717119

Mario Bebendorf

Publication date: 27 September 2011

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

Full work available at URL: https://doi.org/10.1007/s00365-010-9103-x

zbMATH Keywords

data compression; dimensionality reduction; function; adaptive cross approximation (ACA)

Mathematics Subject Classification ID

41A63: Multidimensional problems

15A69: Multilinear algebra, tensor calculus

41A80: Remainders in approximation formulas

Related Items

Literature survey on low rank approximation of matrices, Numerical tensor calculus, Functional Tucker Approximation Using Chebyshev Interpolation, ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching, Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets, A Hybrid Alternating Least Squares--TT-Cross Algorithm for Parametric PDEs, Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation, Cubature, Approximation, and Isotropy in the Hypercube, Chebfun in Three Dimensions, Tensor numerical methods for multidimensional PDES: theoretical analysis and initial applications, Bridging and Improving Theoretical and Computational Electrical Impedance Tomography via Data Completion, Separation of variables for function generated high-order tensors, A note on tensor chain approximation, On the spectral problem for trivariate functions, Greedy low-rank approximation in Tucker format of solutions of tensor linear systems, Tensor train based isogeometric analysis for PDE approximation on parameter dependent geometries, Boundary element methods for the wave equation based on hierarchical matrices and adaptive cross approximation, Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case, On the error in transfinite interpolation by low-rank functions, Bivariate Hermite interpolation by a limiting case of the cross approximation algorithm, On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices, A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis, Tensor representation of non-linear models using cross approximations, A low-rank approach to the computation of path integrals, An equi-directional generalization of adaptive cross approximation for higher-order tensors, A literature survey of low-rank tensor approximation techniques, Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• TT-cross approximation for multidimensional arrays
• Best approximation by bilinear forms
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• Some additional results on principal components analysis of three-mode data by means of alternating least squares algorithms
• A family of extension operators
• Principal component analysis of three-mode data by means of alternating least squares algorithms
• The best \(L^ 2\)-approximation by finite sums of functions with separable variables
• Adaptive low-rank approximation of collocation matrices
• Approximation of boundary element matrices
• A new scheme for the tensor representation
• On approximation of functions by exponential sums
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Rank-One Approximation to High Order Tensors
• Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
• Verification of the cross 3D algorithm on quantum chemistry data
• On the efficient computation of high-dimensional integrals and the approximation by exponential sums
• Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
• A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
• Sparse grids
• Application of the three‐way decomposition for matrix compression
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
• Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
• Approximation of 1/x by exponential sums in [1, ∞)
• A Class of Statistics with Asymptotically Normal Distribution