A stable and optimal complexity solution method for mixed finite element discretizations
We outline a solution method for mixed finite element discretizations based on dissecting the problem into three separate steps. The first handles the inhomogeneous constraint, the second solves the flux variable from the homogeneous problem, whereas the third step, adjoint to the first, finally gives the Lagrangian multiplier. We concentrate on aspects involved in the first and third step mainly, and advertise a multi-level method that allows for a stable computation of the intermediate and final...
We propose a new reduced basis element-cum-component mode synthesis approach for parametrized elliptic coercive partial differential equations. In the Offline stage we construct a Library of interoperable parametrized reference components relevant to some family of problems; in the Online stage we instantiate and connect reference components (at ports) to rapidly form and query parametric systems. The method is based on static condensation at the interdomain level, a conforming eigenfunction “port”...
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.
We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lamé parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed...
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...
We investigate unilateral contact problems with cohesive forces, leading to the constrained minimization of a possibly nonconvex functional. We analyze the mathematical structure of the minimization problem. The problem is reformulated in terms of a three-field augmented Lagrangian, and sufficient conditions for the existence of a local saddle-point are derived. Then, we derive and analyze mixed finite element approximations to the stationarity conditions of the three-field augmented Lagrangian....
An iterative procedure containing two parameters for linear algebraic systems originating from the domain decomposition technique is proposed. The optimization of the parameters is investigated. A numeric example is given as an illustration.
We design an abstract setting for the approximation in Banach spaces of operators acting in duality. A typical example are the gradient and divergence operators in Lebesgue-Sobolev spaces on a bounded domain. We apply this abstract setting to the numerical approximation of Leray-Lions type problems, which include in particular linear diffusion. The main interest of the abstract setting is to provide a unified convergence analysis that simultaneously covers (i) all usual boundary conditions, (ii)...