Approximation With Taylor Matching At The Origin
From MaRDI portal
Publication:4454326
DOI10.1080/0020716031000087096zbMATH Open1041.41005OpenAlexW1982053266MaRDI QIDQ4454326FDOQ4454326
Authors: 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
Recommendations
heuristicbest approximationRemez algorithmmonic polynomials of least normpolynomial matching Taylor series
Cites Work
- Title not available (Why is that?)
- A Survey of Practical Rational and Polynomial Approximation of Functions
- Title not available (Why is that?)
- Best \(L^1\) approximation by weak Chebyshev systems and the uniqueness of interpolating perfect splines
- Title not available (Why is that?)
- An accurate elementary mathematical library for the IEEE floating point standard
- The limit of approximation with weights large on nodes
- Chebyshev approximation with respect to a vanishing weight function
- Alternating minimax approximation with unequal restraints
- Rational Chebyshev approximation using linear equations
- Table-driven implementation of the Expm1 function in IEEE floating-point arithmetic
- Fitting approximations with fixed components at zero
- Fitting approximations to the kuki-cody-waite form
- A note on best one-sided approximations
- Accurate evaluation of even and odd functions
- Convergence Problems in Maehly's Second Method: Part II
Cited In (2)
This page was built for publication: Approximation With Taylor Matching At The Origin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454326)
