A POSTERIORI ANALYSIS OF ITERATIVE ALGORITHMS FOR A NONLINEAR PROBLEM
Abstract
A posteriori error indicators have been studied in recent years owing to their remarkable capacity to enhance both speed and accuracy in computing. This work deals with a posteriori error estimation for the finite element discretization of a nonlinear problem. For a given nonlinear equation considering finite elements we solve the discrete problem using two iterative methods involving some kind of linearization. For each of them, there are actually two sources of error, namely discretization and linearization. Balancing these two errors can be very important, since it avoids performing an excessive number of iterations. Our results lead to the construction of computable upper indicators for the full error. Several numerical tests are provided to evaluate the efficiency of our indicators.
Origin | Files produced by the author(s) |
---|