首页    期刊浏览 2024年10月05日 星期六
登录注册

文章基本信息

  • 标题:Selection Strategies in Adaptive Refinement
  • 本地全文:下载
  • 作者:Daniela L. Arnica ; Enzo A. Dari ; Claudio Padra
  • 期刊名称:Mecánica Computacional
  • 印刷版ISSN:2591-3522
  • 出版年度:2009
  • 卷号:18
  • 期号:10
  • 页码:557-566
  • 语种:English
  • 出版社:CIMEC-INTEC-CONICET-UNL
  • 摘要:This paper deals with the problem of selecting the elements to be refined for the construction of a new triangulation in an adaptive refinement system. The problem considered is the numerical solution of Poisson's equation using piecewise linear finite elements and local error indicators of Babuska-Miller-type. We analyze two ways of selecting triangles in adaptive refinement: the first strategy (widely used) is to mark elements that have an indicator greater than α times the largest of the indicators where 0≤α ≤1. We conclude that this method is robust in the following sense: if we choose α≥αo with αo small, the convergence order of the regular problem with quasi uniform meshes (measured with the number of elements) is recovered. In this procedure we also introduce a stopping criterion to obtain the final error measure smaller than a prescribed tolerance. The second strategy is to mark elements that have an indicator greater than an admissible indicator. This admissible indicator is defined based on the previous stopping criterion. The ratio between the elemental indicator and the admissible error is also used to define the level of refinement in each element. We analyze the behavior of both strategies and compare them. Finally, some remarks about the whole adaptive process are discussed.
  • 其他摘要:This paper deals with the problem of selecting the elements to be refined for the construction of a new triangulation in an adaptive refinement system. The problem considered is the numerical solution of Poisson's equation using piecewise linear finite elements and local error indicators of Babuska-Miller-type. We analyze two ways of selecting triangles in adaptive refinement: the first strategy (widely used) is to mark elements that have an indicator greater than α times the largest of the indicators where 0≤α ≤1. We conclude that this method is robust in the following sense: if we choose α≥αo with αo small, the convergence order of the regular problem with quasi uniform meshes (measured with the number of elements) is recovered. In this procedure we also introduce a stopping criterion to obtain the final error measure smaller than a prescribed tolerance. The second strategy is to mark elements that have an indicator greater than an admissible indicator. This admissible indicator is defined based on the previous stopping criterion. The ratio between the elemental indicator and the admissible error is also used to define the level of refinement in each element. We analyze the behavior of both strategies and compare them. Finally, some remarks about the whole adaptive process are discussed.
国家哲学社会科学文献中心版权所有