Related papers: An Efficient NRxx Method for Boltzmann-BGK Equatio…
This work presents a novel stabilization strategy for the Galerkin formulation of the incompressible Navier-Stokes equations, developed to achieve high accuracy while ensuring convergence and compatibility with high-order elements on…
The off-lattice Boltzmann (OLB) method consists of numerical schemes which are used to solve the discrete Boltzmann equation. Unlike the commonly used lattice Boltzmann method, the spatial and time steps are uncoupled in the OLB method. In…
Method of moment estimators exhibit appealing statistical properties, such as asymptotic unbiasedness, for nonconvex problems. However, they typically require a large number of samples and are extremely sensitive to model misspecification.…
The purposes of this paper are testing an efficiency algorithm based on LBM and using it to analyze two-dimensional natural convection with low Prandtl number. Steady state or oscillatory results are obtained using double…
Here we study theoretically and compare experimentally an efficient method for solving systems of algebraic equations, where the matrix comes from the discretization of a fractional diffusion operator. More specifically, we focus on…
This work proposes novel techniques for the efficient numerical simulation of parameterized, unsteady partial differential equations. Projection-based reduced order models (ROMs) such as the reduced basis method employ a (Petrov-)Galerkin…
In this paper we study the numerical method and the convergence for solving the time-dependent Maxwell-Schr\"{o}dinger equations under the Lorentz gauge. An alternating Crank-Nicolson finite element method for solving the problem is…
Our work focuses on stochastic gradient methods for optimizing a smooth non-convex loss function with a non-smooth non-convex regularizer. Research on this class of problem is quite limited, and until recently no non-asymptotic convergence…
In the present work, we present numerical results for an iterative method for solving an optimal control problem with inequality contraints. The method is based on generalized Bregman distances. Under a combination of a source condition and…
The simplified lattice Boltzmann method (SLBM) is a recent development in the lattice Boltzmann method (LBM) community, addressing the intrinsic limitations of the traditional LBM by directly evolving macroscopic quantities and maintaining…
The Random Batch Method (RBM) is an effective technique to reduce the computational complexity when solving certain stochastic differential problems (SDEs) involving interacting particles. It can transform the computational complexity from…
We study nonconvex finite-sum problems and analyze stochastic variance reduced gradient (SVRG) methods for them. SVRG and related methods have recently surged into prominence for convex optimization given their edge over stochastic gradient…
We consider the problem of efficiently computing the maximum likelihood estimator in Generalized Linear Models (GLMs) when the number of observations is much larger than the number of coefficients ($n \gg p \gg 1$). In this regime,…
In numerical simulations of many charged systems at the micro/nano scale, a common theme is the repeated solution of the Poisson-Boltzmann equation. This task proves challenging, if not entirely infeasible, largely due to the nonlinearity…
Many HPC applications that solve differential equations rely on the Runge-Kutta family of methods for time integration. Among these methods, the fourth-order accurate RK4 scheme is especially popular. This time integration scheme requires…
The aim of this work is to design implicit and semi-implicit high-order well-balanced finite-volume numerical methods for 1D systems of balance laws. The strategy introduced by two of the authors in a previous paper for explicit schemes…
In this paper, we consider the task of efficiently computing the numerical solution of evolutionary complex Ginzburg--Landau equations on Cartesian product domains with homogeneous Dirichlet/Neumann or periodic boundary conditions. To this…
This article describes a set of methods for quickly computing the solution to the regularized optimal transport problem. It generalizes and improves upon the widely-used iterative Bregman projections algorithm (or Sinkhorn--Knopp…
The entropy-based moment method is a well-known discretization for the velocity variable in kinetic equations which has many desirable theoretical properties but is difficult to implement with high-order numerical methods. The regularized…
We address the convergence analysis of lattice Boltzmann methods for scalar non-linear conservation laws, focusing on two-relaxation-times (TRT) schemes. Unlike Finite Difference/Finite Volume methods, lattice Boltzmann schemes offer…