The method called Arnoldi is currently a very popular method to solve largescale eigenvalue problems. The general purpose of this paper is to generalize Arnoldi to the characteristic equation of a delay-differential equation (DDE), here called a delay eigenvalue problem. The DDE can equivalently be expressed with a linear infinite dimensional operator which eigenvalues are the solutions to the ...

We study the numerical behavior of stationary one-step or two-step matrix splitting iteration methods for solving large sparse systems of linear equations. We show that inexact solutions of inner linear systems associated with the matrix splittings may considerably influence the accuracy of the approximate solutions computed in finite precision arithmetic. For a general stationary matrix splitt...

In this paper, we define and study convergence of an Ishikawa type iteration scheme with a new and weaker control condition for two nonself asymptotically quasi-nonexpansive mappings on a uniformly convex Banach space.

In this paper, we discuss the convergence of random Ishikawa iteration scheme to a common random fixed point for a certain class of random operators in Banach spaces. AMS Mathematics Subject Classification (2010): 47H10, 54H25

The CORDIC algorithm is a well-known iterative method for the computation of vector rotation. However, the major disadvantage is its relatively slow computational speed. For applications that require forward rotation (or vector rotation) only, we propose a new scheme, the modified vector rotational CORDIC (MVR-CORDIC) algorithm, to improve the speed performance of CORDIC algorithm. The basic id...