This paper introduces alternating-direction implicit (ADI) solvers of higher order of timeaccuracy (orders two to six) for the compressible Navier-Stokes equations in two-and threedimensional curvilinear domains. The higher-order accuracy in time results from 1) An application of the backward differentiation formulae time-stepping algorithm (BDF) in conjunction with 2) A BDF-like extrapolation technique for certain components of the nonlinear terms (which makes use of nonlinear solves unnecessary), as well as 3) A novel application of the Douglas-Gunn splitting (which greatly facilitates handling of boundary conditions while preserving higher-order accuracy in time). As suggested by our theoretical analysis of the algorithms for a variety of special cases, an extensive set of numerical experiments clearly indicate that all of the BDFbased ADI algorithms proposed in this paper are "quasi-unconditionally stable" in the following sense: each algorithm is stable for all couples (h, ∆t) of spatial and temporal mesh sizes in a problem-dependent rectangular neighborhood of the form (0, M h ) × (0, M t ). In other words, for each fixed value of ∆t below a certain threshold, the Navier-Stokes solvers presented in this paper are stable for arbitrarily small spatial mesh-sizes. The second order formulation has further been rigorously shown to be unconditionally stable for linear hyperbolic and parabolic equations in two-dimensional space. Although implicit ADI solvers for the Navier-Stokes equations with nominal second-order of temporal accuracy have been proposed in the past, the algorithms presented in this paper are the first ADI-based Navier-Stokes solvers for which second order or better accuracy has been verified in practice under non-trivial (non-periodic) boundary conditions.
This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Highlights • Fast FC-based Implicit Navier Stokes solver. • Spectral algorithm for the Navier-Stokes equations in general domains. • Multi-domain parallel algorithm. • Implicit-explicit implementations exhibiting. • high-order convergence in space and time.
The companion paper "Higher-order in time quasi-unconditionally stable ADI solvers for the compressible Navier-Stokes equations in 2D and 3D curvilinear domains", which is referred to as Part I in what follows, introduces ADI (Alternating Direction Implicit) solvers of higher orders of temporal accuracy (orders s = 2 to 6) for the compressible Navier-Stokes equations in twoand three-dimensional space. The proposed methodology employs the backward differentiation formulae (BDF) together with a quasilinear-like formulation, high-order extrapolation for nonlinear components, and the Douglas-Gunn splitting. A variety of numerical results presented in Part I demonstrate in practice the theoretical convergence rates enjoyed by these algorithms, as well as their excellent accuracy and stability properties for a wide range of Reynolds numbers. In particular, the proposed schemes enjoy a certain property of "quasi-unconditional stability": for small enough (problem-dependent) fixed values of the time-step ∆t, these algorithms are stable for arbitrarily fine spatial discretizations. The present contribution presents a mathematical basis for the performance of these algorithms. Short of providing stability theorems for the full BDF-ADI Navier-Stokes solvers, this paper puts forth proofs of unconditional stability and quasi-unconditional stability for BDF-ADI schemes as well as some related un-split BDF schemes, for a variety of related linear model problems in one, two and three spatial dimensions, and for schemes of orders 2 ≤ s ≤ 6 of temporal accuracy. Additionally, a set of numerical tests presented in this paper for the compressible Navier-Stokes equation indicate that quasi-unconditional stability carries over to the fully non-linear context.
This paper further develops a recently proposed method for computing the diffraction integrals of optics based on sinc series approximation by presenting a numerical implementation, parameter selection criteria based on rigorous error analysis, and example optical propagation simulations demonstrating those criteria. Unlike fast Fourier transform (FFT)-based methods that are based on Fourier series, such as the well-known angular spectrum method (ASM), the sinc method uses a basis that is naturally suited to problems on an infinite domain. As such, it has been shown that the sinc method avoids the problems of artificial periodicity inherent in the ASM. After a brief review of the method, the detailed error analysis we provide confirms its super-algebraic convergence and verifies the claim that the accuracy of the method is independent of wavelength, propagation distance, and observation plane discretization; it depends only on the accuracy of the source field approximation. Based on this analysis, we derive parameter selection criteria for achieving a prescribed error tolerance, which will be valuable to potential users. Numerical simulations of Gaussian beam and optical phased array propagation verify the high-order accuracy and computational efficiency of the proposed algorithms. To facilitate the reproduction of numerical results, we provide a Matlab code that implements our numerical approach for the Fresnel diffraction integral. For comparison, we also present numerical results obtained with the ASM as well as the band-limited angular spectrum method.
The multiplicative (or geometric) calculus is a non-Newtonian calculus derived from an arithmetic in which the operations of addition/subtraction/multiplication are replaced by multiplication/division/exponentiation. A major difference between the multiplicative calculus and the classical additive calculus, and one that has important consequences in the simulation of wave propagation problems, is that in geometric calculus the role of polynomials is played by exponentials of a polynomial argument. For example, whereas a polynomial of degree one has constant (classical) derivative, it is the exponential function that has constant derivative in the multiplicative calculus. As we will show, this implies that even low-order finite quotient approximations-the analogues of finite differences in the multiplicative calculus-produce exact multiplicative derivatives of exponential functions. We exploit this fact to show that some partial differential equations (PDE) can be solved far more efficiently using techniques based on the multiplicative calculus. For wave propagation models in particular, we will show that it is possible to circumvent the minimum-points-per-wavelength sampling constraints of classical methods. In this first part we develop the theoretical framework for studying multiplicative partial differential equations and their connections with classical models.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.