A BDDC (Balancing Domain Decomposition by Constraints) algorithm is developed and analyzed for a staggered discontinuous Galerkin (DG) finite element approximation of second order scalar elliptic problems. On a quite irregular subdomain partition, an optimal condition number bound is proved for two-dimensional problems. In addition, a sub-optimal but scalable condition number bound is obtained for three-dimensional problems. These bounds are shown to be independent of coefficient jumps in the subdomain partition. Numerical results are also included to show the performance of the algorithm.

The subject of the paper is Schrdinger operators on tree graphs which are radial, having the branching number bn at all the vertices at the distance tn from the root. We consider a family of coupling conditions at the vertices characterized by (bn1)2+4 real parameters. We prove that if the graph is sparse so that there is a subsequence of {tn+1tn} growing to infinity, in the absence of the potential the absolutely continuous spectrum is empty for a large subset of these vertex couplings, but on the the other hand, there are cases when the spectrum of such a Schrdinger operator can be purely absolutely continuous.

No abstract uploaded!

Some electromagnetic materials exhibit, in a given frequency range, effective dielectric permittivity and/or magnetic permeability which are negative. In the literature, they are called negative index materials, left-handed materials or meta-materials. We propose in this paper a numerical method to solve a wave transmission between a classical dielectric material and a meta-material. The method we investigate can be considered as an alternative method compared to the method presented by the second author and co-workers. In particular, we shall use the abstract framework they developed to prove well-posedness of the exact problem. We recast this problem to fit later discretization by the staggered discontinuous Galerkin method developed by the first author and co-worker, a method which relies on introducing an auxiliary unknown. Convergence of the numerical method is proven, with the help of explicit infsup

We study disjointness preserving (quasi-) n-shift operators on C 0 (X), where X is locally compact and Hausdorff. When C 0 (X) admits a quasi-n-shift T, there is a countable subset of X= X{} equipped with a tree-like structure, called -tree, with exactly n joints such that the action of T on C 0 (X) can be implemented as a shift on the -tree. If T is an n-shift, then the -tree is dense in X and thus X is separable. By analyzing the structure of the -tree, we show that every (quasi-) n-shift on c 0 can always be written as a product of n (quasi-) 1-shifts. Although it is not the case for general C 0 (X) as shown by our counter examples, we can do so after dilation.