Gugat M (1996)
Publication Language: English
Publication Type: Journal article, Original article
Publication year: 1996
Publisher: Springer Verlag (Germany)
Book Volume: 13
Pages Range: 107-122
Journal Issue: 1
URI: http://link.springer.com/article/10.1007/BF02143129
DOI: 10.1007/BF02143129
An algorithm for constrained rational Chebyshev approximation is introduced that combines the idea of an algorithm due to Hettich and Zencke, for which superlinear convergence is guaranteed, with the auxiliary problem used in the well-known original differential correction method. Superlinear convergence of the algorithm is proved. Numerical examples illustrate the fast convergence of the method and its advantages compared with the algorithm of Hettich and Zencke. © J.C. Baltzer AG Science Publishers.
APA:
Gugat, M. (1996). The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators. Numerical Algorithms, 13(1), 107-122. https://doi.org/10.1007/BF02143129
MLA:
Gugat, Martin. "The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators." Numerical Algorithms 13.1 (1996): 107-122.
BibTeX: Download