Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 106 tok/s Pro
Kimi K2 156 tok/s Pro
GPT OSS 120B 467 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Unified analysis of discontinuous Galerkin and $C^0$-interior penalty finite element methods for Hamilton--Jacobi--Bellman and Isaacs equations (2006.07202v2)

Published 12 Jun 2020 in math.NA and cs.NA

Abstract: We provide a unified analysis of a posteriori and a priori error bounds for a broad class of discontinuous Galerkin and $C0$-IP finite element approximations of fully nonlinear second-order elliptic Hamilton--Jacobi--BeLLMan and Isaacs equations with Cordes coefficients. We prove the existence and uniqueness of strong solutions in $H2$ of Isaacs equations with Cordes coefficients posed on bounded convex domains. We then show the reliability and efficiency of computable residual-based error estimators for piecewise polynomial approximations on simplicial meshes in two and three space dimensions. We introduce an abstract framework for the a priori error analysis of a broad family of numerical methods and prove the quasi-optimality of discrete approximations under three key conditions of Lipschitz continuity, discrete consistency and strong monotonicity of the numerical method. Under these conditions, we also prove convergence of the numerical approximations in the small-mesh limit for minimal regularity solutions. We then show that the framework applies to a range of existing numerical methods from the literature, as well as some original variants. A key ingredient of our results is an original analysis of the stabilization terms. As a corollary, we also obtain a generalization of the discrete Miranda--Talenti inequality to piecewise polynomial vector fields.

Citations (19)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.