Parallel algorithms for the capacitance matrix method in domain decompositions (Q1122342): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02575748 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037675107 / rank | |||
Normal rank | |||
Latest revision as of 11:36, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for the capacitance matrix method in domain decompositions |
scientific article |
Statements
Parallel algorithms for the capacitance matrix method in domain decompositions (English)
0 references
1988
0 references
The capacitance matrix and its preconditioning matrix associated with domain decomposition by spectral collocation methods for the solution of elliptic problems are characterized. A spectral analysis of the preconditioned capacitance system is carried out and is then applied to the convergence analysis of Richardson and conjugate gradient iterations.
0 references
Richardson extrapolation
0 references
capacitance matrix
0 references
preconditioning matrix
0 references
domain decomposition
0 references
spectral collocation methods
0 references
convergence
0 references
conjugate gradient iterations
0 references
0 references
0 references
