Two simple algorithms for discrete rational approximation

DOI10.1090/S0025-5718-1970-0301894-XMaRDI QIDQ5643490zbMATH OpenFDO

Authors Ian Barrodale, J. C. Mason

Publication date 1971

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0025-5718-1970-0301894-X

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Cites work

• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• scientific article; zbMATH DE number 3295416 (Why is no real title available?)
• Norms for Smoothing and Estimation
• Rational approximation of decay-type functions
• Rational approximation of empirical functions

Cited in

(8)

• Approximation for Bessel functions and their application in the computation of Hankel transforms
• Conditions for a rational approximation to be locally best in the \(l_ 1 \)sense
• Failure of Loeb's method of rational L₁ approximation
• Discrete linearized least-squares rational approximation on the unit circle
• Minimax approximation by rational fractions of the inverse polynomial type
• The RKFIT algorithm for nonlinear rational approximation
• A convergence analysis of Lawson's iteration for computing polynomial and rational minimax approximations
• A convex dual problem for the rational minimax approximation and Lawson's iteration

This page was built for publication: Two simple algorithms for discrete rational approximation

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