The concepts of S and Sn programs are given by Davis, Weyuker, 1983. Several parts of the complexity theory are carried out directly for S and Sn programs. The concepts of non-deterministic and deterministic computation ...

Convexity in metric space is the main topic of discussion in this thesis. To undertake the study we have studied extensively the means introduced by Doss and included the results concerning means derived by Gahier ...

In this thesis we are concerned with iterative parallel algorithms for solving finite difference equations arising from boundary value problems. We propose various new methods based on approximate inverses. The Jacobi ...

In this thesis we study the approximate inverse based multigrid algorithm FAPIN for the solution of large sparse linear systems of equations. This algorithm, which is closely related to the well known multigrid V-cycle, ...

Since the mid 19th century it has been known that every Desarguean projective’ plane is coordinatizable over a division ring. This coordinatization procedure was used by von Neumann [9] to show that every complemented ...