132 research outputs found
Time-parallel iterative solvers for parabolic evolution equations
We present original time-parallel algorithms for the solution of the implicit
Euler discretization of general linear parabolic evolution equations with
time-dependent self-adjoint spatial operators. Motivated by the inf-sup theory
of parabolic problems, we show that the standard nonsymmetric time-global
system can be equivalently reformulated as an original symmetric saddle-point
system that remains inf-sup stable with respect to the same natural parabolic
norms. We then propose and analyse an efficient and readily implementable
parallel-in-time preconditioner to be used with an inexact Uzawa method. The
proposed preconditioner is non-intrusive and easy to implement in practice, and
also features the key theoretical advantages of robust spectral bounds, leading
to convergence rates that are independent of the number of time-steps, final
time, or spatial mesh sizes, and also a theoretical parallel complexity that
grows only logarithmically with respect to the number of time-steps. Numerical
experiments with large-scale parallel computations show the effectiveness of
the method, along with its good weak and strong scaling properties
A class of nonsymmetric preconditioners for saddle point problems
For iterative solution of saddle point problems, a nonsymmetric preconditioning is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where the SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves solution of a Schur complement system, an inexact form of the preconditioner can be of interest. This results in an inner-outer iterative process. Numerical experiments with solution of linearized Navier-Stokes equations demonstrate efficiency of the new preconditioner, especially when the left-upper block is far from symmetric
Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems
AbstractNonsymmetric saddle point problems arise in a wide variety of applications in computational science and engineering. The aim of this paper is to discuss the numerical behavior of several nonsymmetric iterative methods applied for solving the saddle point systems via the Schur complement reduction or the null-space projection approach. Krylov subspace methods often produce the iterates which fluctuate rather strongly. Here we address the question whether large intermediate approximate solutions reduce the final accuracy of these two-level (inner–outer) iteration algorithms. We extend our previous analysis obtained for symmetric saddle point problems and distinguish between three mathematically equivalent back-substitution schemes which lead to a different numerical behavior when applied in finite precision arithmetic. Theoretical results are then illustrated on a simple model example
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
- …