Approximation With Taylor Matching At The Origin

DOI10.1080/0020716031000087096zbMath1041.41005OpenAlexW1982053266MaRDI QIDQ4454326

Charles B. Dunham

Publication date: 8 March 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716031000087096

zbMATH Keywords

best approximationheuristicRemez algorithmmonic polynomials of least normpolynomial matching Taylor series

Mathematics Subject Classification ID

Approximation by polynomials (41A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The limit of approximation with weights large on nodes
• Chebyshev approximation with respect to a vanishing weight function
• Best \(L^1\) approximation by weak Chebyshev systems and the uniqueness of interpolating perfect splines
• Alternating minimax approximation with unequal restraints
• Rational Chebyshev approximation using linear equations
• Fitting approximations to the kuki-cody-waite form
• A note on best one-sided approximations
• Fitting approximations with fixed components at zero
• An accurate elementary mathematical library for the IEEE floating point standard
• Table-driven implementation of the Expm1 function in IEEE floating-point arithmetic
• Accurate evaluation of even and odd functions
• Convergence Problems in Maehly's Second Method: Part II
• A Survey of Practical Rational and Polynomial Approximation of Functions