An official website of the United States government
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
Time filters and spurious acoustics in artificial compression methods
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
- Award ID(s):
- 2110379
- PAR ID:
- 10444418
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- Numerical Methods for Partial Differential Equations
- Volume:
- 38
- Issue:
- 6
- ISSN:
- 0749-159X
- Page Range / eLocation ID:
- p. 1908-1928
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
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
-
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
-
The exponential scaling of the quantum degrees of freedom with the size of the system is one of the biggest challenges in computational chemistry and particularly in quantum dynamics. We present a tensor network approach for the time-evolution of the nuclear degrees of freedom of multiconfigurational chemical systems at a reduced storage and computational complexity. We also present quantum algorithms for the resultant dynamics. To preserve the compression advantage achieved via tensor network decompositions, we present an adaptive algorithm for the regularization of nonphysical bond dimensions, preventing the potentially exponential growth of these with time. While applicable to any quantum dynamical problem, our method is particularly valuable for dynamical simulations of nuclear chemical systems. Our algorithm is demonstrated using ab initio potentials obtained for a symmetric hydrogen-bonded system, namely, the protonated 2,2′-bipyridine, and compared to exact diagonalization numerical results.more » « less
-
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
