On the Use of Adjoint-Based Sensitivity Estimates to Control Local Mesh Refinement

On the Use of Adjoint-Based Sensitivity Estimates to Control Local Mesh Refinement

Year:    2010

Communications in Computational Physics, Vol. 7 (2010), Iss. 3 : pp. 631–638

Abstract

The goal of efficient and robust error control, through local mesh adaptation in the computational solution of partial differential equations, is predicated on the ability to identify in an a posteriori way those localized regions whose refinement will lead to the most significant reductions in the error. The development of a posteriori error estimation schemes and of a refinement infrastructure both facilitate this goal, however they are incomplete in the sense that they do not provide an answer as to where the maximal impact of refinement may be gained or what type of refinement — elemental partitioning (h-refinement) or polynomial enrichment (p-refinement) — will best lead to that gain. In essence, one also requires knowledge of the sensitivity of the error to both the location and the type of refinement. In this communication we propose the use of adjoint-based sensitivity analysis to discriminate both where and how to refine. We present both an adjoint-based and an algebraic perspective on defining and using sensitivities, and then demonstrate through several one-dimensional model problem experiments the feasibility and benefits of our approach.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/cicp.2009.09.060

Communications in Computational Physics, Vol. 7 (2010), Iss. 3 : pp. 631–638

Published online:    2010-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    8

Keywords:   

  1. Multiscale Basis Functions for Singular Perturbation on Adaptively Graded Meshes

    Sun, Mei-Ling | Jiang, Shan

    Advances in Applied Mathematics and Mechanics, Vol. 6 (2014), Iss. 5 P.604

    https://doi.org/10.4208/aamm.2013.m488 [Citations: 1]
  2. An adaptive algorithm for maximization of non-submodular function with a matroid constraint

    Sun, Xin | Xu, Dachuan | Zhang, Dongmei | Zhou, Yang

    Journal of Industrial and Management Optimization, Vol. 19 (2023), Iss. 3 P.2050

    https://doi.org/10.3934/jimo.2022031 [Citations: 0]
  3. Towards the development of an h–p-refinement strategy based upon error estimate sensitivity

    Jimack, Peter K. | Kirby, Robert M.

    Computers & Fluids, Vol. 46 (2011), Iss. 1 P.277

    https://doi.org/10.1016/j.compfluid.2010.08.003 [Citations: 1]
  4. The adaptive complexity of maximizing a submodular function

    Balkanski, Eric | Singer, Yaron

    Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, (2018), P.1138

    https://doi.org/10.1145/3188745.3188752 [Citations: 32]
  5. Adaptive high-order Discontinuous Galerkin solution of elastohydrodynamic lubrication point contact problems

    Lu, H. | Berzins, M. | Goodyer, C.E. | Jimack, P.K.

    Advances in Engineering Software, Vol. 45 (2012), Iss. 1 P.313

    https://doi.org/10.1016/j.advengsoft.2011.10.006 [Citations: 4]