Computer Science – Symbolic Computation
Scientific paper
2008-04-15
Dans ISSAC'08 (2008)
Computer Science
Symbolic Computation
Scientific paper
Efficient 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.
Bostan Alin
Salvy Bruno
Schost Éric
No associations
LandOfFree
Power Series Composition and Change of Basis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Power Series Composition and Change of Basis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power Series Composition and Change of Basis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-653054