1,405 research outputs found
Discrete compactness for the hp version of rectangular edge finite elements
International audienceDiscretization of Maxwell eigenvalue problems with edge finite elements involves a simultaneous use of two discrete subspaces of H^1 and H(rot), reproducing the exact sequence condition. Kikuchi's Discrete Compactness Property, along with appropriate approximability conditions, implies the convergence of discrete eigenpairs to the exact ones. In this paper we prove the discrete compactness property for the edge element approximation of Maxwell's eigenpairs on general hp adaptive rectangular meshes. Hanging nodes, yielding 1-irregular meshes, are covered, and the order of the used elements can vary from one rectangle to another, thus allowing for a real hp adaptivity. As a particular case, our analysis covers the convergence result for the p-method
The hp-BEM with quasi-uniform meshes for the electric field integral equation on polyhedral surfaces: a priori error analysis
This paper presents an a priori error analysis of the hp-version of the
boundary element method for the electric field integral equation on a piecewise
plane (open or closed) Lipschitz surface. We use H(div)-conforming
discretisations with Raviart-Thomas elements on a sequence of quasi-uniform
meshes of triangles and/or parallelograms. Assuming the regularity of the
solution to the electric field integral equation in terms of Sobolev spaces of
tangential vector fields, we prove an a priori error estimate of the method in
the energy norm. This estimate proves the expected rate of convergence with
respect to the mesh parameter h and the polynomial degree p
On the convergence of the hp-BEM with quasi-uniform meshes for the electric field integral equation on polyhedral surfaces
In this paper the hp-version of the boundary element method is applied to the electric field integral equation on a piecewise plane (open or closed) Lipschitz surface. The underlying meshes are supposed to be quasi-uniform. We use \bH(\div)-conforming discretisations with quadrilateral elements of Raviart-Thomas type and establish quasi-optimal convergence of hp-approximations. Main ingredient of our analysis is a new \tilde\bH^{-1/2}(\div)-conforming p-interpolation operator that assumes only \bH^r\cap\tilde\bH^{-1/2}(\div)-regularity () and for which we show quasi-stability with respect to polynomial degrees
Discrete compactness for the p-version of discrete differential forms
In this paper we prove the discrete compactness property for a wide class of
p-version finite element approximations of non-elliptic variational eigenvalue
problems in two and three space dimensions. In a very general framework, we
find sufficient conditions for the p-version of a generalized discrete
compactness property, which is formulated in the setting of discrete
differential forms of any order on a d-dimensional polyhedral domain. One of
the main tools for the analysis is a recently introduced smoothed Poincar\'e
lifting operator [M. Costabel and A. McIntosh, On Bogovskii and regularized
Poincar\'e integral operators for de Rham complexes on Lipschitz domains, Math.
Z., (2010)]. For forms of order 1 our analysis shows that several widely used
families of edge finite elements satisfy the discrete compactness property in
p-version and hence provide convergent solutions to the Maxwell eigenvalue
problem. In particular, N\'ed\'elec elements on triangles and tetrahedra (first
and second kind) and on parallelograms and parallelepipeds (first kind) are
covered by our theory
On variational eigenvalue approximation of semidefinite operators
Eigenvalue problems for semidefinite operators with infinite dimensional
kernels appear for instance in electromagnetics. Variational discretizations
with edge elements have long been analyzed in terms of a discrete compactness
property. As an alternative, we show here how the abstract theory can be
developed in terms of a geometric property called the vanishing gap condition.
This condition is shown to be equivalent to eigenvalue convergence and
intermediate between two different discrete variants of Friedrichs estimates.
Next we turn to a more practical means of checking these properties. We
introduce a notion of compatible operator and show how the previous conditions
are equivalent to the existence of such operators with various convergence
properties. In particular the vanishing gap condition is shown to be equivalent
to the existence of compatible operators satisfying an Aubin-Nitsche estimate.
Finally we give examples demonstrating that the implications not shown to be
equivalences, indeed are not.Comment: 26 page
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of
preventing electoral manipulation and pursuing an impartial electoral
mechanism. Political districting can be modelled as multiobjective partitioning of a graph into connected components, where population equality and compactness must hold if a majority voting rule is adopted. This leads to the formulation of combinatorial optimization problems that are extremely hard to solve exactly. We propose a class of heuristics, based on discrete weighted Voronoi regions, for obtaining compact and balanced districts, and discuss some formal properties of these algorithms. Their performance has been tested on randomly generated rectangular grids, as well as on real-life benchmarks; for the latter instances the resulting district maps are compared with the institutional ones adopted in the Italian political elections from 1994 to 2001
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of
preventing electoral manipulation and pursuing an impartial electoral
mechanism. Political districting can be modelled as multiobjective partitioning of a graph into connected components, where population equality and compactness must hold if a majority voting rule is adopted. This leads to the formulation of combinatorial optimization problems that are extremely hard to solve exactly. We propose a class of heuristics, based on discrete weighted Voronoi regions, for obtaining compact and balanced districts, and discuss some formal properties of these algorithms. Their performance has been tested on randomly generated rectangular grids, as well as on real-life benchmarks; for the latter instances the resulting district maps are compared with the institutional ones adopted in the Italian political elections from 1994 to 2001
Optimal error estimation for H(curl)-conforming p-interpolation in two dimensions
In this paper we prove an optimal error estimate for the H(curl)-conforming
projection based p-interpolation operator introduced in [L. Demkowicz and I.
Babuska, p interpolation error estimates for edge finite elements of variable
order in two dimensions, SIAM J. Numer. Anal., 41 (2003), pp. 1195-1208]. This
result is proved on the reference element (either triangle or square) K for
regular vector fields in H^r(curl,K) with arbitrary r>0. The formulation of the
result in the H(div)-conforming setting, which is relevant for the analysis of
high-order boundary element approximations for Maxwell's equations, is provided
as well
- …