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...

Tae-Hwa Kim and Hong-Kun Xu [Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups, Nonlinear Analysis 64(2006)1140-1152 ] proved the strong convergence theorems of modified Mann iterations for asymptotically nonexpansive mappings and semigroups on bounded subset C of a Hilbert space by the CQ iteration method. The purpose of this paper is to mod...

We start with a discussion of coupled algebraic Riccati equations arising in the study of linear-quadratic optimal control problem for Markov jump linear systems. Under suitable assumptions, this system of equations has a unique positive semidefinite solution, which is the solution of practical interest. The coupled equations can be rewritten as a single linearly perturbed matrix Riccati equati...

We show how two iterated products of selection functions can both be used in conjunction with system T to interpret, via the dialectica interpretation and modified realizability, full classical analysis. We also show that one iterated product is equivalent over system T to Spector’s bar recursion, whereas the other is T-equivalent to modified bar recursion. Modified bar recursion itself is show...

In this paper, the Sawada-Kotera equation is solved by using the Adomian’s decomposition method, modified Adomian’s decomposition method, variational iteration method, modified variational iteration method, homotopy perturbation method, modified homotopy perturbation method and homotopy analysis method. The approximate solution of this equation is calculated in the form of series which its comp...

Problem 1 (Convergence of Richardson iteration). This method’s operator has the form T = I − BA = I − ωA because B = ωI. The eigenvectors of T are – as is easy to verify, the same as those of A, and the eigenvalues of T are λi(T ) = 1− ωλi(A). To prove that the method converges, it is convenient to verify that the l2 norm of T is less than one because we can then express everything in terms of ...

This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance.  First the problem is encoded with a...

Given a linear iteration of the form x := F (x), we consider modified versions of the form x := F (x + γd), where d is a fixed direction, and γ is chosen to minimize the norm of the residual ‖x + γd − F (x + γd)‖. We propose ways to choose d so that the convergence rate of the modified iteration is governed by the subdominant eigenvalue of the original. In the special case where F relates to a ...

We introduce a new three step iterative scheme with errors to approximate the unique common fixed point of a family of three strongly pseudocontractive (accretive) mappings on Banach spaces. Our results are generalizations and improvements of results obtained by several authors in literature. In particular, they generalize and improve the results of Mogbademu and Olaleru [A. A. Mogbademu and J....