Balancing domain decomposition by constraints associated with subobjects

preprint2020arXivOpen access

Abstract

A simple variant of the BDDC preconditioner in which constraints are imposed on a selected set of subobjects (subdomain subedges, subfaces and vertices between pairs of subedges) is presented. We are able to show that the condition number of the preconditioner is bounded by C(1+log⁡(L/h))2C \big(1+\log (L/h)\big)^2, where CC is a constant, and hh and LL are the characteristic sizes of the mesh and the subobjects, respectively. As LL can be chosen almost freely, the condition number can theoretically be as small as O(1)O(1). We will discuss the pros and cons of the preconditioner and its application to heterogeneous problems. Numerical results on supercomputers are provided.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.