Pages that link to "Item:Q873149"
From MaRDI portal
The following pages link to A new efficient algorithm for polynomial interpolation (Q873149):
Displaying 14 items.
- A comparison of algorithms for polynomial interpolation (Q1169244) (← links)
- Reliable determination of interpolating polynomials (Q1315195) (← links)
- Iterative polynomial interpolation and data compression (Q1315197) (← links)
- Recursive polynomial interpolation algorithm (RPIA) (Q1681774) (← links)
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions (Q2002783) (← links)
- Advanced algorithm for interpolation with Wendland functions (Q2101847) (← links)
- Backward and forward stability analysis of Neville's algorithm for interpolation and a pyramid algorithm for the computation of Lebesgue functions (Q2118949) (← links)
- Rounding error analysis of divided differences schemes: Newton's divided differences; Neville's algorithm; Richardson extrapolation; Romberg quadrature; etc. (Q2200797) (← links)
- (Q3563421) (← links)
- Fast and stable contour integration for high order divided differences via elliptic functions (Q5179224) (← links)
- Constructing New Time Integrators Using Interpolating Polynomials (Q5238762) (← links)
- Efficient Interpolation in the Guruswami–Sudan Algorithm (Q5281295) (← links)
- (Q5425133) (← links)
- (Q6167819) (← links)