3,126 research outputs found
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
Order-of-magnitude speedup for steady states and traveling waves via Stokes preconditioning in Channelflow and Openpipeflow
Steady states and traveling waves play a fundamental role in understanding
hydrodynamic problems. Even when unstable, these states provide the
bifurcation-theoretic explanation for the origin of the observed states. In
turbulent wall-bounded shear flows, these states have been hypothesized to be
saddle points organizing the trajectories within a chaotic attractor. These
states must be computed with Newton's method or one of its generalizations,
since time-integration cannot converge to unstable equilibria. The bottleneck
is the solution of linear systems involving the Jacobian of the Navier-Stokes
or Boussinesq equations. Originally such computations were carried out by
constructing and directly inverting the Jacobian, but this is unfeasible for
the matrices arising from three-dimensional hydrodynamic configurations in
large domains. A popular method is to seek states that are invariant under
numerical time integration. Surprisingly, equilibria may also be found by
seeking flows that are invariant under a single very large Backwards-Euler
Forwards-Euler timestep. We show that this method, called Stokes
preconditioning, is 10 to 50 times faster at computing steady states in plane
Couette flow and traveling waves in pipe flow. Moreover, it can be carried out
using Channelflow (by Gibson) and Openpipeflow (by Willis) without any changes
to these popular spectral codes. We explain the convergence rate as a function
of the integration period and Reynolds number by computing the full spectra of
the operators corresponding to the Jacobians of both methods.Comment: in Computational Modelling of Bifurcations and Instabilities in Fluid
Dynamics, ed. Alexander Gelfgat (Springer, 2018
Preconditioning for Allen-Cahn variational inequalities with non-local constraints
The solution of Allen-Cahn variational inequalities with mass constraints is of interest in many applications. This problem can be solved both in its scalar and vector-valued form as a PDE-constrained optimization problem by means of a primal-dual active set method. At the heart of this method lies the solution of linear systems in saddle point form. In this paper we propose the use of Krylov-subspace solvers and suitable preconditioners for the saddle point systems. Numerical results illustrate the competitiveness of this approach
Robust and parallel scalable iterative solutions for large-scale finite cell analyses
The finite cell method is a highly flexible discretization technique for
numerical analysis on domains with complex geometries. By using a non-boundary
conforming computational domain that can be easily meshed, automatized
computations on a wide range of geometrical models can be performed.
Application of the finite cell method, and other immersed methods, to large
real-life and industrial problems is often limited due to the conditioning
problems associated with these methods. These conditioning problems have caused
researchers to resort to direct solution methods, which signifi- cantly limit
the maximum size of solvable systems. Iterative solvers are better suited for
large-scale computations than their direct counterparts due to their lower
memory requirements and suitability for parallel computing. These benefits can,
however, only be exploited when systems are properly conditioned. In this
contribution we present an Additive-Schwarz type preconditioner that enables
efficient and parallel scalable iterative solutions of large-scale multi-level
hp-refined finite cell analyses.Comment: 32 pages, 17 figure
Constraint interface preconditioning for topology optimization problems
The discretization of constrained nonlinear optimization problems arising in
the field of topology optimization yields algebraic systems which are
challenging to solve in practice, due to pathological ill-conditioning, strong
nonlinearity and size. In this work we propose a methodology which brings
together existing fast algorithms, namely, interior-point for the optimization
problem and a novel substructuring domain decomposition method for the ensuing
large-scale linear systems. The main contribution is the choice of interface
preconditioner which allows for the acceleration of the domain decomposition
method, leading to performance independent of problem size.Comment: To be published in SIAM J. Sci. Com
- …