Klaus Böhmer
- Published in print:
- 2010
- Published Online:
- January 2011
- ISBN:
- 9780199577040
- eISBN:
- 9780191595172
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199577040.003.0003
- Subject:
- Physics, Theoretical, Computational, and Statistical Physics
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 ...
More
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.Less
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.