A fast algorithm for computing lie series solutions of autonomous differential equations

DOI10.1080/00207169408804330MaRDI QIDQ4844587zbMATH OpenOpenAlexFDO

Authors Zhen Zhang, Hong Zhang, Eberhard O. (Editor-in-Chief) Voit

Publication date 10 January 1996

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169408804330

zbMATH Keywords

autonomous differential equationcomputational complexityfast algorithmLie seriesmultivariate systemsnumerical example

Mathematics Subject Classification ID

Analytical theory of ordinary differential equations: series, transformations, transforms, operational calculus, etc. (34A25) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Recommendations

• scientific article; zbMATH DE number 4077725
• Representing the solutions of ordinary differential equations in the form of Lie series
• scientific article; zbMATH DE number 3928241
• scientific article; zbMATH DE number 3951262
• Fast computation of power series solutions of systems of differential equations

Cited in

(5)

• Lie-exponentials, tadpole diagrams and frogspawn: explicit solutions to autonomous nonlinear systems
• LIE SERIES TECHNIQUE, LIMIT CYCLE SYSTEMS AND DYNAMICAL INTEGRATION
• scientific article; zbMATH DE number 3928241 (Why is no real title available?)
• scientific article; zbMATH DE number 4077725 (Why is no real title available?)
• Computation of Lie transformations from a power series: Bounds and optimum truncation

This page was built for publication: A fast algorithm for computing lie series solutions of autonomous differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844587)