Add to ORKGInternational audienceEfficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed efficiently. We deduce fast algorithms for converting polynomials between various bases, including Euler, Bernoulli, Fibonacci, and the orthogonal Laguerre, Hermite, Jacobi, Krawtchouk, Meixner and Meixner-Pollaczek
The classical algorithms require order n 3 operations to compute the first n terms in the reversion ...
A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, ov...
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...
International audienceEfficient algorithms are known for many operations on truncated power series (...
Modular composition is the problem to compose two univariate polynomials modulo a third one. For pol...
Submitted to Journal DMTCSWe revisit a divide-and-conquer algorithm, originally described by Brent a...
Let f and g be two convergent power series in R[[z]] or C[[z]], whose first n terms are given numeri...
AbstractThe composition problem for univariate complex power series P, Q (i.e., the computation of t...
International audienceAs was initially shown by Brent, exponentials of truncated power series can be...
Let F(x) = f1x + f2(x)(x) + . . . be a formal power series over a field Delta. Let F superscript 0(x...
AbstractThis paper reports on the development of compact and remarkably general algorithms for the m...
International audienceWe formalize an algorithm to change the representation of a polynomial to a Ne...
We propose fast algorithms for computing composed products and composed sums, as well as diamond pro...
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversio...
AbstractWe discuss efficient conversion algorithms for orthogonal polynomials. We describe a known c...
The classical algorithms require order n 3 operations to compute the first n terms in the reversion ...
A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, ov...
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...
International audienceEfficient algorithms are known for many operations on truncated power series (...
Modular composition is the problem to compose two univariate polynomials modulo a third one. For pol...
Submitted to Journal DMTCSWe revisit a divide-and-conquer algorithm, originally described by Brent a...
Let f and g be two convergent power series in R[[z]] or C[[z]], whose first n terms are given numeri...
AbstractThe composition problem for univariate complex power series P, Q (i.e., the computation of t...
International audienceAs was initially shown by Brent, exponentials of truncated power series can be...
Let F(x) = f1x + f2(x)(x) + . . . be a formal power series over a field Delta. Let F superscript 0(x...
AbstractThis paper reports on the development of compact and remarkably general algorithms for the m...
International audienceWe formalize an algorithm to change the representation of a polynomial to a Ne...
We propose fast algorithms for computing composed products and composed sums, as well as diamond pro...
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversio...
AbstractWe discuss efficient conversion algorithms for orthogonal polynomials. We describe a known c...
The classical algorithms require order n 3 operations to compute the first n terms in the reversion ...
A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, ov...
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...