Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
From MaRDI portal
Publication:2093707
DOI10.1007/s10444-022-09979-7zbMath1505.65184arXiv2107.13107OpenAlexW3183480749MaRDI QIDQ2093707
Arvind K. Saibaba, Rachel Minster, Misha E. Kilmer
Publication date: 27 October 2022
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.13107
kernel methodsrandomized algorithmsmultivariate function approximationlow-rank approximationsTucker format
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- The Chebyshev points of the first kind
- Tensor numerical methods in scientific computing
- Grid-based lattice summation of electrostatic potentials by assembled rank-structured tensor approximation
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Grid-based electronic structure calculations: the tensor decomposition approach
- Recompression techniques for adaptive cross approximation
- The many proofs of an identity on the norm of oblique projections
- The black-box fast multipole method
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Introduction to hierarchical matrices with applications.
- Chebyshev interpolation for parametric option pricing
- A tensor-train accelerated solver for integral equations in complex geometries
- Application of the inverse fast multipole method as a preconditioner in a 3D Helmholtz boundary element method
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A continuous analogue of the tensor-train decomposition
- Prospects of tensor-based numerical modeling of the collective electrostatics in many-particle systems
- Tucker tensor analysis of Matérn functions in spatial statistics
- Tensor Numerical Methods in Quantum Chemistry
- Spectral Tensor-Train Decomposition
- A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices
- Hierarchical Matrices: Algorithms and Analysis
- Fast algorithms for hierarchically semiseparable matrices
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- A Multilinear Singular Value Decomposition
- A randomized tensor singular value decomposition based on the t‐product
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
- Range-Separated Tensor Format for Many-Particle Modeling
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Functional Tucker Approximation Using Chebyshev Interpolation
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- Analytical Low-Rank Compression via Proxy Point Selection
- Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation
- Sparse grids
- Multivariate polynomial approximation in the hypercube
- Chebfun in Three Dimensions
- The Fast Gauss Transform
- A fast algorithm for particle simulations
This page was built for publication: Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions