Asymptotic expansions for high-contrast elliptic equations

In this paper, we present a high-order expansion for elliptic equations in high-contrast media. The background conductivity is taken to be one and we assume the medium contains high (or low) conductivity inclusions. We derive an asymptotic expansion with respect to the contrast and provide a procedure to compute the terms in the expansion. The computation of the expansion does not depend on the contrast which is important for simulations. The latter allows avoiding increased mesh resolution around high conductivity features. This work is partly motivated by our earlier work in \cite{ge09_1} where we design efficient numerical procedures for solving high-contrast problems. These multiscale approaches require local solutions and our proposed high-order expansion can be used to approximate these local solutions inexpensively. In the case of a large-number of inclusions, the proposed analysis can help to design localization techniques for computing the terms in the expansion. In the paper, we present a rigorous analysis of the proposed high-order expansion and estimate the remainder of it. We consider both high and low conductivity inclusions

Gaussian quadrature for splines via homotopy continuation: Rules for C2 cubic splines

We introduce a new concept for generating optimal quadrature rules for splines. To generate an optimal quadrature rule in a given (target) spline space, we build an associated source space with known optimal quadrature and transfer the rule from the source space to the target one, while preserving the number of quadrature points and therefore optimality. The quadrature nodes and weights are, considered as a higher-dimensional point, a zero of a particular system of polynomial equations. As the space is continuously deformed by changing the source knot vector, the quadrature rule gets updated using polynomial homotopy continuation. For example, starting with C1 cubic splines with uniform knot sequences, we demonstrate the methodology by deriving the optimal rules for uniform C2 cubic spline spaces where the rule was only conjectured to date. We validate our algorithm by showing that the resulting quadrature rule is independent of the path chosen between the target and the source knot vectors as well as the source rule chosen

Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements

The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the estimates for systems resulting from $C^{p-1}$ polynomial B-spline spaces and compare them to those obtained using $C^0$ spaces.Comment: 8 pages, 2 figure

Goal-oriented self-adaptive hp finite element simulation of 3D DC borehole resistivity simulations

In this paper we present a goal-oriented self-adaptive hp Finite Element Method (hp-FEM) with shared data structures and a parallel multi-frontal direct solver. The algorithm automatically generates (without any user interaction) a sequence of meshes delivering exponential convergence of a prescribed quantity of interest with respect to the number of degrees of freedom. The sequence of meshes is generated from a given initial mesh, by performing h (breaking elements into smaller elements), p (adjusting polynomial orders of approximation) or hp (both) refinements on the finite elements. The new parallel implementation utilizes a computational mesh shared between multiple processors. All computational algorithms, including automatic hp goal-oriented adaptivity and the solver work fully in parallel. We describe the parallel self-adaptive hp-FEM algorithm with shared computational domain, as well as its efficiency measurements. We apply the methodology described to the three-dimensional simulation of the borehole resistivity measurement of direct current through casing in the presence of invasion. © 2011 Published by Elsevier Ltd

Direct solvers performance on h-adapted grids

We analyse the performance of direct solvers when applied to a system of linear equations arising from an h-adapted, <sup>C0</sup> finite element space. Theoretical estimates are derived for typical h-refinement patterns arising as a result of a point, edge, or face singularity as well as boundary layers. They are based on the elimination trees constructed specifically for the considered grids. Theoretical estimates are compared with experiments performed with MUMPS using the nested-dissection algorithm for construction of the elimination tree from METIS library. The numerical experiments provide the same performance for the cases where our trees are identical with those constructed by the nested-dissection algorithm, and worse performance for some cases where our trees are different. We also present numerical experiments for the cases with mixed singularities, where how to construct optimal elimination trees is unknown. In all analysed cases, the use of h-adaptive grids significantly reduces the cost of the direct solver algorithm per unknown as compared to uniform grids. The theoretical estimates predict and the experimental data confirm that the computational complexity is linear for various refinement patterns. In most cases, the cost of the direct solver per unknown is lower when employing anisotropic refinements as opposed to isotropic ones

Graph grammar-based multi-frontal parallel direct solver for two-dimensional isogeometric analysis

This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence of graph grammar productions generates element frontal matrices at leaf nodes, merges matrices at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar productions allows us to explore the concurrency of the algorithm. The graph grammar productions are grouped into sets of independent tasks that can be executed concurrently. The resulting concurrent multi-frontal solver algorithm is implemented and tested on NVIDIA GPU, providing O(NlogN) execution time complexity where N is the number of degrees of freedom. We have confirmed this complexity by solving up to 1 million of degrees of freedom with 448 cores GPU. © 2012 Published by Elsevier Ltd