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...

Descripción completa

Detalles Bibliográficos

Autor principal:	Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga
Formato:	Libro
Publicado:	European Mathematical Society Publishing House 2024
Materias:	Characteristic functions Approximation theory Polynomials
Acceso en línea:	Ver este registro en EBSCOhost