2014
DOI: 10.5186/aasfm.2014.3929
|View full text |Cite
|
Sign up to set email alerts
|

Complex Riccati differential equations revisited

Abstract: Abstract. We utilise a new approach via the so-called re-scaling method to derive a thorough theory for polynomial Riccati differential equations in the complex domain.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(15 citation statements)
references
References 12 publications
0
15
0
Order By: Relevance
“…We quote from that the solutions to have asymptotic expansions tfalse(zfalse)zn2ε+k=1ck(ε)zk2false(ε=εν(t){1,1}false)on the Stokes sectors normalΣν:false|prefixargz2νπn+2false|<πn+2, false|zfalse|>r0 (0νn+1); for n, even the coefficients with odd index vanish. The solution sans-serift is uniquely determined if the asymptotic expansion holds on some open sector that contains normalΣ¯ν; it then holds on normalΣν1σν1normalΣνσνnormalΣν+1.…”
Section: Proof Of Theoremmentioning
confidence: 99%
See 4 more Smart Citations
“…We quote from that the solutions to have asymptotic expansions tfalse(zfalse)zn2ε+k=1ck(ε)zk2false(ε=εν(t){1,1}false)on the Stokes sectors normalΣν:false|prefixargz2νπn+2false|<πn+2, false|zfalse|>r0 (0νn+1); for n, even the coefficients with odd index vanish. The solution sans-serift is uniquely determined if the asymptotic expansion holds on some open sector that contains normalΣ¯ν; it then holds on normalΣν1σν1normalΣνσνnormalΣν+1.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…They arise from the zeros of sans-serifr2false(z,sans-serift(z)false), and also from the poles of sans-serift if prefixdegtsans-serifr1>prefixdegtsans-serifr2, hence prefixdegtsans-serifr1=1+prefixdegtsans-serifr2. Regarding the poles of sans-serift we recall some facts from . Up to finitely many, the poles of any generic solution are arranged in n+2 sequences (pk) satisfying the approximate iteration scheme pk+1=pk±false(πi+o(1)false)pkn/2,hence pk=()(false(n2+1false)πi+ofalse(1false))k2/(n+2), with counting function nfalse(r,(pk)false)=rfalse(n/2false)+1(n+2)π+ofalse(rfalse(n/2false)+1false).To each Stokes ray σν:argz=θν=2ν+1n+2π there is exactly one such string that is asymptotic to σν…”
Section: Proof Of Theoremmentioning
confidence: 99%
See 3 more Smart Citations