An iterative substructuring method for Maxwell's equations in two dimensions
نویسندگان
چکیده
منابع مشابه
An iterative substructuring method for Maxwell's equations in two dimensions
Iterative substructuring methods, also known as Schur complement methods, form an important family of domain decomposition algorithms. They are preconditioned conjugate gradient methods where solvers on local subregions and a solver on a coarse mesh are used to construct the preconditioner. For conforming finite element approximations of H1, it is known that the number of conjugate gradient ste...
متن کاملTwo iterative substructuring methods for Maxwell ’ s equations with discontinuous coefficients in two dimensions
In this paper, we present some numerical results for a Balancing and a FETI method for the solution of a linear system arising from the edge element approximation of a vector field problem in two dimensions. The two methods are presented as projected preconditioned conjugate algorithms and give comparable performances in our tests. Our numerical results show that their condition number is indep...
متن کاملAn Iterative Substructuring Algorithm for Problems in Three Dimensions
In domain decomposition algorithms with more than a few subdomains, there is a crucial need for a mechanism to provide for global communication of information at each step of the iterative process. The convergence rate will decay rapidly with an increasing number of subdomains if communication is only between neighboring subdomains. For iterative substructuring algorithms (those domain decompos...
متن کاملAn Iterative Substructuring Method for Raviart-Thomas Vector Fields in Three Dimensions
The iterative substructuring methods, also known as Schur complement methods, form one of two important families of domain decomposition algorithms. They are based on a partitioning of a given region, on which the partial diierential equation is deened, into non-overlapping substructures. The preconditioners of these conjugate gradient methods are then deened in terms of local problems deened o...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2000
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-00-01244-8