2 research outputs found

    A least-squares Galerkin approach to gradient recovery for Hamilton-Jacobi-Bellman equation with Cordes coefficients

    Full text link
    We propose a conforming finite element method to approximate the strong solution of the second order Hamilton-Jacobi-Bellman equation with Dirichlet boundary and coefficients satisfying Cordes condition. We show the convergence of the continuum semismooth Newton method for the fully nonlinear Hamilton-Jacobi-Bellman equation. Applying this linearization for the equation yields a recursive sequence of linear elliptic boundary value problems in nondivergence form. We deal numerically with such BVPs via the least-squares gradient recovery of Lakkis & Mousavi [2021, arxiv:1909.00491]. We provide an optimal-rate apriori and aposteriori error bounds for the approximation. The aposteriori error are used to drive an adaptive refinement procedure. We close with computer experiments on uniform and adaptive meshes to reconcile the theoretical findings.Comment: 24 pages, 2 Figures (6 graphs

    A least-squares Galerkin approach to gradient and Hessian recovery for nondivergence-form elliptic equations

    No full text
    We propose a least-squares method involving the recovery of the gradient and possibly the Hessian for elliptic equation in nondivergence form. As our approach is based on the Lax–Milgram theorem with the curl-free constraint built into the target (or cost) functional, the discrete spaces require no inf-sup stabilization. We show that standard conforming finite elements can be used yielding a priori and a posteriori convergence results. We illustrate our findings with numerical experiments with uniform or adaptive mesh refinement
    corecore