Periodic chaotic relaxation (Q2544887): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0024-3795(71)90033-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2035015266 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chaotic relaxation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The general theory of relaxation methods applied to linear systems / rank | |||
Normal rank |
Latest revision as of 01:57, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Periodic chaotic relaxation |
scientific article |
Statements
Periodic chaotic relaxation (English)
0 references
1971
0 references
The author generalizes some recent results of \textit{D. Chazan} and \textit{W. Miranker} [ibid. 2, 199--222 (1969; Zbl 0225.65043)] for relaxation methods applied to \(Ax=b\) using several processors. In this paper \(A\) is taken to be positive definite. Two theorems establish sufficient conditions on the overrelaxation factor for convergence. A model problem is discussed in which the optimum rate of convergence in \(O(h^2)\) for several processors against \(O(h)\) for one.
0 references