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: A Fixed-Point Fast Sweeping WENO Method with Inverse Lax-Wendroff Boundary Treatment for Steady State of Hyperbolic Conservation Laws
Abstract Fixed-point fast sweeping WENO methods are a class of efficient high-order numerical methods to solve steady-state solutions of hyperbolic partial differential equations (PDEs). The Gauss-Seidel iterations and alternating sweeping strategy are used to cover characteristics of hyperbolic PDEs in each sweeping order to achieve fast convergence rate to steady-state solutions. A nice property of fixed-point 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 high-order finite difference methods on a Cartesian mesh are used to solve hyperbolic PDEs on complex domains, inverse Lax-Wendroff (ILW) procedures were developed as a very effective approach in the literature. In this paper, we combine a fifth-order fixed-point fast sweeping WENO method with an ILW procedure to solve steady-state 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 high-order accuracy and good performance of the method. Furthermore, the method is compared with the popular third-order total variation diminishing Runge-Kutta (TVD-RK3) time-marching method for steady-state computations. Numerical examples show that for most of examples, the fixed-point fast sweeping method saves more than half CPU time costs than TVD-RK3 to converge to steady-state solutions.  more » « less
Award ID(s):
2010107
PAR ID:
10364206
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
Springer Science + Business Media
Date Published:
Journal Name:
Communications on Applied Mathematics and Computation
Volume:
5
Issue:
1
ISSN:
2096-6385
Page Range / eLocation ID:
p. 403-427
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Essentially non-oscillatory (ENO) and weighted ENO (WENO) schemes were designed for solving hyperbolic and convection–diffusion equations with possibly discontinuous solutions or solutions with sharp gradient regions. The main idea of ENO and WENO schemes is actually an approximation procedure, aimed at achieving arbitrarily high-order accuracy in smooth regions and resolving shocks or other discontinuities sharply and in an essentially non-oscillatory fashion. Both finite volume and finite difference schemes have been designed using the ENO or WENO procedure, and these schemes are very popular in applications, most noticeably in computational fluid dynamics but also in other areas of computational physics and engineering. Since the main idea of the ENO and WENO schemes is an approximation procedure not directly related to partial differential equations (PDEs), ENO and WENO schemes also have non-PDE applications. In this paper we will survey the basic ideas behind ENO and WENO schemes, discuss their properties, and present examples of their applications to different types of PDEs as well as to non-PDE problems. 
    more » « less
  2. In this paper, we develop new high-order numerical methods for hyperbolic systems of non- linear partial differential equations (PDEs) with uncertainties. The new approach is realized in the semi-discrete finite-volume framework and is based on fifth-order weighted essen- tially non-oscillatory (WENO) interpolations in (multidimensional) random space combined with second-order piecewise linear reconstruction in physical space. Compared with spectral approximations in the random space, the presented methods are essentially non-oscillatory as they do not suffer from the Gibbs phenomenon while still achieving high-order accuracy. The new methods are tested on a number of numerical examples for both the Euler equations of gas dynamics and the Saint-Venant system of shallow-water equations. In the latter case, the methods are also proven to be well-balanced and positivity-preserving. 
    more » « less
  3. We propose a globally convergent numerical method to compute solutions to a general class of quasi-linear PDEs with both Neumann and Dirichlet boundary conditions. Combining the quasi-reversibility method and a suitable Carleman weight function, we define a map of which fixed point is the solution to the PDE under consideration. To find this fixed point, we define a recursive sequence with an arbitrary initial term using the same manner as in the proof of the contraction principle. Applying a Carleman estimate, we show that the sequence above converges to the desired solution. On the other hand, we also show that our method delivers reliable solutions even when the given data are noisy. Numerical examples are presented. 
    more » « less
  4. We present a spacetime DG method for 1D spatial domains and three linear hyperbolic, damped hyperbolic, and parabolic PDEs. The latter two correspond to Maxwell-Cattaneo-Vernotte (MCV) and Fourier heat conduction problems. The method is called the tent-pitcher spacetime DG method (tpSDG) due to its resemblance to the causal spacetime DG method (cSDG) wherein the solution advances in time by pitching spacetime patches. The tpSDG method extends the applicability of such methods from hyperbolic to parabolic and hyperbolic PDEs. For problems with a spatially uniform mesh, a transfer matrix approach is derived wherein the inflow, boundary, and source term values are mapped to the solution coefficient and output values. This resembles a finite difference scheme, but with grid points at the Gauss points of the spatial elements and arbitrarily tunable order of accuracy in spacetime. The spectral stability analysis of the method provides stability correction factors for the parabolic case. Numerical examples demonstrate the applicability of the method to problems with heterogeneous material properties. 
    more » « less
  5. Mathew, Sanu (Ed.)
    This article presents a 32-bit floating-point (FP32) programmable accelerator for solving a wide range of partial differential equations (PDEs) based on numerical integration methods. Compared to prior works that have fixed-point systems and are only applicable to specific types of PDEs, our proposed, integration accelerator for PDEs, named INTIACC, accelerator consists of 16 locally interconnected processing elements (PEs) where each PE is a fully programmable reduced instruction set computer (RISC) processor with an FP32 arithmetic logic unit (FP32 ALU) and a custom-designed instruction set architecture (ISA). These features enable INTIACC to generate solutions with high precision and a wide dynamic range and also allow users to implement different numerical algorithms to perform high-order integration methods and to evaluate nonlinear functions. In addition, we create a novel slow-global-fast-local clocking scheme in which PEs operate asynchronously with each other most of the time. We prototype the INTIACC test chip in 65 nm, with a core area of 0.975 mm2. Running at an average local clock frequency of 570 MHz at 1 V, it offers a single-precision computation throughput of 9.12 GFLOPS. Testing results show that with a similar energy-delay product, INTIACC is up to 40× faster than the prior state-of-the-art PDE solver. 
    more » « less