A nearly optimal multigrid method for general unstructured grids

From MaRDI portal
Publication:728458

DOI10.1007/S00211-015-0785-7zbMATH Open1356.65241arXiv1410.2153OpenAlexW2257046020MaRDI QIDQ728458FDOQ728458


Authors: L. Grasedyck, Lu Wang, Jinchao Xu Edit this on Wikidata


Publication date: 20 December 2016

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: In this paper, we develop a multigrid method on unstructured shape-regular grids. For a general shape-regular unstructured grid of calO(N) elements, we present a construction of an auxiliary coarse grid hierarchy on which a geometric multigrid method can be applied together with a smoothing on the original grid by using the auxiliary space preconditioning technique. Such a construction is realized by a cluster tree which can be obtained in calO(NlogN) operations for a grid of N elements. This tree structure in turn is used for the definition of the grid hierarchy from coarse to fine. For the constructed grid hierarchy we prove that the convergence rate of the multigrid preconditioned CG for an elliptic PDE is 1calO(1/logN). Numerical experiments confirm the theoretical bounds and show that the total complexity is in calO(NlogN).


Full work available at URL: https://arxiv.org/abs/1410.2153




Recommendations




Cites Work


Cited In (22)

Uses Software





This page was built for publication: A nearly optimal multigrid method for general unstructured grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q728458)