About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Kálovics, Ferenc
A fast iteration for uniform approximation. (English). Aplikace matematiky, vol. 33 (1988), issue 4, pp. 269-276
MSC: 41A50, 49D35, 65D15 | MR 0949248 | Zbl 0664.65013 | DOI: 10.21136/AM.1988.104308
Keywords:
Chebyshev system; extremal points; iterative algorithm; Chebyshev approximations; numerical examples; $Q$-order of a convergent iterative method
Summary:
The paper gives such an iterative method for special Chebyshev approxiamtions that its order of convergence is $\geq 2$. Somewhat comparable results are found in [1] and [2], based on another idea.
References:
[1] K. Glasshoff S. A. Gustafson: Linear Optimization and Approximation. Springer-Verlag, New York, 1983. MR 0697234
[2] F. Kálovics: An agorithm for best Chebyshev approxmations. Annales. Univ. Sci. Budapestinensis, Sectio Computatorica, 6(1985), 19-25. MR 0915220
[3] J. M. Ortega W. C. Rheinboldt: Iterative Solutions of Nonlinear Equations in Several Variables. Academic Press, New York, 1970. MR 0273810
Partner of
EuDML logo