This content will become publicly available on December 10, 2024
 Award ID(s):
 1838071
 NSFPAR ID:
 10483954
 Publisher / Repository:
 OpenReview
 Date Published:
 Journal Name:
 NeurIPS
 Format(s):
 Medium: X
 Location:
 New Orleans
 Sponsoring Org:
 National Science Foundation
More Like this

This paper presents an online algorithm for identification of partial differential equations (PDEs) based on the weakform sparse identification of nonlinear dynamics algorithm (WSINDy). The algorithm is online in a sense that if performs the identification task by processing solution snapshots that arrive sequentially. The core of the method combines a weakform discretization of candidate PDEs with an online proximal gradient descent approach to the sparse regression problem. In particular, we do not regularize the ℓ0 pseudonorm, instead finding that directly applying its proximal operator (which corresponds to a hard thresholding) leads to efficient online system identification from noisy data. We demonstrate the success of the method on the KuramotoSivashinsky equation, the nonlinear wave equation with timevarying wavespeed, and the linear wave equation, in one, two, and three spatial dimensions, respectively. In particular, our examples show that the method is capable of identifying and tracking systems with coefficients that vary abruptly in time, and offers a streaming alternative to problems in higher dimensions.more » « less

Bin Dong, Qianxiao Li (Ed.)This paper presents an online algorithm for identification of partial differential equations (PDEs) based on the weakform sparse identification of nonlinear dynamics algorithm (WSINDy). The algorithm is online in a sense that if performs the identification task by processing solution snapshots that arrive sequentially. The core of the method combines a weakform discretization of candidate PDEs with an online proximal gradient descent approach to the sparse regression problem. In particular, we do not regularize the ℓ0pseudonorm, instead finding that directly applying its proximal operator (which corresponds to a hard thresholding) leads to efficient online system identification from noisy data. We demonstrate the success of the method on the KuramotoSivashinsky equation, the nonlinear wave equation with timevarying wavespeed, and the linear wave equation, in one, two, and three spatial dimensions, respectively. In particular, our examples show that the method is capable of identifying and tracking systems with coefficients that vary abruptly in time, and offers a streaming alternative to problems in higher dimensions.more » « less

We develop a new computational framework to solve the partial differential equations (PDEs) governing the flow of the joint probability density functions (PDFs) in continuoustime stochastic nonlinear systems. The need for computing the transient joint PDFs subject to prior dynamics arises in uncertainty propagation, nonlinear filtering and stochastic control. Our methodology breaks away from the traditional approach of spatial discretization or function approximation – both of which, in general, suffer from the “curseofdimensionality”. In the proposed framework, we discretize time but not the state space. We solve infinite dimensional proximal recursions in the manifold of joint PDFs, which in the small timestep limit, is theoretically equivalent to solving the underlying transport PDEs. The resulting computation has the geometric interpretation of gradient flow of certain free energy functional with respect to the Wasserstein metric arising from the theory of optimal mass transport. We show that dualization along with an entropic regularization, leads to a conepreserving fixed point recursion that is proved to be contractive in Thompson metric. A block coordinate iteration scheme is proposed to solve the resulting nonlinear recursions with guaranteed convergence. This approach enables remarkably fast computation for nonparametric transient joint PDF propagation. Numerical examples and various extensions are provided to illustrate the scope and efficacy of the proposed approach.more » « less

Abstract Fixedpoint fast sweeping WENO methods are a class of efficient highorder numerical methods to solve steadystate solutions of hyperbolic partial differential equations (PDEs). The GaussSeidel iterations and alternating sweeping strategy are used to cover characteristics of hyperbolic PDEs in each sweeping order to achieve fast convergence rate to steadystate solutions. A nice property of fixedpoint fast sweeping WENO methods which distinguishes them from other fast sweeping methods is that they are explicit and do not require inverse operation of nonlinear local systems. Hence, they are easy to be applied to a general hyperbolic system. To deal with the difficulties associated with numerical boundary treatment when highorder finite difference methods on a Cartesian mesh are used to solve hyperbolic PDEs on complex domains, inverse LaxWendroff (ILW) procedures were developed as a very effective approach in the literature. In this paper, we combine a fifthorder fixedpoint fast sweeping WENO method with an ILW procedure to solve steadystate solution of hyperbolic conservation laws on complex computing regions. Numerical experiments are performed to test the method in solving various problems including the cases with the physical boundary not aligned with the grids. Numerical results show highorder accuracy and good performance of the method. Furthermore, the method is compared with the popular thirdorder total variation diminishing RungeKutta (TVDRK3) timemarching method for steadystate computations. Numerical examples show that for most of examples, the fixedpoint fast sweeping method saves more than half CPU time costs than TVDRK3 to converge to steadystate solutions.

We employ numerically implicit subgridscale modeling provided by the wellknown streamlined upwind/Petrov–Galerkin stabilization for the finite element discretization of advection–diffusion problems in a Large Eddy Simulation (LES) approach. Whereas its original purpose was to provide sufficient algorithmic dissipation for a stable and convergent numerical method, more recently, it has been utilized as a subgridscale (SGS) model to account for the effect of small scales, unresolvable by the discretization. The freestream Mach number is 2.5, and direct comparison with a DNS database from our research group, as well as with experiments from the literature of adiabatic supersonic spatially turbulent boundary layers, is performed. Turbulent inflow conditions are generated via our dynamic rescaling–recycling approach, recently extended to highspeed flows. Focus is given to the assessment of the resolved Reynolds stresses. In addition, flow visualization is performed to obtain a much better insight into the physics of the flow. A weak compressibility effect is observed on thermal turbulent structures based on twopoint correlations (IC vs. supersonic). The Reynolds analogy (u′ vs. t′) approximately holds for the supersonic regime, but to a lesser extent than previously observed in incompressible (IC) turbulent boundary layers, where temperature was assumed as a passive scalar. A much longer power law behavior of the mean streamwise velocity is computed in the outer region when compared to the log law at Mach 2.5. Implicit LES has shown very good performance in Mach 2.5 adiabatic flat plates in terms of the mean flow (i.e., Cf and UVD+). iLES significantly overpredicts the peak values of u′, and consequently Reynolds shear stress peaks, in the buffer layer. However, excellent agreement between the turbulence intensities and Reynolds shear stresses is accomplished in the outer region by the present iLES with respect to the external DNS database at similar Reynolds numbers.more » « less