1,934 research outputs found
An efficient parallel immersed boundary algorithm using a pseudo-compressible fluid solver
We propose an efficient algorithm for the immersed boundary method on
distributed-memory architectures, with the computational complexity of a
completely explicit method and excellent parallel scaling. The algorithm
utilizes the pseudo-compressibility method recently proposed by Guermond and
Minev [Comptes Rendus Mathematique, 348:581-585, 2010] that uses a directional
splitting strategy to discretize the incompressible Navier-Stokes equations,
thereby reducing the linear systems to a series of one-dimensional tridiagonal
systems. We perform numerical simulations of several fluid-structure
interaction problems in two and three dimensions and study the accuracy and
convergence rates of the proposed algorithm. For these problems, we compare the
proposed algorithm against other second-order projection-based fluid solvers.
Lastly, the strong and weak scaling properties of the proposed algorithm are
investigated
A high-order semi-explicit discontinuous Galerkin solver for 3D incompressible flow with application to DNS and LES of turbulent channel flow
We present an efficient discontinuous Galerkin scheme for simulation of the
incompressible Navier-Stokes equations including laminar and turbulent flow. We
consider a semi-explicit high-order velocity-correction method for time
integration as well as nodal equal-order discretizations for velocity and
pressure. The non-linear convective term is treated explicitly while a linear
system is solved for the pressure Poisson equation and the viscous term. The
key feature of our solver is a consistent penalty term reducing the local
divergence error in order to overcome recently reported instabilities in
spatially under-resolved high-Reynolds-number flows as well as small time
steps. This penalty method is similar to the grad-div stabilization widely used
in continuous finite elements. We further review and compare our method to
several other techniques recently proposed in literature to stabilize the
method for such flow configurations. The solver is specifically designed for
large-scale computations through matrix-free linear solvers including efficient
preconditioning strategies and tensor-product elements, which have allowed us
to scale this code up to 34.4 billion degrees of freedom and 147,456 CPU cores.
We validate our code and demonstrate optimal convergence rates with laminar
flows present in a vortex problem and flow past a cylinder and show
applicability of our solver to direct numerical simulation as well as implicit
large-eddy simulation of turbulent channel flow at as well as
.Comment: 28 pages, in preparation for submission to Journal of Computational
Physic
Analysis of Iterative Methods for the Steady and Unsteady Stokes Problem: Application to Spectral Element Discretizations
A new and detailed analysis of the basic Uzawa algorithm for decoupling of the pressure and the velocity in the steady and unsteady Stokes operator is presented. The paper focuses on the following new aspects: explicit construction of the Uzawa pressure-operator spectrum for a semiperiodic model problem; general relationship of the convergence rate of the Uzawa procedure to classical inf-sup discretization analysis; and application of the method to high-order variational discretization
Adaptive time-stepping for incompressible flow. Part II: Navier-Stokes equations
We outline a new class of robust and efficient methods for solving the Navier- Stokes equations. We describe a general solution strategy that has two basic building blocks: an implicit time integrator using a stabilized trapezoid rule with an explicit Adams-Bashforth method for error control, and a robust Krylov subspace solver for the spatially discretized system. We present numerical experiments illustrating the potential of our approach. © 2010 Society for Industrial and Applied Mathematics
A matrix-free high-order discontinuous Galerkin compressible Navier-Stokes solver: A performance comparison of compressible and incompressible formulations for turbulent incompressible flows
Both compressible and incompressible Navier-Stokes solvers can be used and
are used to solve incompressible turbulent flow problems. In the compressible
case, the Mach number is then considered as a solver parameter that is set to a
small value, , in order to mimic incompressible flows.
This strategy is widely used for high-order discontinuous Galerkin
discretizations of the compressible Navier-Stokes equations. The present work
raises the question regarding the computational efficiency of compressible DG
solvers as compared to a genuinely incompressible formulation. Our
contributions to the state-of-the-art are twofold: Firstly, we present a
high-performance discontinuous Galerkin solver for the compressible
Navier-Stokes equations based on a highly efficient matrix-free implementation
that targets modern cache-based multicore architectures. The performance
results presented in this work focus on the node-level performance and our
results suggest that there is great potential for further performance
improvements for current state-of-the-art discontinuous Galerkin
implementations of the compressible Navier-Stokes equations. Secondly, this
compressible Navier-Stokes solver is put into perspective by comparing it to an
incompressible DG solver that uses the same matrix-free implementation. We
discuss algorithmic differences between both solution strategies and present an
in-depth numerical investigation of the performance. The considered benchmark
test cases are the three-dimensional Taylor-Green vortex problem as a
representative of transitional flows and the turbulent channel flow problem as
a representative of wall-bounded turbulent flows
- …