Abstract
Abstract We discuss the efficient implementation of powerful domain decomposition smoothers for multigrid methods for high-order discontinuous Galerkin (DG) finite element methods. In particular, we study the inversion of matrices associated to mesh cells and to the patches around a vertex, respectively, in order to obtain fast local solvers for additive and multiplicative subspace correction methods. The effort of inverting local matrices for tensor product polynomials of degree k is reduced from 𝒪 ( k 3 d ) {\mathcal{O}(k^{3d})} to 𝒪 ( d k d + 1 ) {\mathcal{O}(dk^{d+1})} by exploiting the separability of the differential operator and resulting low rank representation of its inverse as a prototype for more general low rank representations in space dimension d.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
