It often happens that iteration processes used for solving the implicit relations arising in ODE-IVP methods only start to converge rapidly after a certain number of iterations. Fast convergence right from the beginning is particularly important if we want to use so-called step-parallel iteration in which the iteration method is concurrently applied at a number of step points. In this paper, we...

By simply transforming the quadratic matrix equation into an equivalent fixed-point equation, we construct a successive approximation method and a Newton’s method based on this fixed-point equation. Under suitable conditions, we prove the local convergence of these two methods, as well as the linear convergence speed of the successive approximation method and the quadratic convergence speed of ...

in this paper, we present two new families of third-order and fourth-order methods for finding multiple roots of nonlinear equations. each of them requires one evaluation of the function and two of its first derivative per iteration. several numerical examples are given to illustrate the performance of the presented methods.

Abstract. This paper presents a modification of Krylov subspace spectral (KSS) methods, which build on the work of Golub, Meurant and others, pertaining to moments and Gaussian quadrature to produce high-order accurate approximate solutions to variable-coefficient time-dependent PDEs. Whereas KSS methods currently use Lanczos iteration to compute the needed quadrature rules, our modification us...

To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H+-matrix, which improve the existing converg...

We consider the classical policy iteration method of dynamic programming (DP), where approximations and simulation are used to deal with the curse of dimensionality. We survey a number of issues: convergence and rate of convergence of approximate policy evaluation methods, singularity and susceptibility to simulation noise of policy evaluation, exploration issues, constrained and enhanced polic...