More Like this

1. Semi-implicit hybrid discrete (H$^T_N$) approximation of thermal radiative transfer

   https://doi.org/https://link.springer.com/article/10.1007/s10915-021-01686-7  

   R.G. McClarren, J.A. Rossmanith ( November 2021 , Journal of scientific computing)

   The thermal radiative transfer (TRT) equations form an integro-differential system that describes the propagation and collisional interactions of photons. Computing accurate and efficient numerical solutions TRT are challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase space that includes the independent variables of time, space, and velocity. In order to reduce the dimensionality of the phase space, classical approaches such as the P$_N$ (spherical harmonics) or the S$_N$ (discrete ordinates) ansatz are often used in the literature. In this work, we introduce a novel approach: the hybrid discrete (H$^T_N$) approximation to the radiative thermal transfer equations. This approach acquires desirable properties of both P$_N$ and S$_N$, and indeed reduces to each of these approximations in various limits: H$^1_N$ $\equiv$ P$_N$ and H$^T_0$ $\equiv$ S$_T$. We prove that H$^T_N$ results in a system of hyperbolic partial differential equations for all $T\ge 1$ and $N\ge 0$. Another challenge in solving the TRT system is the inherent stiffness due to the large timescale separation between propagation and collisions, especially in the diffusive (i.e., highly collisional) regime. This stiffness challenge can be partially overcome via implicit time integration, although fully implicit methods may become computationally expensivemore »due to the strong nonlinearity and system size. On the other hand, explicit time-stepping schemes that are not also asymptotic-preserving in the highly collisional limit require resolving the mean-free path between collisions, making such schemes prohibitively expensive. In this work we develop a numerical method that is based on a nodal discontinuous Galerkin discretization in space, coupled with a semi-implicit discretization in time. In particular, we make use of a second order explicit Runge-Kutta scheme for the streaming term and an implicit Euler scheme for the material coupling term. Furthermore, in order to solve the material energy equation implicitly after each predictor and corrector step, we linearize the temperature term using a Taylor expansion; this avoids the need for an iterative procedure, and therefore improves efficiency. In order to reduce unphysical oscillation, we apply a slope limiter after each time step. Finally, we conduct several numerical experiments to verify the accuracy, efficiency, and robustness of the H$^T_N$ ansatz and the numerical discretizations.« less
2. High-order finite element methods for a pressure Poisson equation reformulation of the Navier-Stokes equations with electric boundary conditions.

   https://doi.org/j.cma.2020.113451  

   Rosales, R. R. ; Seibold, B. ; Shirokoff, D. ; Zhou, D. ( January 2021 , Computer methods in applied mechanics and engineering)

   Pressure Poisson equation (PPE) reformulations of the incompressible Navier–Stokes equations (NSE) replace the incompressibility constraint by a Poisson equation for the pressure and a suitable choice of boundary conditions. This yields a time-evolution equation for the velocity field only, with the pressure gradient acting as a nonlocal operator. Thus, numerical methods based on PPE reformulations are representatives of a class of methods that have no principal limitations in achieving high order. In this paper, it is studied to what extent high-order methods for the NSE can be obtained from a specific PPE reformulation with electric boundary conditions (EBC). To that end, implicit–explicit (IMEX) time-stepping is used to decouple the pressure solve from the velocity update, while avoiding a parabolic time-step restriction; and mixed finite elements are used in space, to capture the structure imposed by the EBC. Via numerical examples, it is demonstrated that the methodology can yield at least third order accuracy in space and time.
3. A Robust Bubble Growth Solution Scheme for Implementation in CFD Analysis of Multiphase Flows

   https://doi.org/10.3390/computation11040072  

   Pang, Hao ; Ngaile, Gracious ( April 2023 , Computation)

   Although the full form of the Rayleigh–Plesset (RP) equation more accurately depicts the bubble behavior in a cavitating flow than its reduced form, it finds much less application than the latter in the computational fluid dynamic (CFD) simulation due to its high stiffness. The traditional variable time-step scheme for the full form RP equation is difficult to be integrated with the CFD program since it requires a tiny time step at the singularity point for convergence and this step size may be incompatible with time marching of conservation equations. This paper presents two stable and efficient numerical solution schemes based on the finite difference method and Euler method so that the full-form RP equation can be better accepted by the CFD program. By employing a truncation bubble radius to approximate the minimum bubble size in the collapse stage, the proposed schemes solve for the bubble radius and wall velocity in an explicit way. The proposed solution schemes are more robust for a wide range of ambient pressure profiles than the traditional schemes and avoid excessive refinement on the time step at the singularity point. Since the proposed solution scheme can calculate the effects of the second-order term, liquid viscosity, andmore »surface tension on the bubble evolution, it provides a more accurate estimation of the wall velocity for the vaporization or condensation rate, which is widely used in the cavitation model in the CFD simulation. The legitimacy of the solution schemes is manifested by the agreement between the results from these schemes and established ones from the literature. The proposed solution schemes are more robust in face of a wide range of ambient pressure profiles.« less
4. Time-marching based quantum solvers for time-dependent linear differential equations

   https://doi.org/10.22331/q-2023-03-20-955  

   Fang, Di ; Lin, Lin ; Tong, Yu ( March 2023 , Quantum)

   The time-marching strategy, which propagates the solution from one time step to the next, is a natural strategy for solving time-dependent differential equations on classical computers, as well as for solving the Hamiltonian simulation problem on quantum computers. For more general homogeneous linear differential equations d d t | ψ ( t ) ⟩ = A ( t ) | ψ ( t ) ⟩ , | ψ ( 0 ) ⟩ = | ψ 0 ⟩ , a time-marching based quantum solver can suffer from exponentially vanishing success probability with respect to the number of time steps and is thus considered impractical. We solve this problem by repeatedly invoking a technique called the uniform singular value amplification, and the overall success probability can be lower bounded by a quantity that is independent of the number of time steps. The success probability can be further improved using a compression gadget lemma. This provides a path of designing quantum differential equation solvers that is alternative to those based on quantum linear systems algorithms (QLSA). We demonstrate the performance of the time-marching strategy with a high-order integrator based on the truncated Dyson series. The complexity of the algorithm depends linearly on themore »amplification ratio, which quantifies the deviation from a unitary dynamics. We prove that the linear dependence on the amplification ratio attains the query complexity lower bound and thus cannot be improved in the worst case. This algorithm also surpasses existing QLSA based solvers in three aspects: (1) A ( t ) does not need to be diagonalizable. (2) A ( t ) can be non-smooth, and is only of bounded variation. (3) It can use fewer queries to the initial state | ψ 0 ⟩ . Finally, we demonstrate the time-marching strategy with a first-order truncated Magnus series, which simplifies the implementation compared to high-order truncated Dyson series approach, while retaining the aforementioned benefits. Our analysis also raises some open questions concerning the differences between time-marching and QLSA based methods for solving differential equations.« less
5. Positivity-preserving and energy-dissipative finite difference schemes for the Fokker–Planck and Keller–Segel equations

   https://doi.org/10.1093/imanum/drac014  

   Hu, Jingwei ; Zhang, Xiangxiong ( May 2022 , IMA Journal of Numerical Analysis)

   Abstract In this work we introduce semi-implicit or implicit finite difference schemes for the continuity equation with a gradient flow structure. Examples of such equations include the linear Fokker–Planck equation and the Keller–Segel equations. The two proposed schemes are first-order accurate in time, explicitly solvable, and second-order and fourth-order accurate in space, which are obtained via finite difference implementation of the classical continuous finite element method. The fully discrete schemes are proved to be positivity preserving and energy dissipative: the second-order scheme can achieve so unconditionally while the fourth-order scheme only requires a mild time step and mesh size constraint. In particular, the fourth-order scheme is the first high order spatial discretization that can achieve both positivity and energy decay properties, which is suitable for long time simulation and to obtain accurate steady state solutions.