AbstractIn this paper, we introduce a general parallel algorithm for the evaluation of Chebyshev and trigonometric series. The algorithm is based on a recurrence property that allows the effective implementation on partial sums that can be calculated independently. Several examples, carried out on a Cray T3D, are provided comparing the Forsythe and Clenshaw parallel algorithm
A parallel algorithm of a numeric procedure based on a method of trigonometric collocation is presen...
Nous proposons des méthodes simples et efficaces pour manipuler des expressions trigonométriques de ...
AbstractStable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebysh...
AbstractIn this paper, we present rounding error bounds of recent parallel versions of Forsythe's an...
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
A Chebyshev series is an expansion in the basis of Chebyshev polynomials of the first kind. These se...
AbstractThe application of the recent techniques of the design of algebraic algorithms to the sequen...
ABSTR&CT. The parallel evaluation of rational expressions i considered. New algorithms which min...
AbstractFrequently, one needs to evaluate expressions of the form [p(A)]−1q(A)b, where A ∈ RN × N, b...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fa...
International audienceA Chebyshev expansion is a series in the basis of Chebyshev polynomials of the...
The first part of this thesis deals with the manipulation of orthogonal series with computer algebra...
AbstractIn recent years, good algorithms have been developed for finding the zeros of trigonometric ...
International audienceIn approximation theory, it is standard to approximate functions by polynomial...
A parallel algorithm of a numeric procedure based on a method of trigonometric collocation is presen...
Nous proposons des méthodes simples et efficaces pour manipuler des expressions trigonométriques de ...
AbstractStable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebysh...
AbstractIn this paper, we present rounding error bounds of recent parallel versions of Forsythe's an...
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
A Chebyshev series is an expansion in the basis of Chebyshev polynomials of the first kind. These se...
AbstractThe application of the recent techniques of the design of algebraic algorithms to the sequen...
ABSTR&CT. The parallel evaluation of rational expressions i considered. New algorithms which min...
AbstractFrequently, one needs to evaluate expressions of the form [p(A)]−1q(A)b, where A ∈ RN × N, b...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fa...
International audienceA Chebyshev expansion is a series in the basis of Chebyshev polynomials of the...
The first part of this thesis deals with the manipulation of orthogonal series with computer algebra...
AbstractIn recent years, good algorithms have been developed for finding the zeros of trigonometric ...
International audienceIn approximation theory, it is standard to approximate functions by polynomial...
A parallel algorithm of a numeric procedure based on a method of trigonometric collocation is presen...
Nous proposons des méthodes simples et efficaces pour manipuler des expressions trigonométriques de ...
AbstractStable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebysh...
DOI
Add to ORKG