Calibre-Web Automated | On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples

Browse
Books
Shelves

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples

Ben Adcock & Simone Brugiapaglia & Nick Dexter & Sebastian Moraga

Language: English

best s-term approximation compressed sensing high-dimensional approximation parametric PDEs polynomial approximation

Published: May 6, 2024

Description:

mathematics