International audienceA Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the numerator of a fraction of linear recurrence operators. This interpretation lets us give a simple view of previous algorithms, analyze their complexity, and design a faster one for large orders
A computational method based on Chebyshev series to rigorously compute solutions of initial and boun...
AbstractWe present algorithms that (a) reduce an algebraic equation, defining an algebraic function,...
Chebyshev polynomials are used to obtain accurate numerical solutions of ordinary and partial differ...
A Chebyshev series is an expansion in the basis of Chebyshev polynomials of the first kind. These se...
A Chebyshev series is an expansion in the basis of Chebyshev polynomials of the first kind. These se...
Une série de Tchebychev est un développement dans la base des polynômes de Tchebychev. Ces séries so...
The first part of this thesis deals with the manipulation of orthogonal series with computer algebra...
Abstract. A wide range of numerical methods exists for computing polyno-mial approximations of solut...
International audienceA wide range of numerical methods exists for computing polynomial approximatio...
International audienceA wide range of numerical methods exists for computing polynomial approximatio...
The asymptotic iteration method is used in order to solve the Chebyshev differential equations, and ...
The purpose of this paper is to investigate the use of rational Chebyshev (RC) functions for solving...
Laurent Padé–Chebyshev rational approximants, A m (z,z –1)/B n (z,z –1), whose Laurent series expans...
International audienceIn this work we develop a validated numerics method for the solution of linear...
A Chebyshev collocation method, an expansion method, has been proposed in order to solve the systems...
A computational method based on Chebyshev series to rigorously compute solutions of initial and boun...
AbstractWe present algorithms that (a) reduce an algebraic equation, defining an algebraic function,...
Chebyshev polynomials are used to obtain accurate numerical solutions of ordinary and partial differ...
A Chebyshev series is an expansion in the basis of Chebyshev polynomials of the first kind. These se...
A Chebyshev series is an expansion in the basis of Chebyshev polynomials of the first kind. These se...
Une série de Tchebychev est un développement dans la base des polynômes de Tchebychev. Ces séries so...
The first part of this thesis deals with the manipulation of orthogonal series with computer algebra...
Abstract. A wide range of numerical methods exists for computing polyno-mial approximations of solut...
International audienceA wide range of numerical methods exists for computing polynomial approximatio...
International audienceA wide range of numerical methods exists for computing polynomial approximatio...
The asymptotic iteration method is used in order to solve the Chebyshev differential equations, and ...
The purpose of this paper is to investigate the use of rational Chebyshev (RC) functions for solving...
Laurent Padé–Chebyshev rational approximants, A m (z,z –1)/B n (z,z –1), whose Laurent series expans...
International audienceIn this work we develop a validated numerics method for the solution of linear...
A Chebyshev collocation method, an expansion method, has been proposed in order to solve the systems...
A computational method based on Chebyshev series to rigorously compute solutions of initial and boun...
AbstractWe present algorithms that (a) reduce an algebraic equation, defining an algebraic function,...
Chebyshev polynomials are used to obtain accurate numerical solutions of ordinary and partial differ...