A parallel splitting-up method for partial differential equations and its applications to Navier-Stokes equations
We formulate and study numerically a new, parameter-free stabilized finite element method for advection-diffusion problems. Using properties of compatible finite element spaces we establish connection between nodal diffusive fluxes and one-dimensional diffusion equations on the edges of the mesh. To define the stabilized method we extend this relationship to the advection-diffusion case by solving simplified one-dimensional versions of the governing equations on the edges. Then we use H(curl)-conforming...
In this article we develop a posteriori error estimates for second order linear elliptic problems with point sources in two- and three-dimensional domains. We prove a global upper bound and a local lower bound for the error measured in a weighted Sobolev space. The weight considered is a (positive) power of the distance to the support of the Dirac delta source term, and belongs to the Muckenhoupt’s class A2. The theory hinges on local approximation properties of either Clément or Scott–Zhang interpolation...
In this paper we combine the dual-mixed finite element method with a Dirichlet-to-Neumann mapping (given in terms of a boundary integral operator) to solve linear exterior transmission problems in the plane. As a model we consider a second order elliptic equation in divergence form coupled with the Laplace equation in the exterior unbounded region. We show that the resulting mixed variational formulation and an associated discrete scheme using Raviart-Thomas spaces are well posed, and derive the...
The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...
The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...
The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...
We introduce and analyze a fully-mixed finite element method for a fluid-solid interaction problem in 2D. The model consists of an elastic body which is subject to a given incident wave that travels in the fluid surrounding it. Actually, the fluid is supposed to occupy an annular region, and hence a Robin boundary condition imitating the behavior of the scattered field at infinity is imposed on its exterior boundary, which is located far from the obstacle. The media are governed by the elastodynamic...
In 1995, Wahbin presented a method for superconvergence analysis called “Interior symmetric method,” and declared that it is universal. In this paper, we carefully examine two superconvergence techniques used by mathematicians both in China and in America. We conclude that they are essentially different.
The computation of glacier movements leads to a system of nonlinear partial differential equations. The existence and uniqueness of a weak solution is established by using the calculus of variations. A discretization by the finite element method is done. The solution of the discrete problem is proved to be convergent to the exact solution. A first simple numerical algorithm is proposed and its convergence numerically studied.
In this paper, we present a superconvergence result for the mixed finite element approximations of general second order elliptic eigenvalue problems. It is known that a superconvergence result has been given by Durán et al. [Math. Models Methods Appl. Sci. 9 (1999) 1165–1178] and Gardini [ESAIM: M2AN 43 (2009) 853–865] for the lowest order Raviart-Thomas approximation of Laplace eigenvalue problems. In this work, we introduce a new way to derive the superconvergence of general second order elliptic...
In this paper, we present a superconvergence result for the mixed finite element approximations of general second order elliptic eigenvalue problems. It is known that a superconvergence result has been given by Durán et al. [Math. Models Methods Appl. Sci. 9 (1999) 1165–1178] and Gardini [ESAIM: M2AN 43 (2009) 853–865] for the lowest order Raviart-Thomas approximation of Laplace eigenvalue problems. In this work, we introduce a new way to derive the superconvergence of general second order elliptic...
In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal residual method with a measure of the residual corresponding to the error in a specified solution norm. The residual norm can be designed such that the resulting low-rank approximations are optimal with respect to particular norms of interest, thus allowing to take...