Numer. Math. Theor. Meth. Appl., 8 (2015), pp. 283-312.
Published online: 2015-08
Cited by
- BibTex
- RIS
- TXT
Algebraic Multigrid (AMG) methods were developed originally for numerically solving Partial Differential Equations (PDE), not necessarily on structured grids. In the last two decades solvers inspired by the AMG approach, were developed for non PDE problems, including data and image analysis problems, such as clustering, segmentation, quantization and others. These solvers share a common principle that there is a crosstalk between fine and coarse representations of the problems, with flow of information in both directions, fine-to-coarse and coarse-to-fine. This paper surveys some of these problems and the AMG-inspired algorithms for their solution.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2015.w14si}, url = {http://global-sci.org/intro/article_detail/nmtma/12411.html} }Algebraic Multigrid (AMG) methods were developed originally for numerically solving Partial Differential Equations (PDE), not necessarily on structured grids. In the last two decades solvers inspired by the AMG approach, were developed for non PDE problems, including data and image analysis problems, such as clustering, segmentation, quantization and others. These solvers share a common principle that there is a crosstalk between fine and coarse representations of the problems, with flow of information in both directions, fine-to-coarse and coarse-to-fine. This paper surveys some of these problems and the AMG-inspired algorithms for their solution.