An algorithm for Chebyshev approximation by rationals with constrained denominators (Q1922536): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Q1176007 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Wolfgang W. Breckner / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new algorithms for rational approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The differential correction algorithm for generalized rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for generalized fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Remarks on the Differential Correction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev approximation by rationals with constrained denominators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for General Restricted Rational Chebyshev Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform approximation by rational functions having restricted denominators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Algorithms for Rational l ∞ Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directional derivatives for the value-function in semi-infinite programming / rank
 
Normal rank

Latest revision as of 13:20, 24 May 2024

scientific article
Language Label Description Also known as
English
An algorithm for Chebyshev approximation by rationals with constrained denominators
scientific article

    Statements

    An algorithm for Chebyshev approximation by rationals with constrained denominators (English)
    0 references
    0 references
    18 May 1998
    0 references
    Let \(B\) be a compact Hausdorff space, and let \(C(B)\) be the space of all continuous real-valued functions on \(B\). Further it is assumed that: (i) \(\mu\) and \(\nu\) are fixed elements of \(C(B)\) such that \(0<\mu\leq\nu\); (ii) \(Z\) is a nonempty closed subset of \(\mathbb{R}^n\); (iii) \(V\) and \(W\) are continuous maps of \(\mathbb{R}^n\) into \(C(B)\); (iv) \({\mathcal H}\) is a continuous map of \(C(B)\times C(B)\) into \(C(B)\). Based on these data the author proposes a modified differential correction algorithm for determining the value \(\inf_{z\in F} \sup_{t\in B}f(z)(t)\), where \(F:= \{z\in\mathbb{Z}: \mu\leq W(z)\leq\nu\}\) and \(f(z):= {\mathcal H}(V(z),W(z))/ W(z)\). The discussion of this algorithm is completed by convergence results and numerical examples. Finally, it should be mentioned that the algorithm described in the present paper has some advantages in comparison with the original differential correction algorithm.
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references