2001
DOI: 10.1006/jsco.2001.0492
|View full text |Cite
|
Sign up to set email alerts
|

Formal Solutions of Linear PDEs and Convex Polyhedra

Abstract: The Newton polygon construction for ODEs, and Malgrange-Ramis polygon for partial differential equations in one variable are generalized in order to give an algorithm to find solutions of a linear partial differential equation at a singularity. The solutions found involve exponentials, logarithms and Laurent power series with exponents contained in a strongly convex cone.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2003
2003
2024
2024

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(21 citation statements)
references
References 6 publications
0
21
0
Order By: Relevance
“…It remains to show thatp is equal to the Poincaré rank of Δ (1) . By construction, the columns of Pj form an O-basis βj of Λ (j) and hence an O (1) -basis of Λ (j) (1) .…”
Section: -Compute a Unimodular Matrix P ∈ Mm(k[[y]]) So Thatmentioning
confidence: 99%
See 1 more Smart Citation
“…It remains to show thatp is equal to the Poincaré rank of Δ (1) . By construction, the columns of Pj form an O-basis βj of Λ (j) and hence an O (1) -basis of Λ (j) (1) .…”
Section: -Compute a Unimodular Matrix P ∈ Mm(k[[y]]) So Thatmentioning
confidence: 99%
“…, pn) is called the rank of (1). This paper deals with the following rank reduction problem: Given a system (1), to find a formal meromorphic gauge transformation Y = T (x)Z, T ∈ GLm(K), that takes (1) into an equivalent completely integrable Pfaffian system with normal crossings and minimal rank 8 > > < > > :…”
Section: Introductionmentioning
confidence: 99%
“…6], as solutions of partial differential equations [4], and as solutions of holonomic systems [16]. Also, A. D. Bruno uses them in [6] to construct a method for solving non-linear differential equations.…”
Section: F Arocamentioning
confidence: 99%
“…In the quasi-ordinary case, this is the celebrated Jung-Abhyankar theorem ( [5], [1]) but, for the more general case, we cannot know whether a given polynomial has Puiseux roots unless we actually compute them. This is now posible, thanks to the work of McDonald ( [9]) and Aroca-Cano ( [2]); but, while useful for working with examples, this method has not been adopted so far for its use on abstract argumentations.…”
Section: Final Commentsmentioning
confidence: 99%