The optimal \(\omega\) is not best for the SOR iteration method (Q808162)
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: The optimal is not best for the SOR iteration method |
scientific article; zbMATH DE number 4209447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The optimal \(\omega\) is not best for the SOR iteration method |
scientific article; zbMATH DE number 4209447 |
Statements
The optimal \(\omega\) is not best for the SOR iteration method (English)
0 references
1991
0 references
The author proposes a new method for improving the convergence of the successive overrelaxation (SOR) method by using a polynomial acceleration together with a suboptimal relaxation factor \((\omega <\omega_ b)\) as an alternative to the unaccelerated SOR iteration with optimal relaxation factor \(\omega_ b\). Practical polynomial accelerations and numerical results of the run using the better polynomial are presented.
0 references
successive overrelaxation
0 references
polynomial acceleration
0 references
suboptimal relaxation factor
0 references
numerical results
0 references
0.8838173151016235
0 references
0.8819833397865295
0 references
0.8299614191055298
0 references
0.8210025429725647
0 references
