Skip to main navigation Skip to search Skip to main content

Fast computation of power series solutions of systems of differential equations

  • A. Bostan
  • , F. Chyzak
  • , F. Ollivier
  • , B. Salvy
  • , Schost
  • , A. Sedoglavic
  • INRIA Rocquencourt
  • Laboratoire d'Informatique (LIX)
  • Université de Lille

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations that is quasi-linear with respect to N. Similar results are also given in the nonlinear case. This extends previous results obtained by Brent and Kung for scalar differential equations of order 1 and 2.

Original languageEnglish
Title of host publicationProceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
PublisherAssociation for Computing Machinery
Pages1012-1021
Number of pages10
ISBN (Electronic)9780898716245
Publication statusPublished - 1 Jan 2007
Event18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, United States
Duration: 7 Jan 20079 Jan 2007

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume07-09-January-2007

Conference

Conference18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
Country/TerritoryUnited States
CityNew Orleans
Period7/01/079/01/07

Fingerprint

Dive into the research topics of 'Fast computation of power series solutions of systems of differential equations'. Together they form a unique fingerprint.

Cite this