Abstract
An algorithm to generate solutions for members of a class of completely integrable partial differential equations has been derived from a constructive proof of Frobenius' Theorem. The algorithm is implemented as a procedure in the computer algebra system Maple. Because the implementation makes heavy use of the facilities of Maple for solving sets of ordinary differential equations and for sets of nonlinear equations, and these facilities are limited, the problems that actually can be solved are restricted in size and complexity. Some examples are presented to illustrate this
| Original language | English |
|---|---|
| Title of host publication | Rhine Workshop on Computer Algebra. Proceedings |
| Editors | J. Calmet |
| Place of Publication | Karlsruhe, Germany |
| Publisher | Universität Karlsruhe |
| Pages | 84-88 |
| Publication status | Published - 1994 |
Fingerprint
Dive into the research topics of 'Symbolic solutions for a class of partial differential equations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver