DCR2: An Improved Algorithm for l¶ Rational Approximation on Intervals.
D. Belogus, N. Liron (1978/79)
Numerische Mathematik
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Hornecker's algorithm for rational approximation (*)”
DCR2: An Improved Algorithm for l¶ Rational Approximation on Intervals.
An Algorithm for Segment Approximation.
H. Strauß, G. Nürnberger, M. Sommer (1986)
Numerische Mathematik
Similarity:
Two new algorithms for rational approximation.
E.W. CHENEY, H.L. LOEB (1961)
Numerische Mathematik
Similarity:
Some applications of the theorem on rational approximation in the mean
M. Skwarczyński (1976)
Annales Polonici Mathematici
Similarity:
Approximating poles of complex rational functions.
Lócsi, Levente (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
A parallel algorithm for discrete least squares rational approximation.
Marc Van Barel, Adhemar Bultheel (1992)
Numerische Mathematik
Similarity:
Implementation of the gmr algorithm for large symmetric eigenproblems
J. Kuczyński (1988)
Applicationes Mathematicae
Similarity:
The high-precision summation of series whose terms are rational numbers
W. Szafrański (1983)
Applicationes Mathematicae
Similarity:
Erratum to the paper "On the Kaczmarz algorithm of approximation in infinite-dimensional spaces" (Studia Math. 148 (2001), 75-86)
Stanisław Kwapień, Jan Mycielski (2006)
Studia Mathematica
Similarity:
Modifications of the continuation method for the solution of systems of nonlinear equations.
Lindfield, G.R., Simpson, D.C. (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Characteristic Properties of the Segmented Rational Minmax Approximation Problem .
C.L. LAWSON (1964)
Numerische Mathematik
Similarity:
Algorithm 10. Determination of the best polynomial in the sense of uniform approximation by the second algorithm of Remez
S. Paszkowski (1971)
Applicationes Mathematicae
Similarity:
Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Li, Keqin (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Investigation of the algorithms determining the optimum rational function of the ADI-method
Krystyna Ziętak (1974)
Applicationes Mathematicae
Similarity:
Greedy Algorithms for Adaptive Approximation
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...