Abstract
In Cockburn and Shen (SIAM J Sci Comput 38(1):A545–A566, 2016) the authors propose the first hybridizable discontinuous Galerkin method (HDG) for the p-Laplacian equation. Several iterative algorithms are developed and tested. The main purpose of this paper is to provide rigorous error estimates for the proposed HDG method. We first develop the error estimates based on general polyhedral/polygonal triangulations, under standard regularity assumption of the solution, the convergence analysis is presented for $$1<p<2$$ and $$p>2$$ . Nevertheless, when p approaches to the limits ( $$p \rightarrow 1^+$$ or $$p \rightarrow \infty $$ ), the convergence rate shows degeneration for both cases. Finally, this degeneration can be recovered if we use simplicial triangulation of the domain with sufficient large stabilization parameter for the method.
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.
