Schwarz Analysis of an Iterative Substructuring Algorithm for P1 Nonconforming Finite Elements
نویسنده
چکیده
We give an iterative substructuring algorithm for the P1 nonconforming nite element approximation of a second order elliptic problem in dimension two. The algorithm and its convergence analysis are based on an abstract framework of the Schwarz method. A bound is established for the condition number of this iterative method which grows only logarithmically with the number of degrees of freedom. We olso give an application of this method to the lowest order Raviart-Thomas mixed method.
منابع مشابه
A Numerical Study of FETI Algorithms for Mortar Finite Element Methods
The Finite Element Tearing and Interconnecting (FETI) method is an iterative substructuring method using Lagrange multipliers to enforce the continuity of the nite element solution across the subdomain interface. Mortar nite elements are nonconforming nite elements that allow for a geometrically nonconforming decomposition of the computational domain into subregions and, at the same time, for t...
متن کاملReducing Computational and Memory Cost of Substructuring Technique in Finite Element Models
Substructuring in the finite element method is a technique that reduces computational cost and memory usage for analysis of complex structures. The efficiency of this technique depends on the number of substructures in different problems. Some subdivisions increase computational cost, but require little memory usage and vice versa. In the present study, the cost functions of computations and me...
متن کاملA New Cement to Glue Nonconforming Grids with Robin Interface Conditions: The Finite Element Case
We present and analyze a new nonconforming domain decomposition method based on a Schwarz method with Robin transmission conditions. We prove that the method is well posed and convergent. Our error analysis is valid in two dimensions for piecewise polynomials of low and high order and also in three dimensions for P1 elements. We further present an efficient algorithm in two dimensions to perfor...
متن کاملAn Iterative Substructuring Method for the Discretized Stokes Equations by a Stabilized Finite Element Method
Abstract. A simple algorithm of iterative substructuring method as the same way of elasticity problem is proposed for a discretized Stokes equation by P1/P1 element and penalty stabilization technique. Owing to the stability term, solvabilities of local Dirichlet problem, of local Neumann problem for preconditioner, and of the coarse space problem are ensured. Conjugate gradient method with pre...
متن کاملGeneralized Neumann-neumann Preconditioners for Iterative Substructuring
One of the primary objective of domain decomposition methods is the eecient solution on parallel machines of problems in Computational Mechanics set on complex ge-ometries and approximated on very ne grids. In iterative substructuring, this objective is achieved by splitting the original domain of computation in smaller nonoverlapping simpler subdomains, and by reducing the initial problem to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007