An algorithm to compute the exponential part of a formal fundamental matrix solution of a linear differential system

DOI10.1007/s002000050048zbMath0867.65034OpenAlexW1988098065MaRDI QIDQ1352410

Moulay A. Barkatou

Publication date: 13 July 1997

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050048

zbMATH Keywords

algorithmsingular pointsfundamental matrixramification indexasymptotic expansionsMaple computer algebra systemvariable coefficientsfirst-order linear system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (19)

Computing the exponential part of a formal fundamental matrix solution of a linear difference system ⋮ Procedures for searching local solutions of linear differential systems with infinite power series in the role of coefficients ⋮ On exponential-logarithmic solutions of linear differential systems with power series coefficients ⋮ Resolving sequences of operators for linear ordinary differential and difference systems of arbitrary order ⋮ On \(k\)-simple forms of first-order linear differential systems and their computation ⋮ Stable manifolds of biholomorphisms in Cn$\mathbb {C}^n$ asymptotic to formal curves ⋮ Formal solutions of singularly-perturbed linear differential systems ⋮ Restrictions of Pfaffian systems for Feynman integrals ⋮ Formal reduction of singular linear differential systems using eigenrings: a refined approach ⋮ Computing hypergeometric solutions of linear recurrence equations ⋮ Unnamed Item ⋮ An algorithm computing the regular formal solutions to a system of linear differential equations ⋮ Formal solutions of completely integrable Pfaffian systems with normal crossings ⋮ On ramification indices of formal solutions of constructive linear ordinary differential systems ⋮ A monomial-by-monomial method for computing regular solutions of systems of pseudo-linear equations ⋮ On \(d\)-solvability for linear differential equations ⋮ On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity ⋮ Linear differential systems with small coefficients: various types of solvability and their verification ⋮ Computation of formal fundamental solutions

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal reduction theory of meromorphic differential equations: a group theoretic view
• On the identification and stability of formal invariants for singular differential equations
• Un algorithme de calcul de l'invariant de Katz d'un système différentiel linéaire. (An algorithm for the calculation of the Katz invariant of a linear differential system)
• Lemmes de Hensel pour les opérateurs différentiels. Application à la reduction formelle des équations différentielles
• An algorithm for computing a companion block diagonal form for a system of linear differential equations
• Equations différentielles à points singuliers réguliers
• The order of a singularity in Fuchs' theory
• Convergent solutions of ordinary linear homogeneous differential equations in the neighborhood of an irregular singular point

This page was built for publication: An algorithm to compute the exponential part of a formal fundamental matrix solution of a linear differential system