Convergence of Multi-level Algorithms for a Class of Nonlinear Problems

Dongho Kim, Eun Jae Park, Boyoon Seo

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


In this article, we develop and analyze two-grid/multi-level algorithms via mesh refinement in the abstract framework of Brezzi, Rappaz, and Raviart for approximation of branches of nonsingular solutions. Optimal fine grid accuracy of two-grid/multi-level algorithms can be achieved via the proper scaling of relevant meshes. An important aspect of the proposed algorithms is the use of mesh refinement in conjunction with Newton-type methods for system solution in contrast to the usual Newton’s method on a fixed mesh. The pseudostress-velocity formulation of the stationary, incompressible Navier–Stokes equations is considered as an application and the Raviart–Thomas mixed finite element spaces are used for the approximation. Finally, several numerical examples are presented to test the performance of the algorithm and validity of the theory developed.

Original languageEnglish
Article number34
JournalJournal of Scientific Computing
Issue number2
Publication statusPublished - 2020 Aug 1

Bibliographical note

Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • General Engineering
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Convergence of Multi-level Algorithms for a Class of Nonlinear Problems'. Together they form a unique fingerprint.

Cite this