Chapter

A general discretization theory

Klaus Böhmer

in Numerical Methods for Nonlinear Elliptic Differential Equations

Published in print October 2010 | ISBN: 9780199577040
Published online January 2011 | e-ISBN: 9780191595172 | DOI: http://dx.doi.org/10.1093/acprof:oso/9780199577040.003.0003

Series: Numerical Mathematics and Scientific Computation

A general discretization theory

More Like This

Show all results sharing this subject:

  • Mathematical and Statistical Physics

GO

Show Summary Details

Preview

A new general discretization theory unifies the generalized Petrov-Galerkin method and one of the classical methods. Linearization is a main tool: the derivative of the operator in the exact solution has to be boundedly invertible. For quasilinear problems, in Sobolev spaces Wm'p(Ω), with 2 ≤ p 〈 ∞, this chapter obtains stability and convergence results with respect to discrete Hm(Ω) norms. This is complemented by the monotone approach for 1 ≤ p 〈 ∞ with Wm'p(Ω) convergence. Our approach allows a unified proof for stability, convergence and Fredholm results for the discrete solutions and their computation. A few well-known basic concepts from functional analysis and approximation theory are combined: coercive bilinear forms or monotone operators, their compact perturbations, interpolation, best approximation and inverse estimates for approximating spaces yield the classical “consistency and stability imply convergence”. The mesh independence principle is the key for an efficient solution for all discretizations of all nonlinear problems considered here.

Keywords: new discretization theory; generalized Petrov-Galerkin method; classical methods; linearization; coercive bilinear forms; compact perturbations; computation of solutions; mesh independence principle

Chapter.  10145 words.  Illustrated.

Subjects: Mathematical and Statistical Physics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.