1990
DOI: 10.1007/bf01385638
|View full text |Cite
|
Sign up to set email alerts
|

Resommation des series formelles

Abstract: Resummation of formal seriesSolutions of second order linear complex ordinary differential equations near singularities Summary. Formulae for solutions of complex ordinary differential equations in the neighbourhood of irregular singularities contain almost every time divergent series. The Resummation Theory developed in the field of Analytic Functional Equations by J.P. Ramis provides us with a tool-box to perform in different ways some effective calculations and to compare their results. We take full advanta… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

1997
1997
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…Actually many formal and numerical procedure for resummation are available, see for instance Ref. 42. In this way it would be interesting to compare the numerical computations based on Padé approximants, 41,40 with the powerful hyperasymptotics methods of Refs.…”
Section: Ref 38͒mentioning
confidence: 99%
“…Actually many formal and numerical procedure for resummation are available, see for instance Ref. 42. In this way it would be interesting to compare the numerical computations based on Padé approximants, 41,40 with the powerful hyperasymptotics methods of Refs.…”
Section: Ref 38͒mentioning
confidence: 99%
“…In fact, Sû(t) can be represented by a more general convergent series, namely by a generalised factorial series (GFS) [44,41]:…”
Section: Generalised Factorial Series Algorithm (Gfs)mentioning
confidence: 99%
“…The GFS converges for Re(1/t) > 1/T and s n = nω e −iθ for any ω > ω 0 and some ω 0 > 0. ω 0 can be linked to the location of the closest singularity of P in the complex Borel plane. It is said that, numerically, the convergence of the GFS is more and more rapid as ω get close to ω 0 [41]. For linear equations, the closest singularity can be "read" from the coefficients of the equations and can be evaluated algorithmically.…”
Section: Generalised Factorial Series Algorithm (Gfs)mentioning
confidence: 99%
See 1 more Smart Citation
“…and Ramis and Thomann [36]. Thomann [42,43] discussed the summation of formal power series with the help of generalizations of factorial series, where the Pochhammer symbols (z) n+1 = z(z + 1) . .…”
Section: Introductionmentioning
confidence: 99%