Results 1  10
of
28
Multigrid method for H(DIV) in three dimensions
 ETNA
, 1997
"... . We are concerned with the design and analysis of a multigrid algorithm for H(div; ## elliptic linear variational problems. The discretization is based on H(div; conforming RaviartThomas elements. A thorough examination of the relevant bilinear form reveals that a separate treatment of vector ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
(Show Context)
. We are concerned with the design and analysis of a multigrid algorithm for H(div; ## elliptic linear variational problems. The discretization is based on H(div; conforming RaviartThomas elements. A thorough examination of the relevant bilinear form reveals that a separate treatment of vector fields in the kernel of the divergence operator and its complement is paramount. We exploit the representation of discrete solenoidal vector fields as curls of finite element functions in socalled Nedelec spaces. It turns out that a combined nodal multilevel decomposition of both the RaviartThomas and Nedelec finite element spaces provides the foundation for a viable multigrid method. Its GauSeidel smoother involves an extra stage where solenoidal error components are tackled. By means of elaborate duality techniques we can show the asymptotic optimality in the case of uniform refinement. Numerical experiments confirm that the typical multigrid efficiency is actually achieved for model...
An Iterative Substructuring Method For RaviartThomas Vector Fields In Three Dimensions
 SIAM J. Numer. Anal
, 2000
"... . 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 differential equation is defined, into nonoverlapping substructures. The pr ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
. 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 differential equation is defined, into nonoverlapping substructures. The preconditioners of these conjugate gradient methods are then defined in terms of local problems defined on individual substructures and pairs of substructures, and, in addition, a global problem of low dimension. An iterative method of this kind is introduced for the lowest order RaviartThomas finite elements in three dimensions and it is shown that the condition number of the relevant operator is independent of the number of substructures and grows only as the square of the logarithm of the number of unknowns associated with an individual substructure. The theoretical bounds are confirmed by a series of numerical experiments. Key words. RaviartThomas finite elements, domain decomposition, ...
OPTIMIZED SCHWARZ METHODS FOR MAXWELL’S EQUATIONS
, 2009
"... Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, using characteristic transmission conditions, and it has been observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is i ..."
Abstract

Cited by 17 (14 self)
 Add to MetaCart
Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, using characteristic transmission conditions, and it has been observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for which overlap is essential for convergence. More recently, optimized Schwarz methods have been developed for elliptic partial differential equations. These methods use more effective transmission conditions between subdomains than the classical Dirichlet conditions, and optimized Schwarz methods can be used both with and without overlap for elliptic problems. We show here why the classical Schwarz method applied to both the time harmonic and time discretized Maxwell’s equations converges without overlap: the method has the same convergence factor as a simple optimized Schwarz method for a scalar elliptic equation. Based on this insight, we develop an entire new hierarchy of optimized overlapping and nonoverlapping Schwarz methods for Maxwell’s equations with greatly enhanced performance compared to the classical Schwarz method. We also derive for each algorithm asymptotic formulas for the optimized transmission conditions, which can easily be used in implementations of the algorithms for problems with variable coefficients. We illustrate our findings with numerical experiments.
An iterative substructuring method for Maxwell's equations in two dimensions
 Math. Comp
, 1998
"... Abstract. 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 ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
Abstract. 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 H 1,itisknownthat the number of conjugate gradient steps required to reduce the residual norm by a fixed factor is independent of the number of substructures, and that it grows only as the logarithm of the dimension of the local problem associated with an individual substructure. In this paper, the same result is established for similar iterative methods for loworder Nédélec finite elements, which approximate H(curl; Ω) in two dimensions. Results of numerical experiments are also provided. 1.
A POSTERIORI ERROR ESTIMATES FOR MAXWELL EQUATIONS
"... Maxwell equations are posed as variational boundary value problems in the function space H(curl) and are discretized by Nédélec finite elements. In [4], a residual type a posteriori error estimator was proposed and analyzed under certain conditions onto the domain. In the present paper, we prove th ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Maxwell equations are posed as variational boundary value problems in the function space H(curl) and are discretized by Nédélec finite elements. In [4], a residual type a posteriori error estimator was proposed and analyzed under certain conditions onto the domain. In the present paper, we prove the reliability of that error estimator on Lipschitz domains. The key is to establish new error estimates for the commuting quasiinterpolation operators introduced recently in [22]. Similar estimates are required for additive Schwarz preconditioning. To incorporate boundary conditions, we establish a new extension result.
A FETI Domain Decomposition Method For Maxwell's Equations With Discontinuous Coefficients In Two Dimensions
 Courant Institute, New York University
, 1999
"... . A class of FETI methods for the edge element approximation of vector eld problems in two dimensions is introduced and analyzed. First, an abstract framework is presented for the analysis of a class of FETI methods where a natural coarse problem, associated with the substructures, is lacking. Then, ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
. A class of FETI methods for the edge element approximation of vector eld problems in two dimensions is introduced and analyzed. First, an abstract framework is presented for the analysis of a class of FETI methods where a natural coarse problem, associated with the substructures, is lacking. Then, a family of FETI methods for edge element approximations is proposed. It is shown that the condition number of the corresponding method is independent of the number of substructures and grows only polylogarithmically with the number of unknowns associated with individual substructures. The estimate is also independent of the jumps of both of the coecients of the original problem. Numerical results validating the theoretical bounds are given. The method and its analysis can be easily generalized to Raviart{Thomas element approximations in two and three dimensions. Key words. Edge elements, Maxwell's equations, domain decomposition, FETI, preconditioners, heterogeneous coecients AMS subjec...
Overlapping Schwarz preconditioners for indefinite time harmonic Maxwell equations
 Math. Comp
, 2003
"... Abstract. Time harmonic Maxwell equations in lossless media lead to a second order differential equation for electric field involving a differential operator that is neither elliptic nor definite. A Galerkin method using Nedelec spaces can be employed to get approximate solutions numerically. The pr ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Time harmonic Maxwell equations in lossless media lead to a second order differential equation for electric field involving a differential operator that is neither elliptic nor definite. A Galerkin method using Nedelec spaces can be employed to get approximate solutions numerically. The problem of preconditioning the indefinite matrix arising from this method is discussed here. Specifically, two overlapping Schwarz methods will be shown to yield uniform preconditioners. 1.
Substructuring preconditioners for saddlepoint problems arising from Maxwell’s equations in three dimensions
, 2002
"... Abstract. This paper is concerned with the saddlepoint problems arising from edge element discretizations of Maxwell’s equations in a general three dimensional nonconvex polyhedral domain. A new augmented technique is first introduced to transform the problems into equivalent augmented saddlepoint ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
(Show Context)
Abstract. This paper is concerned with the saddlepoint problems arising from edge element discretizations of Maxwell’s equations in a general three dimensional nonconvex polyhedral domain. A new augmented technique is first introduced to transform the problems into equivalent augmented saddlepoint systems so that they can be solved by some existing preconditioned iterative methods. Then some substructuring preconditioners are proposed, with very simple coarse solvers, for the augmented saddlepoint systems. With the preconditioners, the condition numbers of the preconditioned systems are nearly optimal; namely, they grow only as the logarithm of the ratio between the subdomain diameter and the finite element mesh size.
Overlapping Schwarz methods in H(curl) on polyhedral domains
 Journal of Numerical Mathematics
"... Abstract. We consider domain decomposition preconditioners for the linear algebraic equations which result from finite element discretization of problems involving the bilinear form α(·, ·) + (curl ·, curl ·) defined on a polyhedral domain Ω. Here (·, ·) denotes the inner product in (L2(Ω))3 and α i ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract. We consider domain decomposition preconditioners for the linear algebraic equations which result from finite element discretization of problems involving the bilinear form α(·, ·) + (curl ·, curl ·) defined on a polyhedral domain Ω. Here (·, ·) denotes the inner product in (L2(Ω))3 and α is a positive number. We use Nedelec’s curlconforming finite elements to discretize the problem. Both additive and multiplicative overlapping Schwarz preconditioners are studied. Our results are uniform with respect to the mesh size and α under standard assumptions concerning the overlapping subdomains. 1.
An iterative substructuring algorithm for twodimensional problems in H(curl
, 2010
"... Abstract. A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for twodimensional problems in the space H0(curl; Ω). It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the dom ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
(Show Context)
Abstract. A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for twodimensional problems in the space H0(curl; Ω). It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the domain of the problem has been subdivided. The algorithm differs from others in three basic respects. First, it can be implemented in an algebraic manner that does not require access to individual subdomain matrices or a coarse discretization of the domain; this is in contrast to algorithms of the BDDC, FETI–DP, and classical two–level overlapping Schwarz families. Second, favorable condition number bounds can be established over a broader range of subdomain material properties than in previous studies. Third, we are able to develop theory for quite irregular subdomains and bounds for the condition number of our preconditioned conjugate gradient algorithm, which depend only on a few geometric parameters. The coarse space for the algorithm is based on simple energy minimization concepts, and its dimension equals the number of subdomain edges. Numerical results are presented which confirm the theory and demonstrate the usefulness of the algorithm for a variety of mesh decompositions and distributions of material properties. Key words. domain decomposition, iterative substructuring, H(curl), Maxwell’s equations, preconditioners, irregular subdomain boundaries, discontinuous coefficients