Efficiency Based Adaptive Local Refinement for First-Order System Least-Squares Formulations

  • Authors:

  • J. H. Adler;T. A. Manteuffel;S. F. McCormick;J. W. Nolting;J. W. Ruge;L. Tang

  • Affiliations:

  • adler@math.psu.edu;tmanteuf@colorado.edu and stevem@colorado.edu and jruge@colorado.edu and tangl@colorado.edu;-;nolting.josh@geoeye.com;-;-

  • Venue:
  • SIAM Journal on Scientific Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we propose new adaptive local refinement (ALR) strategies for first-order system least-squares finite elements in conjunction with algebraic multigrid methods in the context of nested iteration. The goal is to reach a certain error tolerance with the least amount of computational cost and nearly uniform distribution of the error over all elements. To accomplish this, the refinement decision at each refinement level is determined based on optimizing efficiency measures that take into account both error reduction and computational cost. Two efficiency measures are discussed: predicted error reduction and predicted computational cost. These methods are first applied to a two-dimensional (2D) Poisson problem with steep gradients, and the results are compared with the threshold-based methods described in [W. Dörfler, SIAM J. Numer. Anal., 33 (1996), pp. 1106-1124]. Next, these methods are applied to a 2D reduced model of the incompressible, resistive magnetohydrodynamic equations. These equations are used to simulate instabilities in a large aspect-ratio tokamak. We show that, by using the new ALR strategies on this system, we are able to resolve the physics using only 10 percent of the computational cost used to approximate the solutions on a uniformly refined mesh within the same error tolerance.