Efficient algorithms for the \(p\)-version of the boundary element method (Q1353460)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for the \(p\)-version of the boundary element method |
scientific article |
Statements
Efficient algorithms for the \(p\)-version of the boundary element method (English)
0 references
20 October 1997
0 references
The \(p\)-version of the boundary element method is investigated for the simple layer potential operator acting on the boundary of a two-dimensional polygonal domain. The trial spaces for the Galerkin method are spanned by Legendre polynomials. Sparse matrices can be achieved then by neglecting small entries whereby the order of convergence is not disturbed. Corresponding a priori estimates are given. Further, some variants to construct preconditioners via the additive Schwarz method are described. Remarkable is the concept of ``degree decomposition'' (as an alternative to the ``domain decomposition'') newly introduced here. Numerical tests confirm the efficiency of the considered methods.
0 references
error bounds
0 references
numerical examples
0 references
\(p\)-version
0 references
domain decomposition
0 references
degree decomposition
0 references
boundary element method
0 references
simple layer potential operator
0 references
Galerkin method
0 references
Legendre polynomials
0 references
preconditioners
0 references
additive Schwarz method
0 references