Complex real life problems, as they appear with the simulation of electromagnetic fields, demand the construction of efficient and robust solvers for the related equations. In the present paper we investigate multigrid algorithms for the solution of static problems on adaptive discretizations. Two multigrid strategies are compared: algebraic multigrid, which performs the adaption to the discretization automatically and geometric multigrid with semi-coarsening, which has fast convergence if the discretization fits the coarsening strategy.
CITATION STYLE
Pöplau, G., & van Rienen, U. (2001). Multigrid Solvers for Poisson’s Equation in Computational Electromagnetics (pp. 169–176). https://doi.org/10.1007/978-3-642-56470-3_18
Mendeley helps you to discover research relevant for your work.