An Algorithm for Chebyshev Approximation by Rationals with Constrained Denominators

Gugat M (1996)


Publication Language: English

Publication Type: Journal article, Original article

Publication year: 1996

Journal

Publisher: Springer Verlag (Germany)

Book Volume: 12

Pages Range: 197-221

Journal Issue: 2

DOI: 10.1007/s003659900010

Abstract

The problem of rational approximation is facilitated by introducing both lower and upper bounds on the denominators. For a general fractional inf-sup problem with constrained denominators, a differential correction algorithm and convergence results are given. Numerical examples are presented. The proposed algorithm has certain advantages compared with the original differential correction method: not only upper but also lower bounds for the optimal value are computed, linear convergence is always guaranteed, and due to a different start convergence is more rapid.

Authors with CRIS profile

How to cite

APA:

Gugat, M. (1996). An Algorithm for Chebyshev Approximation by Rationals with Constrained Denominators. Constructive Approximation, 12(2), 197-221. https://doi.org/10.1007/s003659900010

MLA:

Gugat, Martin. "An Algorithm for Chebyshev Approximation by Rationals with Constrained Denominators." Constructive Approximation 12.2 (1996): 197-221.

BibTeX: Download