Algorithmic reduction of polynomially nonlinear PDE systems to parametric ODE systems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909351469383680 |
|---|---|
| author | Deng, Siyuan Hatzel, Michelle Reid, Gregory Yang, Wenqiang Wu, Wenyuan |
| author_facet | Deng, Siyuan Hatzel, Michelle Reid, Gregory Yang, Wenqiang Wu, Wenyuan |
| contents | Differential-elimination algorithms apply a finite number of differentiations and eliminations to systems of partial differential equations. For systems that are polynomially nonlinear with rational number coefficients, they guarantee the inclusion of missing integrability conditions and the statement of of existence and uniqueness theorems for local analytic solutions of such systems. Further, they are useful in obtaining systems in a form more amenable to exact and approximate solution methods.
Maple's \maple{dsolve} and \maple{pdsolve} algorithms for solving PDE and ODE often automatically call such routines during applications. Indeed, even casual users of Maple's dsolve and pdsolve commands have probably unknowingly used Maple's differential-elimination algorithms.
Suppose that a system of PDE has been reduced by differential-elimination to a system whose automatic existence and uniqueness algorithm has been determined to be finite-dimensional. We present an algorithm for rewriting the output as a system of parameterized ODE. Exact methods and numerical methods for solving ODE and DAE can be applied to this form. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_12110 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Algorithmic reduction of polynomially nonlinear PDE systems to parametric ODE systems Deng, Siyuan Hatzel, Michelle Reid, Gregory Yang, Wenqiang Wu, Wenyuan Symbolic Computation Differential-elimination algorithms apply a finite number of differentiations and eliminations to systems of partial differential equations. For systems that are polynomially nonlinear with rational number coefficients, they guarantee the inclusion of missing integrability conditions and the statement of of existence and uniqueness theorems for local analytic solutions of such systems. Further, they are useful in obtaining systems in a form more amenable to exact and approximate solution methods. Maple's \maple{dsolve} and \maple{pdsolve} algorithms for solving PDE and ODE often automatically call such routines during applications. Indeed, even casual users of Maple's dsolve and pdsolve commands have probably unknowingly used Maple's differential-elimination algorithms. Suppose that a system of PDE has been reduced by differential-elimination to a system whose automatic existence and uniqueness algorithm has been determined to be finite-dimensional. We present an algorithm for rewriting the output as a system of parameterized ODE. Exact methods and numerical methods for solving ODE and DAE can be applied to this form. |
| title | Algorithmic reduction of polynomially nonlinear PDE systems to parametric ODE systems |
| topic | Symbolic Computation |
| url | https://arxiv.org/abs/2410.12110 |