scientific article; zbMATH DE number 3857661
[For the entire collection see Zbl 0533.00014.] The theory and solution of the unrestricted discrete rational Chebyshev approximation in which there is no restriction on the denominator of the best rational approximation is treated. In general, an unrestricted best approximation has poles between the data points. It is shown that the unrestricted problem is composed of a finite number of restricted problems where each restricted problem is to find the best rational approximation whose denominator is sign restricted. The well-known theory for the special restriction requiring the denominator be positive on the data is extended with nominal change to any sign restricted problem and includes results on existence, uniqueness, characterization by alternation, continuity, strict quasi-convexity, and the differential correction algorithm.
- Restrictive Chebyshev rational approximation and applications to heat-conduction problems.
- Adaptive monotone rational approximation on finite sets
- scientific article; zbMATH DE number 3859676 (Why is no real title available?)
- An Algorithm for General Restricted Rational Chebyshev Approximation
- Discrete Chebyshev Approximation by Interpolating Rationals
- scientific article; zbMATH DE number 3971388 (Why is no real title available?)
- scientific article; zbMATH DE number 3979693 (Why is no real title available?)
- scientific article; zbMATH DE number 4097962 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3326192)