Filter factor analysis of an iterative multilevel regularizing method
Recent results have shown that iterative methods of multigrid type are very precise and efficient for regularizing purposes: the reconstruction quality is of the same level or slightly better than that related to most effective regularizing procedures such as Landweber or conjugate gradients for nor...
Saved in:
| Published in | Electronic transactions on numerical analysis Vol. 29; p. 163 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Institute of Computational Mathematics
01.12.2007
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1068-9613 1097-4067 |
Cover
| Summary: | Recent results have shown that iterative methods of multigrid type are very precise and efficient for regularizing purposes: the reconstruction quality is of the same level or slightly better than that related to most effective regularizing procedures such as Landweber or conjugate gradients for normal equations, but the associated computational cost is highly reduced. Here we analyze the filter features of one of these multigrid techniques in order to provide a theoretical motivation of the excellent regularizing characteristics experimentally observed in the discussed methods. Key words. regularization, early termination, filter analysis, boundary conditions, structured matrices AMS subject classifications. 65Y20, 65F10, 15A12 |
|---|---|
| ISSN: | 1068-9613 1097-4067 |