faug July 12, 2011

First Page		Document Content
Date: 2011-07-12 08:41:49 Numerical integration Interpolation Polynomials Approximation theory Clenshaw–Curtis quadrature Gaussian quadrature Chebyshev polynomials Polynomial interpolation Polynomial Mathematical analysis Mathematics Numerical analysis		faug July 12, 2011 Add to Reading List Source URL: people.maths.ox.ac.uk Download Document from Source Website File Size: 633,91 KB Share Document on Facebook

	ON AN EXTREMAL PROPERTY OF CHEBYSHEV POLYNOMIALS Eugene Remes Given a closed interval S = [a, b] of length ℓ = b − a, and two positive numbers λ = θℓ, 0 < θ < 1, and 0 < κ, we consider the following problem1 : DocID: 1uvT2 - View Document
	Contents 1. Introduction 2. Chebyshev Points and Interpolants 3. Chebyshev Polynomials and Series 4. Interpolants, Projections, and Aliasing DocID: 1t82Y - View Document
	Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis Daniel Kressner∗ Jose E. Roman† DocID: 1rx7m - View Document
	Generating Function and a Rodrigues Formula for the Polynomials in d–Dimensional Semiclassical Wave Packets George A. Hagedorn∗ Department of Mathematics and Center for Statistical Mechanics and Mathematical Physics DocID: 1rj95 - View Document
	COMPUTING COMPLEX SINGULARITIES OF DIFFERENTIAL EQUATIONS WITH CHEBFUN AUTHOR: MARCUS WEBB∗ AND ADVISOR: LLOYD N. TREFETHEN† Abstract. Given a solution to an ordinary differential equation (ODE) on a time interval, t DocID: 1riMJ - View Document