Abstract
Let Θ = C [e- x1, ..., e- xn] [∂1, ..., ∂n] and S = C [x1, ..., xn] [[eC x1 + ⋯ + C xn]], where C is an effective field and x1N ⋯ xnN eC x1 + ⋯ + C xn and S are given a suitable asymptotic ordering {precedes or equal to}. Consider the mapping L : S → Sl ; f {mapping} (L1 f, ..., Ll f), where L1, ..., Ll ∈ Θ. For g = (g1, ..., gl) ∈ SLl = im L, it is natural to ask how to solve the system L f = g. In this paper, we will effectively characterize SLl and show how to compute a so called distinguished right inverse L- 1 : SLl → S of L. We will also characterize the solution space of the homogeneous equation L h = 0.
| Original language | English |
|---|---|
| Pages (from-to) | 771-791 |
| Number of pages | 21 |
| Journal | Journal of Symbolic Computation |
| Volume | 42 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 1 Aug 2007 |
| Externally published | Yes |
Keywords
- Algorithm
- Asymptotics
- Differential algebra
- Formal power series
- Linear partial differential equation
- Tangent cone algorithm
Fingerprint
Dive into the research topics of 'Generalized power series solutions to linear partial differential equations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver