CONVERGENCE ANALYSIS OF TWO NUMERICAL SCHEMES APPLIED TO A NONLINEAR ELLIPTIC PROBLEM
Authors:
Preprint
Abstract
For a given nonlinear problem discretized by standard finite elements, we propose two iterative schemes to solve the discrete problem. We prove the well-posedness of the corresponding problems and their convergence. Next, we construct error indicators and prove optimal a posteriori estimates where we treat separately the discretization and linearization errors. Some numerical experiments confirm the validity of the schemes and allow us to compare them.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- A posteriori analysis of iterative algorithms for a nonlinear problemJournal of Scientific Computing, 2015
- New development in freefem++Journal of Numerical Mathematics, 2012
- A posteriori estimation of the linearization error for strongly monotone nonlinear operatorsJournal of Computational and Applied Mathematics, 2007
- Computable error estimators for the approximation of nonlinear problems by linearized modelsComputer Methods in Applied Mechanics and Engineering, 2006