| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10325829 | Journal of Symbolic Computation | 2012 | 22 Pages |
Abstract
A linear (partial) functional system consists of linear partial differential, difference equations or any mixture thereof. We present an algorithm that determines whether linear functional systems are â-finite, and transforms â-finite systems to fully integrable ones. The algorithm avoids using Gröbner bases in Laurent-Ore modules when â-finite systems correspond to finite-dimensional Ore modules.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Ziming Li, Min Wu,