On Expansion of a Solution of General Non-autonomous Polynomial Differential Equation
Abstract
We give a recursive formula for an expansion of a solution of a general non-autonomous polynomial differential equation. The formula is given on the algebraic level with a use of shuffle product. This approach minimizes the number of integrations on each order of expansion. Using combinatorics of trees we estimate the radius of convergence of the expansion.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.