we propose a scalable preconditioned primal-dual gradient algorithm for solving partial differential equations (pdes). we multiply the pde with a dual function to obtain an inf-sup problem whose loss function involves lower-order differential operators. the primal-dual hybrid gradient (pdhg) algorithm is leveraged for this saddle point problem. by introducing suitable precondition operators to the proximal steps in the pdhg algorithm, we obtain an alternative natural gradient ascent-descent optimization scheme for updating the primal and the adversarial neural network parameters. we apply the krylov subspace method to evaluate the natural gradients efficiently. a posterior convergence analysis is established for the time-continuous version of the proposed method.

the algorithm is tested on various types of linear and nonlinear pdes with dimensions ranging from 1 to 50. we compare the performance of the proposed method with several commonly used deep learning algorithms, such as physics-informed neural networks (pinns), the deepritz method, and weak adversarial networks (wans) using the adam or l-bfgs optimizers. the numerical results suggest that the proposed method performs efficiently and robustly and converges more stably.