4-01-2026, 21:43 | view 👀:0 | 🙍 oneddl | redaktor: book24h | Rating👍:

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional [#981964]

Name: On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional
Author: book24h

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 asserts exponential or algebraic rates of convergence for holomorphic functions. There are also increasingly mature methods such as (weighted) $\ell^1$-minimization for practically computing such approximations. However, whether these methods achieve the rates of the best $s$-term approximation is not fully understood. Moreover, these methods are not algorithms per se, since they involve exact minimizers of nonlinear optimization problems. This paper closes these gaps by affirmatively answering the following question: Are there robust, efficient algorithms for computing sparse polynomial approximations to finite- or infinite-dimensional, holomorphic and Hilbert-valued functions from limited samples that achieve the same rates as the best $s$-term approximation? The authors do so by introducing algorithms with exponential or algebraic convergence rates that are also robust to sampling, algorithmic and physical discretization errors. Their results involve several developments of existing techniques, including a new restarted primal-dual iteration for solving weighted $\ell^1$-minimization problems in Hilbert spaces. Their theory is supplemented by numerical experiments demonstrating the efficacy of these algorithms.

Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me

Rapidgator
688yl.7z.html
DDownload
688yl.7z
FreeDL
688yl.7z.html
AlfaFile
688yl.7z

Links are Interchangeable - Single Extraction

⚠️ Dead Link ?
You may submit a re-upload request using the search feature. All requests are reviewed in accordance with our Content Policy.

Request Re-upload

Significant surge in the popularity of free ebook download platforms. These virtual repositories offer an unparalleled range, covering genres that span from classic literature to contemporary non-fiction, and everything in between. Enthusiasts of reading can easily indulge in their passion by accessing free books download online services, which provide instant access to a wealth of knowledge and stories without the physical constraints of space or the financial burden of purchasing hardcover editions.

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional [#981964]

Comments (0)

Log in