Pages that link to "Item:Q918113"

The following pages link to Fast evaluation and interpolation at the Chebyshev sets of points (Q918113):

Displaying 14 items.

• Reusing Chebyshev points for polynomial interpolation (Q747725) (← links)
• New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set (Q1129510) (← links)
• A Chebychev-Vandermonde solver (Q1194520) (← links)
• A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid (Q1206566) (← links)
• A new approach to fast polynomial interpolation and multipoint evaluation (Q1802447) (← links)
• An algebraic approach to approximate evaluation of a polynomial on a set of real points (Q1899278) (← links)
• Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
• On computing the degree of a Chebyshev polynomial from its value (Q2229707) (← links)
• The spectral connection matrix for classical orthogonal polynomials of a single parameter (Q2250925) (← links)
• The spectral connection matrix for any change of basis within the classical real orthogonal polynomials (Q2352950) (← links)
• Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
• Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts (Q2985840) (← links)
• Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F <i> _P ^r </i> (Q5145994) (← links)
• A fast iterative method for determining the stability of a polynomial (Q5961644) (← links)