Fast computation of power series solutions of systems of differential equations
Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic
Abstract
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.
Create a lesson
Related papers
StabQ: Quantum Program Analysis via Weighted Stabilizer Representations
Shangzhou Xia, Junjie Luo, Jianjun Zhao
Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language
Júlia de Araújo Mota, Iago Leal de Freitas, Lucas Rufino et al.
AutoSR: Automatic Symbolic Regression by Searching Research States
Kejia Zhang, Youran Sun, Xinyu Ren et al.
Stationarity is not enough: tightness of the quantum mechanical bootstrap and the copositive cone
Daniel Keren
Technical Report: A Formal Semantics for Java Symbolic Evaluation using Large-Block Encoding
Soha Hussein, Stephen McCamant, Kelton OBrien et al.
Complete Reduction for Derivatives in a Transcendental Liouvillian Extension
Shaoshi Chen, Hao Du, Yiman Gao et al.