Strong Form
Consider a general PDE defined in the strong form as follows where is an arbitrary solution field (potentially vector or tensor valued) and is a differential operator. To fully close an initial boundary value problem (IBVP) we also need appropriate initial and boundary conditions. We can write this generally as where the above represent general initial conditions on the solution field and time derivative and general boundary conditions on the the solution field in the form of general Dirichlet BCs and general Robin/Neumann BCs.
Our goal in pancax is to seek approximate solutions to the above general equation via physics informed neural networks (PINNs). We can do this in a number of ways, but the simplest and most classical is the following approach. We approximate the solution field with a multi-layer perceptron (MLP) With this in hand, we can now take derivatives with respect to or to obtain the necessary derivatives in our operator. For example which put another way is saying to differentiate the outputs of the neural network with respect to a subset of some of it's inputs. This can be achieved in any standard modern neural network library through automatic differentiation. However, this is not always an optimal approach in terms of both runtime and numerical accuracy, especially when it comes to nested differentiation.
Other derivatives can re written similarly and some are given below
One of the more common examples encountered in the PINN literature is the Burger's equation. This is given by