Computer Science – Symbolic Computation
Scientific paper
2006-04-25
Dans 2007 ACM-SIAM Symposium on Discrete Algorithms (2007) 1012--1021
Computer Science
Symbolic Computation
Scientific paper
We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is quasi-linear with respect to N. Similar results are also given in the non-linear case. This extends previous results obtained by Brent and Kung for scalar differential equations of order one and two.
Bostan Alin
Chyzak Frédéric
Ollivier François
Salvy Bruno
Schost Éric
No associations
LandOfFree
Fast computation of power series solutions of systems of differential equations 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 Fast computation of power series solutions of systems of differential equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast computation of power series solutions of systems of differential equations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-433226