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

Sparse polynomial approximation is an important tool for approximating high-dimensional functions from limited samples – a task commonly arising in computational science and engineering. Yet, it lacks a complete theory. There is a well-developed theory of best s-term polynomial approximation, which...

Full description

Bibliographic Details

Main Author:	Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga
Format:	Book
Published:	European Mathematical Society Publishing House 2024
Subjects:	Characteristic functions Approximation theory Polynomials
Online Access:	View this record in EBSCOhost