JournalsowrVol. 13, No. 3pp. 2399–2464

Self-Adaptive Numerical Methods for Computationally Challenging Problems

  • Randolph E. Bank

    University of California, San Diego, USA
  • Zhiqiang Cai

    Purdue University, West Lafayette, USA
  • Rüdiger Verfürth

    Ruhr-Universität Bochum, Germany
Self-Adaptive Numerical Methods for Computationally Challenging Problems cover
Download PDF

A subscription is required to access this article.

Abstract

Self-adaptive numerical methods provide a powerful and automatic approach in scientific computing. In particular, Adaptive Mesh Refinement (AMR) algorithms have been widely used in computational science and engineering and have become a necessary tool in computer simulations of complex natural and engineering problems. The key ingredient for success of self-adaptive numerical methods is a posteriori error estimates that are able to accurately locate sources of global and local error in the current approximation. The workshop creates a forum for junior and senior researchers in numerical analysis and computational science and engineering to discuss recent advances, initiates future research projects, and establishes new collaborations on convergence theory of adaptive numerical methods and on the construction and analysis of efficient, reliable, and robust a posteriori error estimators for computationally challenging problems.

Cite this article

Randolph E. Bank, Zhiqiang Cai, Rüdiger Verfürth, Self-Adaptive Numerical Methods for Computationally Challenging Problems. Oberwolfach Rep. 13 (2016), no. 3, pp. 2399–2464

DOI 10.4171/OWR/2016/42