Analysis of Hessian Recovery Methods for Generating Adaptive Meshes
نویسندگان
چکیده
We study adaptive meshes which are quasi-uniform in a metric generated by the Hessian of a P1 finite element function. We consider three most efficient methods for recovering this Hessian, one variational method and two projection methods. We compare these methods for problems with anisotropic singularities to show that all Hessian recovery methods result in acceptable adaptive meshes although the variational method gives a smaller error.
منابع مشابه
Hessian-free metric-based mesh adaptation via geometry of interpolation error
Generation of meshes adapted to a given function u requires a specially designed metric. For metric derived from the Hessian of u, optimal error estimates for the interpolation error on simplicial meshes have been proved in [2, 5, 8, 10, 11]. The Hessian-based metric has been successfully applied to adaptive solution of PDEs [4, 7, 9]. However, theoretical estimates have required to make an add...
متن کاملHessian recovery for finite element methods
In this article, we propose and analyze an effective Hessian recovery strategy for the Lagrangian finite element method of arbitrary order. We prove that the proposed Hessian recovery method preserves polynomials of degree k + 1 on general unstructured meshes and superconverges at a rate of O(hk) on mildly structured meshes. In addition, the method is proved to be ultraconvergent (two orders hi...
متن کاملA Numerical Study of Some Hessian Recovery Techniques on Isotropic and Anisotropic Meshes
Spaces of continuous piecewise linear finite elements are considered to solve a Poisson problem and several numerical methods are investigated to recover second derivatives. Numerical results on 2D and 3D isotropic and anisotropic meshes indicate that the quality of the results is strongly linked to the mesh topology and that no convergence can be insured in general.
متن کاملOn Adaptive Mesh Generation in Two-Dimensions
This work considers the effectiveness of using anisotropic coordinate transformation in adaptive mesh generation. The anisotropic coordinate transformation is derived by interpreting the Hessian matrix of the data function as a metric tensor that measures the local approximation error. The Hessian matrix contains information about the local curvature of the surface and gives guidance in the asp...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کامل