Related papers: Random Batch Methods for Discretized PDEs on Graph…
In this paper, we propose a randomized generalized multiscale finite element method (Randomized GMsFEM) for flow problems with parameterized inputs and high-contrast heterogeneous media. The method employs a data-driven predictor to…
In this paper, we study large and moderate deviation principles for stochastic partial differential equations (SPDEs) on metric graphs and their associated multiscale models via the weak convergence approach, providing a refined…
Meshfree radial basis function (RBF) methods are popular tools used to numerically solve partial differential equations (PDEs). They take advantage of being flexible with respect to geometry, easy to implement in higher dimensions, and can…
Graph partitioning (GP), a.k.a. community detection, is a classic problem that divides the node set of a graph into densely-connected blocks. Following prior work on the IEEE HPEC Graph Challenge benchmark and recent advances in graph…
The interpretation of numerical methods, such as finite difference methods for differential equations, as point estimators allows for formal statistical quantification of the error due to discretisation in the numerical context. Competing…
Solving time-dependent Partial Differential Equations (PDEs) using a densely discretized spatial domain is a fundamental problem in various scientific and engineering disciplines, including modeling climate phenomena and fluid dynamics.…
We propose a new reduced order modeling strategy for tackling parametrized Partial Differential Equations (PDEs) with linear constraints, in particular Darcy flow systems in which the constraint is given by mass conservation. Our approach…
Modern energy systems in vehicles and built infrastructure are governed by high-dimensional dynamics spanning multiple physical domains (e.g., electrical, thermal, mechanical) and timescales. This tutorial paper presents a graph-based…
We extend the Deep Galerkin Method (DGM) introduced in Sirignano and Spiliopoulos (2018)} to solve a number of partial differential equations (PDEs) that arise in the context of optimal stochastic control and mean field games. First, we…
A reduced kinetic method (RKM) with a first-principle collision operator is introduced in a 1D2V planar geometry and implemented in a computationally inexpensive code to investigate non-local ion heat transport in multi-species plasmas. The…
Over the last few decades, existing Partial Differential Equation (PDE) solvers have demonstrated a tremendous success in solving complex, non-linear PDEs. Although accurate, these PDE solvers are computationally costly. With the advances…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…
Machine learning is a rapidly advancing field with diverse applications across various domains. One prominent area of research is the utilization of deep learning techniques for solving partial differential equations(PDEs). In this work, we…
Finding maximum-weight independent sets in graphs is an important NP-hard optimization problem. Given a vertex-weighted graph $G$, the task is to find a subset of pairwise non-adjacent vertices of $G$ with maximum weight. Most recently…
In this paper we present a high-order kernel method for numerically solving diffusion and reaction-diffusion partial differential equations (PDEs) on smooth, closed surfaces embedded in $\mathbb{R}^d$. For two-dimensional surfaces embedded…
Using Domain Decomposition (DD) algorithm on non--overlapping domains, we compare couplings of different discretisation models, such as Finite Element (FEM) and Reduced Order (ROM) models for separate subcomponents. In particular, we…
We develop a domain-decomposition model reduction method for linear steady-state convection-diffusion equations with random coefficients. Of particular interest to this effort are the diffusion equations with random diffusivities, and the…
In this thesis we develop techniques to efficiently solve numerical Partial Differential Equations (PDEs) using Graphical Processing Units (GPUs). Focus is put on both performance and re--usability of the methods developed, to this end a…
The task of repeatedly solving parametrized partial differential equations (pPDEs) in, e.g. optimization or interactive applications, makes it imperative to design highly efficient and equally accurate surrogate models. The reduced basis…
Recently, gradient-based discrete sampling has emerged as a highly efficient, general-purpose solver for various combinatorial optimization (CO) problems, achieving performance comparable to or surpassing the popular data-driven approaches.…