@misc{Beck, author = {Beck, Rudolf}, title = {Algebraic Multigrid by Component Splitting for Edge Elements on Simplicial Triangulations}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4290}, number = {SC-99-40}, abstract = {Our focus is on Maxwell's equations in the low frequency range; two specific applications we aim at are time-stepping schemes for eddy current computations and the stationary double-curl equation for time-harmonic fields. We assume that the computational domain is discretized by triangles or tetrahedrons; for the finite element approximation we choose N\'{e}d\'{e}lec's \$H(curl)\$-conforming edge elements of the lowest order. For the solution of the arising linear equation systems we devise an algebraic multigrid preconditioner based on a spatial component splitting of the field. Mesh coarsening takes place in an auxiliary subspace, which is constructed with the aid of a nodal vector basis. Within this subspace coarse grids are created by exploiting the matrix graphs. Additionally, we have to cope with the kernel of the \$curl\$-operator, which comprises a considerable part of the spectral modes on the grid. Fortunately, the kernel modes are accessible via a discrete Helmholtz decomposition of the fields; they are smoothed by additional algebraic multigrid cycles. Numerical experiments are included in order to assess the efficacy of the proposed algorithms.}, language = {en} } @misc{Beck, author = {Beck, Rudolf}, title = {Graph-Based Algebraic Multigrid for Lagrange-Type Finite Elements on Simplicial Meshes}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4100}, number = {SC-99-22}, abstract = {We present an algebraic multigrid preconditioner which uses only the graphs of system matrices. Some elementary coarsening rules are stated, from which an advancing front algorithm for the selection of coarse grid nodes is derived. This technique can be applied to linear Lagrange-type finite element discretizations; for higher-order elements an extension of the multigrid algorithm is provided. Both two- and three-dimensional second order elliptic problems can be handled. Numerical experiments show that the resulting convergence acceleration is comparable to classical geometric multigrid.}, language = {en} }