Adaptive monotone rational approximation on finite sets

DOI10.1023/A:1022268319273MaRDI QIDQ1870260zbMATH OpenOpenAlexFDO

Authors Edwin H. jun. Kaufman, D. J. Leeming, G. D. (Jerry) Taylor

Publication date 11 May 2003

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022268319273

zbMATH Keywords

Chebyshev approximationdata fittingmonotone approximationrational approximation

Mathematics Subject Classification ID

Approximation by rational functions (41A20)

Review text

The problem of uniform approximation on a finite set of real numbers by rational functions whose first derivative is required to be positive (negative) and denominator is required to be positive on the smallest interval containing the points is considered. An earlier nonadaptive computational code is now extended to the present adaptive code by coupling it with a positivity checker for polynomials on intervals developed herein. This new code allows for an intelligent selection of additional constraining points beyond the initial data points to enforce monotonicity preserving pole free fits to monotone data sets. In addition, it also provides the option of enforcing pole-free fits while ignoring monotonicity.

Recommendations

• scientific article; zbMATH DE number 16799
• On monotone rational approximation: A new approach, II
• scientific article; zbMATH DE number 3857661
• scientific article; zbMATH DE number 4097962
• scientific article; zbMATH DE number 4000648

Cited in

(1)

• na21

Describes a project that uses

Uses Software

• CDFCOR

This page was built for publication: Adaptive monotone rational approximation on finite sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870260)