Sparse Polynomial Approximation of High-Dimensional Functions
From MaRDI portal
Publication:5072541
DOI10.1137/1.9781611976885OpenAlexW4213173722MaRDI QIDQ5072541
Ben Adcock, Simone Brugiapaglia, Clayton G. Webster
Publication date: 28 April 2022
Full work available at URL: https://doi.org/10.1137/1.9781611976885
Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Approximations and expansions (41Axx)
Related Items
Nonlinear approximation in bounded orthonormal product bases ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Optimal approximation of infinite-dimensional holomorphic functions ⋮ Optimal learning ⋮ NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems ⋮ Fast and stable approximation of analytic functions from equispaced samples via polynomial frames ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ The uniform sparse FFT with application to PDEs with random coefficients ⋮ CAS4DL: Christoffel adaptive sampling for function approximation via deep learning
