1,616 research outputs found
Preconditioning of a hybridized discontinuous Galerkin finite element method for the Stokes equations
We present optimal preconditioners for a recently introduced hybridized
discontinuous Galerkin finite element discretization of the Stokes equations.
Typical of hybridized discontinuous Galerkin methods, the method has
degrees-of-freedom that can be eliminated locally (cell-wise), thereby
significantly reducing the size of the global problem. Although the linear
system becomes more complex to analyze after static condensation of these
element degrees-of-freedom, the pressure Schur complement of the original and
reduced problem are the same. Using this fact, we prove spectral equivalence of
this Schur complement to two simple matrices, which is then used to formulate
optimal preconditioners for the statically condensed problem. Numerical
simulations in two and three spatial dimensions demonstrate the good
performance of the proposed preconditioners
On the role of commutator arguments in the development of parameter-robust preconditioners for Stokes control problems
The development of preconditioners for PDE-constrained optimization problems is a field of numerical analysis which has recently generated much interest. One class of problems which has been investigated in particular is that of Stokes control problems, that is the problem of minimizing a functional with the Stokes (or Navier-Stokes) equations as constraints. In this manuscript, we present an approach for preconditioning Stokes control problems using preconditioners for the Poisson control problem and, crucially, the application of a commutator argument. This methodology leads to two block diagonal preconditioners for the problem, one of which was previously derived by W. Zulehner in 2011 (SIAM. J. Matrix Anal. & Appl., v.32) using a nonstandard norm argument for this saddle point problem, and the other of which we believe to be new. We also derive two related block triangular preconditioners using the same methodology, and present numerical results to demonstrate the performance of the four preconditioners in practice
Robust Preconditioners for Incompressible MHD Models
In this paper, we develop two classes of robust preconditioners for the
structure-preserving discretization of the incompressible magnetohydrodynamics
(MHD) system. By studying the well-posedness of the discrete system, we design
block preconditioners for them and carry out rigorous analysis on their
performance. We prove that such preconditioners are robust with respect to most
physical and discretization parameters. In our proof, we improve the existing
estimates of the block triangular preconditioners for saddle point problems by
removing the scaling parameters, which are usually difficult to choose in
practice. This new technique is not only applicable to the MHD system, but also
to other problems. Moreover, we prove that Krylov iterative methods with our
preconditioners preserve the divergence-free condition exactly, which
complements the structure-preserving discretization. Another feature is that we
can directly generalize this technique to other discretizations of the MHD
system. We also present preliminary numerical results to support the
theoretical results and demonstrate the robustness of the proposed
preconditioners
Some Preconditioning Techniques for Saddle Point Problems
Saddle point problems arise frequently in many applications in science and engineering, including constrained optimization, mixed finite element formulations of partial differential equations, circuit analysis, and so forth. Indeed the formulation of most problems with constraints gives rise to saddle point systems. This paper provides a concise overview of iterative approaches for the solution of such systems which are of particular importance in the context of large scale computation. In particular we describe some of the most useful preconditioning techniques for Krylov subspace solvers applied to saddle point problems, including block and constrained preconditioners.\ud
\ud
The work of Michele Benzi was supported in part by the National Science Foundation grant DMS-0511336
Preconditioning and fast solvers for incompressible flow
We give a brief description with references of work on fast solution methods for incompressible Navier-Stokes problems which has been going on for about a decade. Specifically we describe preconditioned iterative strategies which involve the use of simple multigrid cycles for subproblems
The LifeV library: engineering mathematics beyond the proof of concept
LifeV is a library for the finite element (FE) solution of partial
differential equations in one, two, and three dimensions. It is written in C++
and designed to run on diverse parallel architectures, including cloud and high
performance computing facilities. In spite of its academic research nature,
meaning a library for the development and testing of new methods, one
distinguishing feature of LifeV is its use on real world problems and it is
intended to provide a tool for many engineering applications. It has been
actually used in computational hemodynamics, including cardiac mechanics and
fluid-structure interaction problems, in porous media, ice sheets dynamics for
both forward and inverse problems. In this paper we give a short overview of
the features of LifeV and its coding paradigms on simple problems. The main
focus is on the parallel environment which is mainly driven by domain
decomposition methods and based on external libraries such as MPI, the Trilinos
project, HDF5 and ParMetis.
Dedicated to the memory of Fausto Saleri.Comment: Review of the LifeV Finite Element librar
- …