RIGOROUS UNIFORM APPROXIMATION OF D-FINITE FUNCTIONS USING CHEBYSHEV EXPANSIONS ALEXANDRE BENOIT, MIOARA JOLDES, AND MARC MEZZAROBBA Abstract. A wide range of numerical methods exists for computing polynomial approximati

First Page		Document Content
Date: 2014-07-11 07:39:27 Algebra Orthogonal polynomials Elementary algebra Numerical analysis Approximation theory Chebyshev polynomials Polynomial Recurrence relation Holonomic function Minimax approximation algorithm Rational function Factorization		RIGOROUS UNIFORM APPROXIMATION OF D-FINITE FUNCTIONS USING CHEBYSHEV EXPANSIONS ALEXANDRE BENOIT, MIOARA JOLDES, AND MARC MEZZAROBBA Abstract. A wide range of numerical methods exists for computing polynomial approximati Add to Reading List Source URL: www.marc.mezzarobba.net Download Document from Source Website File Size: 829,86 KB Share Document on Facebook

	Orthogonal Polynomials and Spectral Algorithms Nisheeth K. Vishnoi 1.0 d=0 DocID: 1uxDb - View Document
	Matrix Valued Orthogonal Polynomials for Gelfand Pairs of Rank One Gert Heckman and Maarten van Pruijssen Radboud University Nijmegen October 18, 2013 Abstract DocID: 1tQah - View Document
	Fast Conversion Algorithms for Orthogonal Polynomials Alin Bostan Bruno Salvy DocID: 1setv - View Document
	Asymptotics for Orthogonal Polynomials, Exponentially Small Perturbations and Meromorphic Continuations of Herglotz Functions Thesis by DocID: 1rNRs - View Document
	On polynomials attached to curves F. Morain Laboratoire d’Informatique de l’École polytechnique logoUW ECOL E DocID: 1rsJK - View Document