An official website of the United States government
We study a regularized interacting particle method for computing aggregation patterns and near singular solutions of a Keller–Segel (KS) chemotaxis system in two and three space dimensions, then further develop the DeepParticle method to learn and generate solutions under variations of physical parameters. The KS solutions are approximated as empirical measures of particles that self-adapt to the high gradient part of solutions. We utilize the expressiveness of deep neural networks (DNNs) to represent the transform of samples from a given initial (source) distribution to a target distribution at a finite time 𝑇 prior to blowup without assuming the invertibility of the transforms. In the training stage, we update the network weights by minimizing a discrete 2-Wasserstein distance between the input and target empirical measures. To reduce the computational cost, we develop an iterative divide-and-conquer algorithm to find the optimal transition matrix in the Wasserstein distance. We present numerical results of the DeepParticle framework for successful learning and generation of KS dynamics in the presence of laminar and chaotic flows. The physical parameter in this work is either the evolution time or the flow amplitude in the advection-dominated regime.
more »
« less
This content will become publicly available on March 1, 2026
A Novel Stochastic Interacting Particle-Field Algorithm for 3D Parabolic-Parabolic Keller-Segel Chemotaxis System
Abstract We introduce an efficient stochastic interacting particle-field (SIPF) algorithm with no history dependence for computing aggregation patterns and near singular solutions of parabolic-parabolic Keller-Segel (KS) chemotaxis system in three-dimensional (3D) space. In our algorithm, the KS solutions are approximated as empirical measures of particles coupled with a smoother field (concentration of chemo-attractant) variable computed by a spectral method. Instead of using heat kernels that cause history dependence and high memory cost, we leverage the implicit Euler discretization to derive a one-step recursion in time for stochastic particle positions and the field variable based on the explicit Green’s function of an elliptic operator of the form Laplacian minus a positive constant. In numerical experiments, we observe that the resulting SIPF algorithm is convergent and self-adaptive to the high-gradient part of solutions. Despite the lack of analytical knowledge (such as a self-similar ansatz) of a blowup, the SIPF algorithm provides a low-cost approach to studying the emergence of finite-time blowup in 3D space using only dozens of Fourier modes and by varying the amount of initial mass and tracking the evolution of the field variable. Notably, the algorithm can handle multi-modal initial data and the subsequent complex evolution involving the merging of particle clusters and the formation of a finite time singularity with ease.
more »
« less
- Award ID(s):
- 2309520
- PAR ID:
- 10610968
- Publisher / Repository:
- Springer
- Date Published:
- Journal Name:
- Journal of Scientific Computing
- Volume:
- 102
- Issue:
- 3
- ISSN:
- 0885-7474
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)In this paper we consider a problem of initial data identification from the final time observation for homogeneous parabolic problems. It is well-known that such problems are exponentially ill-posed due to the strong smoothing property of parabolic equations. We are interested in a situation when the initial data we intend to recover is known to be sparse, i.e. its support has Lebesgue measure zero. We formulate the problem as an optimal control problem and incorporate the information on the sparsity of the unknown initial data into the structure of the objective functional. In particular, we are looking for the control variable in the space of regular Borel measures and use the corresponding norm as a regularization term in the objective functional. This leads to a convex but non-smooth optimization problem. For the discretization we use continuous piecewise linear finite elements in space and discontinuous Galerkin finite elements of arbitrary degree in time. For the general case we establish error estimates for the state variable. Under a certain structural assumption, we show that the control variable consists of a finite linear combination of Dirac measures. For this case we obtain error estimates for the locations of Dirac measures as well as for the corresponding coefficients. The key to the numerical analysis are the sharp smoothing type pointwise finite element error estimates for homogeneous parabolic problems, which are of independent interest. Moreover, we discuss an efficient algorithmic approach to the problem and show several numerical experiments illustrating our theoretical results.more » « less
-
A long-standing fundamental open problem in mathematical fluid dynamics and nonlinear partial differential equations is to determine whether solutions of the 3D incompressible Euler equations can develop a finite-time singularity from smooth, finite-energy initial data. Leonhard Euler introduced these equations in 1757 [L. Euler,Mémoires de l’Académie des Sci. de Berlin11, 274–315 (1757).], and they are closely linked to the Navier–Stokes equations and turbulence. While the general singularity formation problem remains unresolved, we review a recent computer-assisted proof of finite-time, nearly self-similar blowup for the 2D Boussinesq and 3D axisymmetric Euler equations in a smooth bounded domain with smooth initial data. The proof introduces a framework for (nearly) self-similar blowup, demonstrating the nonlinear stability of an approximate self-similar profile constructed numerically via the dynamical rescaling formulation.more » « less
-
The Discontinuous Petrov-Galerkin (DPG) method and the exponential integrators are two well establishednumerical methods for solving Partial Differential Equations (PDEs) and stiff systems of Ordinary Differential Equations (ODEs), respectively. In this work, we apply the DPG method in the time variable for linear parabolic problems and we calculate the optimal test functions analytically. We show that the DPG method in time is equivalent to exponential integrators for the trace variables, which are decoupled from the interior variables. In addition, the DPG optimal test functions allow us to compute the approximated solutions in the time element interiors. This DPG method in time allows to construct a posteriori error estimations in order to perform adaptivity. We generalize this novel DPG-based time-marching scheme to general first order linear systems of ODEs. We show the performance of the proposed method for 1D and 2D +time linear parabolic PDEs after discretizing in space by the finite element method.more » « less
-
Abstract We prove monotonicity of a parabolic frequency on static and evolving manifolds without any curvature or other assumptions. These are parabolic analogs of Almgren’s frequency function. When the static manifold is Euclidean space and the drift operator is the Ornstein–Uhlenbeck operator, this can been seen to imply Poon’s frequency monotonicity for the ordinary heat equation. When the manifold is self-similarly evolving by the Ricci flow, we prove a parabolic frequency monotonicity for solutions of the heat equation. For the self-similarly evolving Gaussian soliton, this gives directly Poon’s monotonicity. Monotonicity of frequency is a parabolic analog of the 19th century Hadamard three-circle theorem about log convexity of holomorphic functions on C. From the monotonicity, we get parabolic unique continuation and backward uniqueness.more » « less
