Schur complement domain decomposition algorithms for spectral methods (Q1263265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4126645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Schur complement domain decomposition algorithms for spectral methods |
scientific article; zbMATH DE number 4126645 |
Statements
Schur complement domain decomposition algorithms for spectral methods (English)
0 references
1989
0 references
Schur complement domain decomposition algorithms for spectral methods are considered. Both the Funaro-Maday-Patera weak \(C^ 1\) matching on the interfaces [cf. \textit{A. T. Patera}, J. Comput. Phys. 54, 468-488 (1984; Zbl 0535.76035)] and \textit{S. A. Orszag}'s exact \(C^ 1\) matching [ibid. 37, 70-92 (1980; Zbl 0476.65078)] are considered. Numerical results show that the condition number of the Schur complement system is of order \(O(n^ 2)\). It is shown how this can be improved to nearly O(1) by a boundary probe preconditioned.
0 references
preconditioning
0 references
Poisson equation
0 references
parallel algorithms
0 references
preconditioned conjugate gradient
0 references
Schur complement domain decomposition algorithms
0 references
spectral methods
0 references
condition number
0 references
0 references
0.8457818031311035
0 references
0.8365778923034668
0 references
0.8365543484687805
0 references
0.8170753121376038
0 references
