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

Published: 07 May 2024, Last Modified: 04 May 2026CrossrefEveryoneRevisionsCC BY-SA 4.0
Abstract: On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples, by Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga. Published by EMS Press
External IDs:doi:10.4171/mems/13
Loading