An Optimal Preconditioner for a Class of Saddle Point Problems with a Penalty Term, Part Ii: General Theory
نویسنده
چکیده
Iterative methods are considered for saddle point problems with a penalty term. A positive deenite preconditioner is constructed and it is proved that the condition number of the preconditioned system can be made independent of the discretization and the penalty parameters. Examples include the pure displacement problem in linear elasticity, the Timoshenko beam, and the Mindlin-Reissner plate. 1. Introduction. In this article, we extend the preconditioning strategy for saddle point problems with a penalty term, discussed in Klawonn 15], to a more general class of problems, including the Timoshenko beam and the Mindlin-Reissner plate. We consider problems of the form a(u; v) + b(v; p) = (f; v) 0 8v 2 V; b(u; q) ? t 2 c(p; q) = (g; q) 0 8q 2 M c t 2 0; 1]; where V; M and M c are Hilbert spaces with M c dense in M: In 15], we required that a(;) be V-elliptic and c(;) be equivalent to the L 2-inner product. In this paper, we prove that the condition number of the preconditioned system is bounded from above, independently of the discretization and the penalty parameters, if only the assumptions of the Babu ska-Brezzi theory hold, i.e. i) a(;) is elliptic on V 0 := fv 2 V : b(v; q) = 0 8q 2 Mg; ii) b(;) fulllls an inf-sup condition and iii) c(;) is non-negative. From these conditions, one can obtain an inf-sup and a sup-sup condition for the bilinear form A((u; p); (v; q)) := a(u; v) + b(v; p) + b(u; q) ? t 2 c(p; q) deened on the space X := V M c : The proof of the bound of the condition number is based mainly on the interpretation of these inf-sup and sup-sup conditions as providing an estimate for the condition number of A(;): Our preconditioning strategy can then be interpreted as introducing a new metric on V M c , i.e. performing a change of basis. Let us point out that a unifying multigrid approach for saddle point problems with a penalty term is developed in Brenner 8].
منابع مشابه
A discontinuous Galerkin method for optimal control problems governed by a system of convection-diffusion PDEs with nonlinear reaction terms
In this paper, we study the numerical solution of optimal control problems governed by a system of convection diffusion PDEs with nonlinear reaction terms, arising from chemical processes. The symmetric interior penalty Galerkin (SIPG) method with upwinding for the convection term is used for discretization. Residual-based error estimators are used for the state, the adjoint and the control var...
متن کاملDomain Decomposition Algorithms for Saddle Point Problems
In this paper, we introduce some domain decomposition methods for saddle point problems with or without a penalty term, such as the Stokes system and the mixed formulation of linear elasticity. We also consider more general nonsymmetric problems, such as the Oseen system, which are no longer saddle point problems but can be studied in the same abstract framework which we adopt. Several approach...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملUniform preconditioners for a parameter dependent saddle point problem with application to generalized Stokes interface equations
We consider an abstract parameter dependent saddle-point problem and present a general framework for analyzing robust Schur complement preconditioners. The abstract analysis is applied to a generalized Stokes problem, which yields robustness of the Cahouet-Chabard preconditioner. Motivated by models for two-phase incompressible flows we consider a generalized Stokes interface problem. Applicati...
متن کامل