Parallel-in-Time Probabilistic Solutions for Time-Dependent Nonlinear Partial Differential Equations

We present an efficient probabilistic solver for time-dependent nonlinear partial differential equations. We formulate our method as the maximum a posteriori solver for a constrained risk problem on a reproducing kernel Hilbert space induced by a spatiotemporal Gaussian process prior. We show that for a suitable choice of temporal kernels, the risk objective can be minimized efficiently via a Gauss-Newton algorithm corresponding to an iterated extended Kalman smoother (IEKS). Furthermore, by leveraging a parallel-in-time implementation of IEKS, our algorithm can take advantage of massively parallel graphical processing units to achieve logarithmic instead of linear scaling with time. We validate our method numerically on popular benchmark problems.

Authors

Institutions

Publication Details

Published
2024-09-22
DOI
https://doi.org/10.1109/mlsp58920.2024.10734739
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parallel-in-Time Probabilistic Solutions for Time-Dependent Nonlinear Partial Differential Equations

Ulisses Braga-Neto, Hany Abdulsamad, Sahel Iqbal, Simo Särkkä et al.
Model Reduction and Neural Networks
article

Parallel-in-Time Probabilistic Solutions for Time-Dependent Nonlinear Partial Differential Equations

Ulisses Braga-Neto, Hany Abdulsamad, Sahel Iqbal, Simo Särkkä, Tripp Cator
article en

Abstract

We present an efficient probabilistic solver for time-dependent nonlinear partial differential equations. We formulate our method as the maximum a posteriori solver for a constrained risk problem on a reproducing kernel Hilbert space induced by a spatiotemporal Gaussian process prior. We show that for a suitable choice of temporal kernels, the risk objective can be minimized efficiently via a Gauss-Newton algorithm corresponding to an iterated extended Kalman smoother (IEKS). Furthermore, by leveraging a parallel-in-time implementation of IEKS, our algorithm can take advantage of massively parallel graphical processing units to achieve logarithmic instead of linear scaling with time. We validate our method numerically on popular benchmark problems.

Texas A&M University (US), Aalto University (FI)
National Science Foundation, Academy of Finland
Openalex Percentile: Top 82%
Model Reduction and Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Parallel-in-Time Probabilistic Solutions for Time-Dependent Nonlinear Partial Differential Equations — Ulisses Braga-Neto, Hany Abdulsamad, et al. · (2024) | TGRS Research Map | TGRS