Robust Algebraic multilevel preconditioning in H(\mathrm{curl}) and H(\mathrm{div})

DOI10.1016/J.CAMWA.2013.07.004arXiv1301.3269MaRDI QIDQ6238749FDOQ6238749

Authors: S. K. Tomar 

Publication date: 15 January 2013

Abstract: An algebraic multilevel iteration method for solving system of linear algebraic equations arising in $H(mathrmcurl)$ and $H(mathrmdiv)$ spaces are presented. The algorithm is developed for the discrete problem obtained by using the space of lowest order Nedelec and Raviart-Thomas-Nedelec elements. The theoretical analysis of the method is based only on some algebraic sequences and generalized eigenvalues of local (element-wise) problems. In the hierarchical basis framework, explicit recursion formulae are derived to compute the element matrices and the constant $gamma$ (which measures the quality of the space splitting) at any given level. It is proved that the proposed method is robust with respect to the problem parameters, and is of optimal order complexity. Supporting numerical results, including the case when the parameters have jumps, are also presented.

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

This page was built for publication: Robust Algebraic multilevel preconditioning in $H(\mathrm{curl})$ and $H(\mathrm{div})$

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