Abstract BDDC and FETI-DP algorithms are developed for three-dimensional elliptic problems with adaptively enriched coarse components. It is known that these enriched components are necessary in the development of robust preconditioners. To form the adaptive coarse components, carefully designed generalized eigenvalue problems are introduced for each faces and edges, and the coarse components are formed by using eigenvectors with their corresponding eigenvalues larger than a given tolerance T O L. Upper bounds for condition numbers of the preconditioned systems are shown to be C T O L, with the constant C depending only on the maximum number of edges and faces per subdomain, and the maximum number of subdomains sharing an edge. Numerical results are presented to test the robustness of the proposed approach.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

In this paper, we study the superconvergence behavior of discontinuous Galerkin methods using upwind numerical fluxes for one-dimensional linear hyperbolic equations with degenerate variable coefficients. The study establishes superconvergence results for the flux function approximation as well as for the DG solution itself. To be more precise, we first prove that the DG flux function is superconvergent towards a particular flux function of the exact solution, with an order of $O(h^{k+2})$, when piecewise polynomials of degree $k$ are used. We then prove that the highest superconvergence rate of the DG solution itself is $O(h^{k+\frac 32})$ as the variable coefficient degenerates or achieves the value zero in the domain. As byproducts, we obtain superconvergence properties for the DG solution and the DG flux function at special points and for cell averages. All theoretical findings are confirmed by numerical experiments.