We investigate effectiveness of an acceleration method applied to the modified Picard iteration for simulations of variably saturated flow. We solve nonlinear systems using both unaccelerated and accelerated modified Picard iteration as well as Newton’s method. Since Picard iterations can be slow to converge, the advantage of acceleration is to provide faster convergence while maintaining advan...

In this paper we study dynamic iteration techniques for nonlinear differential equations with mixed modification of the argument. The dynamic iteration method generalizes the well known Picard iterations, improving significantly the convergence speed of the iterative process. It also have the advantage of decoupling the part containing the modified argument so the iteration steps consist in sol...

For a class of quasi-contractive operators defined on an arbitrary Banach space, it has been shown that the Picard iteration technique converges faster than the Mann iteration technique. In this paper we make a comparison of the Picard and Mann iterations with respect to their convergence rate for a more general class of operators called quasi-contractions in metrizable topological vector space...

In this paper, we prove some fixed points properties and demiclosedness principle for a Banach operator in uniformly convex hyperbolic spaces. We further propose an iterative scheme for approximating a fixed point of a Banach operator and establish some strong and $Delta$-convergence theorems for such operator in the frame work of uniformly convex hyperbolic spaces. The results obtained in this...

We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point iteration. Important applications are the Picard iteration and partitioned fluid structure interaction. We prove that the iteration converges irrespective of ho...