DCR2: An Improved Algorithm for l¶ Rational Approximation on Intervals.
D. Belogus, N. Liron (1978/79)
Numerische Mathematik
Similarity:
D. Belogus, N. Liron (1978/79)
Numerische Mathematik
Similarity:
H. Strauß, G. Nürnberger, M. Sommer (1986)
Numerische Mathematik
Similarity:
E.W. CHENEY, H.L. LOEB (1961)
Numerische Mathematik
Similarity:
M. Skwarczyński (1976)
Annales Polonici Mathematici
Similarity:
Lócsi, Levente (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Marc Van Barel, Adhemar Bultheel (1992)
Numerische Mathematik
Similarity:
J. Kuczyński (1988)
Applicationes Mathematicae
Similarity:
W. Szafrański (1983)
Applicationes Mathematicae
Similarity:
Stanisław Kwapień, Jan Mycielski (2006)
Studia Mathematica
Similarity:
Lindfield, G.R., Simpson, D.C. (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
C.L. LAWSON (1964)
Numerische Mathematik
Similarity:
S. Paszkowski (1971)
Applicationes Mathematicae
Similarity:
Li, Keqin (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Krystyna Ziętak (1974)
Applicationes Mathematicae
Similarity:
Albert Cohen (2009)
Bollettino dell'Unione Matematica Italiana
Similarity:
We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number...