Machine Learning for semi linear PDEs

09/20/2018

∙

Recent machine learning algorithms dedicated to solving semi-linear PDEs are improved by using different neural network architectures and different parameterizations. These algorithms are compared to a new one that solves a fixed point problem by using deep learning techniques. This new algorithm appears to be competitive in terms of accuracy with the best existing algorithms.

READ FULL TEXT

Machine Learning for semi linear PDEs

The effect of time discretization on the solution of parabolic PDEs with ANNs

Neural network architectures using min plus algebra for solving certain high dimensional optimal control problems and Hamilton-Jacobi PDEs

On some neural network architectures that can represent viscosity solutions of certain high dimensional Hamilton–Jacobi partial differential equations

Deep-learning PDEs with unlabeled data and hardwiring physics laws

A learning scheme by sparse grids and Picard approximations for semilinear parabolic PDEs

Learning optimal multigrid smoothers via neural networks

In search of isoglosses: continuous and discrete language embeddings in Slavic historical phonology

Machine Learning for semi linear PDEs

Related Research

The effect of time discretization on the solution of parabolic PDEs with ANNs

Neural network architectures using min plus algebra for solving certain high dimensional optimal control problems and Hamilton-Jacobi PDEs

On some neural network architectures that can represent viscosity solutions of certain high dimensional Hamilton–Jacobi partial differential equations

Deep-learning PDEs with unlabeled data and hardwiring physics laws

A learning scheme by sparse grids and Picard approximations for semilinear parabolic PDEs

Learning optimal multigrid smoothers via neural networks

In search of isoglosses: continuous and discrete language embeddings in Slavic historical phonology