An official website of the United States government
ABSTRACT In 1991 Ramshaw and Mesina proposed a novel synthesis of penalty methods and artificial compression methods. When the two were balanced they found the combination was 3–4 orders more accurate than either alone. This report begins developing a mathematical foundation addressing the reliability of their interesting method. We perform stability analysis, semi‐discrete error analysis, and tests of the algorithm.
more »
« less
An analysis of the Robert–Asselin time filter for the correction of nonphysical acoustics in an artificial compression method
Artificial compression methods create nonphysical acoustic waves. Time filters, often used in geophysical fluid dynamics, are shown in this paper to selectively damp these acoustics. We analyze the stability of a two‐step artificial compression method with the Robert–Asselin (RA) time filter, and provide tests delineating the filter's positive effects on both stability and accuracy.
more »
« less
- Award ID(s):
- 1817542
- PAR ID:
- 10461905
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- Numerical Methods for Partial Differential Equations
- Volume:
- 35
- Issue:
- 3
- ISSN:
- 0749-159X
- Page Range / eLocation ID:
- p. 916-935
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Artificial compression methods are used in computational fluid dynamics as a cost‐effective way of solving for the velocity and pressure in a flow. However, relaxation of compressibility in these algorithms yields nonphysical oscillations in the pressure. This report presents analysis and computational tests of time filters to reduce nonphysical acoustic waves in artificial compression methods.more » « less
-
Abstract We develop two totally decoupled, linear and second‐order accurate numerical methods that are unconditionally energy stable for solving the Cahn–Hilliard–Darcy equations for two phase flows in porous media or in a Hele‐Shaw cell. The implicit‐explicit Crank–Nicolson leapfrog method is employed for the discretization of the Cahn–Hiliard equation to obtain linear schemes. Furthermore the artificial compression technique and pressure correction methods are utilized, respectively, so that the Cahn–Hiliard equation and the update of the Darcy pressure can be solved independently. We establish unconditionally long time stability of the schemes. Ample numerical experiments are performed to demonstrate the accuracy and robustness of the numerical methods, including simulations of the Rayleigh–Taylor instability, the Saffman–Taylor instability (fingering phenomenon).more » « less
-
null (Ed.)Abstract This report presents adaptive artificial compression methods in which the time-step and artificial compression parameter ε are independently adapted. The resulting algorithms are supported by analysis and numerical tests. The first and second-order methods are embedded. As a result, the computational, cognitive, and space complexities of the adaptive ε , k algorithms are negligibly greater than that of the simplest, first-order, constant ε , constant k artificial compression method.more » « less
-
Summary We propose and analyze an efficient ensemble algorithm with artificial compressibility (AC) for fast decoupled computation of multiple realizations of the stochastic Stokes‐Darcy model with random hydraulic conductivity (including the one in the interface conditions), source terms, and initial conditions. The solutions are found by solving three smaller decoupled subproblems with two common time‐independent coefficient matrices for all realizations, which significantly improves the efficiency for both assembling and solving the matrix systems. The fully coupled Stokes‐Darcy system can be first decoupled into two smaller subphysics problems by the idea of the partitioned time stepping, which reduces the size of the linear systems and allows parallel computing for each subphysics problem. The AC further decouples the velocity and pressure which further reduces storage requirements and improves computational efficiency. We prove the long time stability and the convergence for this new ensemble method. Three numerical examples are presented to support the theoretical results and illustrate the features of the algorithm, including the convergence, stability, efficiency, and applicability.more » « less
