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...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Electronic eBook |
Language: | English |
Published: |
Berlin :
EMS Press,
2024.
|
Subjects: | |
Online Access: | CONNECT |