skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Multi-discretization domain specific language and code generation for differential equations
Finch, a domain specific language and code generation framework for partial differential equations (PDEs), is demonstrated here to solve two classical problems: steady-state advection diffusion equation (single PDE) and the phonon Boltzmann transport equation (coupled PDEs). Both finite volume and finite element methods are explored. In addition to work presented at the 2022 International Conference on Computational Science (Heisler et al., 2022), we include recent developments for solving nonlinear equations using both automatic and symbolic differentiation, and demonstrate the capability for the Bratu (nonlinear Poisson) equation.  more » « less
Award ID(s):
1808652 2004236 2008772
PAR ID:
10431978
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
Journal of computational science
Volume:
68
ISSN:
1877-7503
Page Range / eLocation ID:
101981
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We investigate methods for learning partial differential equation (PDE) models from spatio-temporal data under biologically realistic levels and forms of noise. Recent progress in learning PDEs from data have used sparse regression to select candidate terms from a denoised set of data, including approximated partial derivatives. We analyse the performance in using previous methods to denoise data for the task of discovering the governing system of PDEs. We also develop a novel methodology that uses artificial neural networks (ANNs) to denoise data and approximate partial derivatives. We test the methodology on three PDE models for biological transport, i.e. the advection–diffusion, classical Fisher–Kolmogorov–Petrovsky–Piskunov (Fisher–KPP) and nonlinear Fisher–KPP equations. We show that the ANN methodology outperforms previous denoising methods, including finite differences and both local and global polynomial regression splines, in the ability to accurately approximate partial derivatives and learn the correct PDE model. 
    more » « less
  2. G-equations are popular level set Hamilton–Jacobi nonlinear partial differential equations (PDEs) of first or second order arising in turbulent combustion. Characterizing the effective burning velocity (also known as the turbulent burning velocity) is a fundamental problem there. We review relevant studies of the G-equation models with a focus on both the existence of effective burning velocity (homogenization), and its dependence on physical and geometric parameters (flow intensity and curvature effect) through representative examples. The corresponding physical background is also presented to provide motivations for mathematical problems of interest. Thelack of coercivityof Hamiltonian is a hallmark of G-equations. When either the curvature of the level set or the strain effect of fluid flows is accounted for, the Hamiltonian becomeshighly nonconvex and nonlinear. In the absence of coercivity and convexity, the PDE (Eulerian) approach suffers from insufficient compactness to establish averaging (homogenization). We review and illustrate a suite of Lagrangian tools, most notably min-max (max-min) game representations of curvature and strain G-equations, working in tandem with analysis of streamline structures of fluid flows and PDEs. We discuss open problems for future development in this emerging area of dynamic game analysis for averaging noncoercive, nonconvex, and nonlinear PDEs such as geometric (curvature-dependent) PDEs with advection. 
    more » « less
  3. Whether the 3D incompressible Euler equations can develop a finite time singularity from smooth initial data is one of the most challenging problems in nonlinear PDEs. In this paper, we present some new numerical evidence that the 3D axisymmetric incompressible Euler equations with smooth initial data of finite energy develop a potential finite time singularity at the origin. This potential singularity is different from the blow-up scenario revealed by Luo and Hou (111:12968–12973, 2014) and (12:1722–1776, 2014), which occurs on the boundary. Our initial condition has a simple form and shares several attractive features of a more sophisticated initial condition constructed by Hou and Huang in (arXiv:2102.06663, 2021) and (435:133257, 2022). One important difference between these two blow-up scenarios is that the solution for our initial data has a one-scale structure instead of a two-scale structure reported in Hou and Huang (arXiv:2102.06663, 2021) and (435:133257, 2022). More importantly, the solution seems to develop nearly self-similar scaling properties that are compatible with those of the 3D Navier–Stokes equations. We will present numerical evidence that the 3D Euler equations seem to develop a potential finite time singularity. Moreover, the nearly self-similar profile seems to be very stable to the small perturbation of the initial data. 
    more » « less
  4. Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity p o l y ( 1 / ϵ ) , where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be p o l y ( d , log ⁡ ( 1 / ϵ ) ) , where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations. 
    more » « less
  5. We are concerned with free boundary problems arising from the analysis of multidimensional transonic shock waves for the Euler equations in compressible fluid dynamics. In this expository paper, we survey some recent developments in the analysis of multidimensional transonic shock waves and corresponding free boundary problems for the compressible Euler equations and related nonlinear partial differential equations (PDEs) of mixed type. The nonlinear PDEs under our analysis include the steady Euler equations for potential flow, the steady full Euler equations, the unsteady Euler equations for potential flow, and related nonlinear PDEs of mixed elliptic–hyperbolic type. The transonic shock problems include the problem of steady transonic flow past solid wedges, the von Neumann problem for shock reflection–diffraction, and the Prandtl–Meyer problem for unsteady supersonic flow onto solid wedges. We first show how these longstanding multidimensional transonic shock problems can be formulated as free boundary problems for the compressible Euler equations and related nonlinear PDEs of mixed type. Then we present an effective nonlinear method and related ideas and techniques to solve these free boundary problems. The method, ideas, and techniques should be useful to analyze other longstanding and newly emerging free boundary problems for nonlinear PDEs. 
    more » « less