一元一阶联立偏微分方程的符号解
Symbolic Solutions of Simultaneous First-order PDEs in One Unknown
摘要:
提出并实现了一个求解一元超定偏微分方程组的算法。我们的方法依赖于Bour-Mayer方法通过Jacobi-Mayer括号来确定相容性条件。我们通过模仿人们用笔和纸所做的事情来递归地解决兼容系统:求解一个方程,将该解代入其余方程,并重复该过程,直到系统的方程耗尽。我们采用的方法来评估底层系统的一致性不同于传统的差分格罗布纳基的使用,但似乎更有效和直接的实施。我们不知道一个计算机代数系统,采用我们在这项工作中提倡的过程。
英文摘要:
We propose and implement an algorithm for solving an overdetermined system of partial differential equations in one unknown. Our approach relies on Bour-Mayer method to determine compatibility conditions via Jacobi-Mayer brackets. We solve compatible systems recursively by imitating what one would do with pen and paper: Solve one equation, substitute the solution into the remaining equations and iterate the process until the equations of the system are exhausted. The method we employ for assessing the consistency of the underlying system differs from the traditional use of differential Gröbner bases yet seems more efficient and straightforward to implement. We are not aware of a computer algebra system that adopts the procedure we advocate in this work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。