Accuracy Measures and Fourier Analysis for the Full Multigrid Algorithm
The full multigrid (FMG) algorithm is often claimed to achieve so-called discretization-level accuracy. In this paper, this notion is formalized by defining a worst-case relative accuracy measure, denoted ..., which compares the total error of the ...-level FMG solution against the inherent discreti...
Uloženo v:
| Vydáno v: | SIAM journal on scientific computing Ročník 32; číslo 5; s. 3108 - 3129 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Philadelphia
Society for Industrial and Applied Mathematics
01.01.2010
|
| Témata: | |
| ISSN: | 1064-8275, 1095-7197 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The full multigrid (FMG) algorithm is often claimed to achieve so-called discretization-level accuracy. In this paper, this notion is formalized by defining a worst-case relative accuracy measure, denoted ..., which compares the total error of the ...-level FMG solution against the inherent discretization error. This measure can be used for tuning algorithmic compoents so as to obtain discretization-level accuracy. A Fourier analysis is developed for estimating ..., and the resulting estimates are confirmed by numerical tests. (ProQuest: ... denotes formulae/symbols omitted.) |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 1064-8275 1095-7197 |
| DOI: | 10.1137/100786101 |