BDDC and FETI-DP under Minimalist Assumptions

The FETI-DP, BDDC and P-FETI-DP preconditioners are derived in a particulary simple abstract form. It is shown that their properties can be obtained from only on a very small set of algebraic assumptions. The presentation is purely algebraic and it does not use any particular definition of method components, such as substructures and coarse degrees of freedom. It is then shown that P-FETI-DP and BDDC are in fact the same. The FETI-DP and the BDDC preconditioned operators are of the same algebraic form, and the standard condition number bound carries over to arbitrary abstract operators of this form. The equality of eigenvalues of BDDC and FETI-DP also holds in the minimalist abstract setting. The abstract framework is explained on a standard substructuring example.Comment: 11 pages, 1 figure, also available at http://www-math.cudenver.edu/ccm/reports

Універсітэт. - № 11 (2114)

PERMON makes use of theoretical results in quadratic programming algorithms and domain decomposition methods. It is built on top of the PETSc framework for numerical computations. This paper describes its fundamental packages and shows their applications. We focus here on contact problems of mechanics decomposed by means of a FETI-type non-overlapping domain decomposition method. These problems lead to inequality constrained quadratic programming problems that can be solved by our PermonQP package.11510

Application of a posteriori error estimates to fluid flow in domain with singularity

A posteriori error estimate for the Navier-Stokes equations is applied to fluid flow in a domain with singularity

Application of a-posteriori error estimates for Navier-Stokes equations to the adaptive refinement of the finite element mesh

Paper describes implementation of a-posteriori error estimates and its application to the adaptive refinement of the finite element mesh

Paralelizace algoritmu BICG-STAB pro výpočty metodou konečných prvků

We present results of parallelization of BICG-STAB method for finite element computations using element by element strategy both on distributed and shared parallel architectures

Parallelization of BICG-STAB method for solution of unsymmetric systems of linear equations arising in finite element discretization

We describe parallelization of BICG-STAB method for solution of unsymmetric systems of linear equations arising in finite element discretization using MPI and OpenMP

Parallel adaptive FETI-DP using lightweight asynchronous dynamic load balancing

A parallel FETI-DP domain decomposition method using an adaptive coarse space is presented. The implementation builds on a recently introduced adaptive FETI-DP approach for elliptic problems in three dimensions and uses small, local eigenvalue problems for faces and, additionally, for a small number of edges. The condition number of the preconditioned operator then satisfies a bound that is independent of coefficient heterogeneities in the problem. The computational cost of the local eigenvalue problems is not negligible, and also a significant load imbalance can be introduced. As a remedy, certain eigenvalue problems are discarded by a theory-guided heuristic strategy, based on the diagonal entries of the stiffness matrices. Additionally, a lightweight pairwise dynamic load balancing strategy is implemented for the eigenvalue problems. The load balancing is supervised by an orchestrating rank using asynchronous point-to-point communication. The resulting method shows good weak and strong scalability up to thousands of cores while fast convergence is obtained even for heterogeneous problems

Adaptive BDDC in Three Dimensions

The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism provided by a multifrontal solver. Constraints are implemented by a projection and sparsity of the projected operator is preserved by a generalized change of variables. The effectiveness of the method is illustrated on several engineering problems

Parallel implementation of Multilevel BDDC

In application of the Balancing Domain Decomposition by Constraints (BDDC) to a case with many substructures, solving the coarse problem exactly becomes the bottleneck which spoils scalability of the solver. However, it is straightforward for BDDC to substitute the exact solution of the coarse problem by another step of BDDC method with subdomains playing the role of elements. In this way, the algorithm of three-level BDDC method is obtained. If this approach is applied recursively, multilevel BDDC method is derived. We present a detailed description of a recently developed parallel implementation of this algorithm. The implementation is applied to an engineering problem of linear elasticity and a benchmark problem of Stokes flow in a cavity. Results by the multilevel approach are compared to those by the standard (two-level) BDDC method