Symbolic Solutions of Simultaneous First-order PDEs in One Unknown

by   Célestin Wafo Soh, et al.

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.


A Discussion on Solving Partial Differential Equations using Neural Networks

Can neural networks learn to solve partial differential equations (PDEs)...

Fast global spectral methods for three-dimensional partial differential equations

Global spectral methods offer the potential to compute solutions of part...

Symbolically Solving Partial Differential Equations using Deep Learning

We describe a neural-based method for generating exact or approximate so...

Optimising finite-difference methods for PDEs through parameterised time-tiling in Devito

Finite-difference methods are widely used in solving partial differentia...

P_N-Method for Multiple Scattering in Participating Media

Rendering highly scattering participating media using brute force path t...

A Flawed Dataset for Symbolic Equation Verification

Arabshahi, Singh, and Anandkumar (2018) propose a method for creating a ...

General solutions for nonlinear differential equations: a deep reinforcement learning approach

Physicists use differential equations to describe the physical dynamical...