A BDDC algorithm with deluxe scaling for three-dimensional \(H(\mathbf{curl})\) problems (Q2802897)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A BDDC algorithm with deluxe scaling for three-dimensional \(H(\mathbf{curl})\) problems |
scientific article; zbMATH DE number 6574406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A BDDC algorithm with deluxe scaling for three-dimensional \(H(\mathbf{curl})\) problems |
scientific article; zbMATH DE number 6574406 |
Statements
27 April 2016
0 references
boundary value problem
0 references
finite elements method
0 references
error bound
0 references
Poisson equation
0 references
balancing domain decomposition by constraints method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9321126
0 references
0.9030018
0 references
0.8940965
0 references
0 references
0.8569238
0 references
0.8553235
0 references
0.8527204
0 references
0.8402871
0 references
0.83927715
0 references
A BDDC algorithm with deluxe scaling for three-dimensional \(H(\mathbf{curl})\) problems (English)
0 references
The authors are concerned with an application of the finite elements method to approximately solving the boundary value problem for a class of partial differential equation of elliptic type NEWLINE\[NEWLINE \Delta u = f, \text{ on }\Omega \subset \mathbb R^{3},\quad u = g, \quad x\in \partial \Omega. NEWLINE\]NEWLINE A discretized problem is obtained using the lowest-order Nédeléc elements method with the unknowns given on the edge of tetrahedral elements of the partitioned domain \( \Omega \). Each subdomain face satisfies supplementary conditions. This method is named BDDC, i.e. balancing domain decomposition by constraints method. In the reviewer's opinion, the exposition of the main subject is unsuccessful.
0 references