Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

Multilevel balancing domain decomposition by constraints (BDDC) deluxe algorithms are developed for the saddle point problems… Expand

Is this relevant?

2016

2016

In this paper we present a fully distributed, communicator-aware, recursive, and interlevel-overlapped message-passing… Expand

Is this relevant?

2013

2013

In this paper we present a detailed description of a high-performance distributed-memory implementation of balancing domain… Expand

Is this relevant?

2004

2004

The domain decomposition method (DDM) is a major solution algorithm in order to parallelize the finite element method. In case of… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

A convergence theory is presented for a substructuring preconditioner based on constrained energy minimization concepts. The… Expand

Is this relevant?

2003

2003

This paper describes the parallel finite element analysis of large scale problems based on the Domain Decomposition Method with… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains coupled with a… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

The rate of convergence of the Balancing Domain Decomposition method applied to the mixed finite element discretization of second… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

The Neumann–Neumann algorithm is known to be an efficient domain decomposition preconditioner with unstructured subdomains for… Expand

Is this relevant?

1993

1993

We show that the Neumann-Neumann preconditioner with a coarse problem can be applied to the solution of system of linear… Expand

Is this relevant?