Decoupling three-dimensional mixed problems using divergence-free finite elements (Q2780601)
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: Decoupling three-dimensional mixed problems using divergence-free finite elements |
scientific article; zbMATH DE number 1729213
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decoupling three-dimensional mixed problems using divergence-free finite elements |
scientific article; zbMATH DE number 1729213 |
Statements
15 April 2002
0 references
mixed finite elements
0 references
divergence free elements
0 references
decoupled iterative method
0 references
saddle pointproblems
0 references
second-order elliptic boundary value problems
0 references
Raviart-Thomas-Nédélec elements
0 references
Nédélec's edge elements
0 references
spanning trees
0 references
numerical results
0 references
preconditioning
0 references
0.91421044
0 references
0.8989181
0 references
0 references
0.88946164
0 references
0 references
0.88649887
0 references
Decoupling three-dimensional mixed problems using divergence-free finite elements (English)
0 references
The author considers the iterative solution of saddle point problems resulting from the lowest order mixed finite element discretization of second order elliptic boundary value problems on polyhedral domains. The basic idea is to decouple the discrete velocities from the discrete pressures using the construction of a basis for the divergence free Raviart-Thomas-Nédélec elements by means of the curls of Nédélec's edge elements. The construction of the basis uses the concept of spanning trees from graph theory and fundamental results from homology theory. Numerical results indicate a better efficiency of the proposed iterative solver compared to standard block preconditioning techniques.
0 references