REMARKS ON PICARD-LINDEL()F ITERATION PART I
Olavi Nevanlinna · 1989
The paper discusses Picard-Lindel6f iteration for systems of autonomous linear equations on finite intervals, as well as its numerical variants. Most of the discussion is under a model assumption which roughly says that the coupling terms are of moderate size compared with the slow time scales in the problem. It is shown that the speed of convergence is quite independent of the step sizes already for very large time steps. This makes it possible to design strategies in which the mesh gets gradually refined during the iteration in such a way that the iteration error stays essentially on the level of discretization error. Subject classifications AMS: 65L05, 65F10.