Displaying similar documents to “Analysis and finite element error estimates for the velocity tracking problem for Stokes flows via a penalized formulation”

A splitting method using discontinuous Galerkin for the transient incompressible Navier-Stokes equations

Vivette Girault, Béatrice Rivière, Mary F. Wheeler (2005)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

In this paper we solve the time-dependent incompressible Navier-Stokes equations by splitting the non-linearity and incompressibility, and using discontinuous or continuous finite element methods in space. We prove optimal error estimates for the velocity and suboptimal estimates for the pressure. We present some numerical experiments.

Error estimates for the numerical approximation of semilinear elliptic control problems with finitely many state constraints

Eduardo Casas (2002)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The goal of this paper is to derive some error estimates for the numerical discretization of some optimal control problems governed by semilinear elliptic equations with bound constraints on the control and a finitely number of equality and inequality state constraints. We prove some error estimates for the optimal controls in the L ∞ norm and we also obtain error estimates for the Lagrange multipliers associated to the state constraints as well as for the optimal states and optimal adjoint...

On nonoverlapping domain decomposition methods for the incompressible Navier-Stokes equations

Xuejun Xu, C. O. Chow, S. H. Lui (2005)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

In this paper, a Dirichlet-Neumann substructuring domain decomposition method is presented for a finite element approximation to the nonlinear Navier-Stokes equations. It is shown that the Dirichlet-Neumann domain decomposition sequence converges geometrically to the true solution provided the Reynolds number is sufficiently small. In this method, subdomain problems are linear. Other version where the subdomain problems are linear Stokes problems is also presented.