minimaxApprox

MaRDI QIDQ5976456CRANFDO

Authors Avraham Adler

Last update 17 July 2026

Copyright license Mozilla Public License, version 2.0

Software version identifier 0.0.1, 0.0.2, 0.1.0, 0.2.0, 0.2.1, 0.2.2, 0.3.0, 0.4.0, PACKAGES.rds, 0.4.1, 0.4.2, 0.4.3, 0.5.0, 0.6.0

Description

Implements minimax approximation of functions via the Remez (1962) algorithm for polynomials and the Cody-Fraser-Hart (1968) <doi:10.1007/BF02162506> algorithm for rational functions, as well as their barycentric formulations: the Pachón-Trefethen (2009) <doi:10.1007/s10543-009-0240-1> algorithm for polynomials and the Filip-Nakatsukasa-Trefethen-Beckermann (2018) <doi:10.1137/17M1132409> algorithm for rational functions, which provide improved numerical stability at higher degrees and on wider intervals.

Cites work

• Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
• Rational Chebyshev approximation using linear equations
• Rational minimax approximation via adaptive barycentric representations

This page was built for software: minimaxApprox