International audienceWe will review the recent development of rational approximation in one and several real and complex variables. The concept rational approximation is closely related to greedy algorithms, based on a dictionary consisting of Szeg˝ o kernels in the present context
Greedy expansions with prescribed coefficients have been introduced by V. N. Temlyakov in the frame ...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N...
International audienceWe will review the recent development of rational approximation in one and sev...
Author files.International audienceComputing rational minimax approximations can be very challenging...
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
AbstractOur goal is to survey, using three examples, how high-precision computations have stimulated...
AbstractIn this article, we continue to study the performance of Greedy Algorithms. We show that the...
We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While...
AbstractOur objective is to study nonlinear approximation with regard to redundant systems. Redundan...
Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a fixed function $f$ in a certain...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
One central question in theoretical computer science is how to solve problems accurately and quickly...
AbstractWe study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach ...
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes c...
Greedy expansions with prescribed coefficients have been introduced by V. N. Temlyakov in the frame ...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N...
International audienceWe will review the recent development of rational approximation in one and sev...
Author files.International audienceComputing rational minimax approximations can be very challenging...
AbstractA basis for a Banach space X is greedy if and only if the greedy algorithm provides, up to a...
AbstractOur goal is to survey, using three examples, how high-precision computations have stimulated...
AbstractIn this article, we continue to study the performance of Greedy Algorithms. We show that the...
We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While...
AbstractOur objective is to study nonlinear approximation with regard to redundant systems. Redundan...
Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a fixed function $f$ in a certain...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
One central question in theoretical computer science is how to solve problems accurately and quickly...
AbstractWe study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach ...
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes c...
Greedy expansions with prescribed coefficients have been introduced by V. N. Temlyakov in the frame ...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N...
DOI
Add to ORKG