Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing. (Q375441): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The paper theoretically analyzes a general multigrid method in the case of the so called aggressive coarsening, i.e., with large differences between characteristic mesh sizes of two successive spaces within the multigrid hierarchy. The authors extend earlier theoretical results by weakening the approximation property and prove a ``nearly optimal convergence'' result independent of the coarsening ratio and linearly depending on the number of levels. Allowing worse approximation properties of the spaces requires to satisfy a stronger smoothing condition. A simple algorithm for the realisation of a suitable polynomial smoother based on Richardson iteration is described. | |||
Property / review text: The paper theoretically analyzes a general multigrid method in the case of the so called aggressive coarsening, i.e., with large differences between characteristic mesh sizes of two successive spaces within the multigrid hierarchy. The authors extend earlier theoretical results by weakening the approximation property and prove a ``nearly optimal convergence'' result independent of the coarsening ratio and linearly depending on the number of levels. Allowing worse approximation properties of the spaces requires to satisfy a stronger smoothing condition. A simple algorithm for the realisation of a suitable polynomial smoother based on Richardson iteration is described. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65N55 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6221236 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multigrid | |||
Property / zbMATH Keywords: multigrid / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
aggressive coarsening | |||
Property / zbMATH Keywords: aggressive coarsening / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
optimal convergence result | |||
Property / zbMATH Keywords: optimal convergence result / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial smoothing | |||
Property / zbMATH Keywords: polynomial smoothing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Richardson iteration | |||
Property / zbMATH Keywords: Richardson iteration / rank | |||
Normal rank |
Revision as of 10:26, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing. |
scientific article |
Statements
Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing. (English)
0 references
30 October 2013
0 references
The paper theoretically analyzes a general multigrid method in the case of the so called aggressive coarsening, i.e., with large differences between characteristic mesh sizes of two successive spaces within the multigrid hierarchy. The authors extend earlier theoretical results by weakening the approximation property and prove a ``nearly optimal convergence'' result independent of the coarsening ratio and linearly depending on the number of levels. Allowing worse approximation properties of the spaces requires to satisfy a stronger smoothing condition. A simple algorithm for the realisation of a suitable polynomial smoother based on Richardson iteration is described.
0 references
multigrid
0 references
aggressive coarsening
0 references
optimal convergence result
0 references
polynomial smoothing
0 references
algorithm
0 references
Richardson iteration
0 references