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
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
In the approximation theory we are commonly interested in finding a best possible approximant to a f...
Sparse representations of a function is a very powerful tool to analyze and approximate the function...
International audienceWe will review the recent development of rational approximation in one and sev...
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes c...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
One central question in theoretical computer science is how to solve problems accurately and quickly...
This book systematically presents recent fundamental results on greedy approximation with respect to...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
Each chapter comprises a separate study on some optimization problem giving both an introductory loo...
published_or_final_versionComputer Science and Information SystemsMasterMaster of Philosoph
A rational approximation (that is, approximation by a ratio of two polynomials) is a flexible altern...
We introduce a new algorithm for approximation by rational functions on a real interval or a set in ...
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optim...
This dissertation concerns estimates on the size of sets that have small coherence among the element...
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
In the approximation theory we are commonly interested in finding a best possible approximant to a f...
Sparse representations of a function is a very powerful tool to analyze and approximate the function...
International audienceWe will review the recent development of rational approximation in one and sev...
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes c...
Approximation theory studies the process of approaching arbitrary functions by simple func-tions dep...
One central question in theoretical computer science is how to solve problems accurately and quickly...
This book systematically presents recent fundamental results on greedy approximation with respect to...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
Each chapter comprises a separate study on some optimization problem giving both an introductory loo...
published_or_final_versionComputer Science and Information SystemsMasterMaster of Philosoph
A rational approximation (that is, approximation by a ratio of two polynomials) is a flexible altern...
We introduce a new algorithm for approximation by rational functions on a real interval or a set in ...
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optim...
This dissertation concerns estimates on the size of sets that have small coherence among the element...
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
In the approximation theory we are commonly interested in finding a best possible approximant to a f...
Sparse representations of a function is a very powerful tool to analyze and approximate the function...
DOI
Add to ORKG