Discretization of linear problems in banach spaces: Residual minimization, nonlinear petrov-galerkin, and monotone mixed methods

Ignacio Muga, Kristoffer G. Van Der Zee

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This work presents a comprehensive discretization theory for abstract linear operator equations in Banach spaces. The fundamental starting point of the theory is the idea of residual minimization in dual norms and its inexact version using discrete dual norms. It is shown that this development, in the case of strictly convex reflexive Banach spaces with strictly convex dual, gives rise to a class of nonlinear Petrov-Galerkin methods and, equivalently, abstract mixed methods with monotone nonlinearity. Under the Fortin condition, we prove discrete stability and quasioptimal convergence of the abstract inexact method, with constants depending on the geometry of the underlying Banach spaces. The theory generalizes and extends the classical Petrov-Galerkin method as well as existing residual-minimization approaches, such as the discontinuous Petrov- Galerkin method.

Original languageEnglish
Pages (from-to)3406-3426
Number of pages21
JournalSIAM Journal on Numerical Analysis
Volume58
Issue number6
DOIs
StatePublished - 2020

Keywords

  • Best approximation
  • Duality mapping
  • Error analysis
  • Geometric constants
  • Operators in Banach spaces
  • Petrov-Galerkin discretization
  • Quasi-optimality
  • Residual minimization

Fingerprint

Dive into the research topics of 'Discretization of linear problems in banach spaces: Residual minimization, nonlinear petrov-galerkin, and monotone mixed methods'. Together they form a unique fingerprint.

Cite this