Multilevel preconditioners for Lagrange multipliers in domain imbedding.
In a recent paper [4] we have proposed and analysed a suitable mathematical model which describes the coupling of the Navier-Stokes with the Oseen equations. In this paper we propose a numerical solution of the coupled problem by subdomain splitting. After a preliminary analysis, we prove a convergence result for an iterative algorithm that alternates the solution of the Navier-Stokes problem to the one of the Oseen problem.
In a recent paper [4] we have proposed and analysed a suitable mathematical model which describes the coupling of the Navier-Stokes with the Oseen equations. In this paper we propose a numerical solution of the coupled problem by subdomain splitting. After a preliminary analysis, we prove a convergence result for an iterative algorithm that alternates the solution of the Navier-Stokes problem to the one of the Oseen problem.
In this paper, a multi-parameter error resolution technique is applied into a mixed finite element method for the Stokes problem. By using this technique and establishing a multi-parameter asymptotic error expansion for the mixed finite element method, an approximation of higher accuracy is obtained by multi-processor computers in parallel.
Numerical integration is an important operation for scientific computations. Although the different quadrature methods have been well studied from a mathematical point of view, the analysis of the actual error when performing the quadrature on a computer is often neglected. This step is however required for certified arithmetics. We study the Newton-Cotes quadrature scheme in the context of multiple-precision arithmetic and give enough details on the algorithms and the error bounds to enable software...
In this paper we introduce and analyze some non-overlapping multiplicative Schwarz methods for discontinuous Galerkin (DG) approximations of elliptic problems. The construction of the Schwarz preconditioners is presented in a unified framework for a wide class of DG methods. For symmetric DG approximations we provide optimal convergence bounds for the corresponding error propagation operator, and we show that the resulting methods can be accelerated by using suitable Krylov space solvers. A discussion...