Solving linear systems by methods based on a probabilistic interpretation

In this paper it is demonstrated how the probabilistic concept of a stopping time in a random process may be used to generate an iterative method for solving a system of linear equations. Actually all known iterative approximation methods for solving linear equations are generated by various choices of a stopping time e.g. the point and block Jacobi methods, the point and block Gauss-Seidel Methods and overrelaxation methods are covered. The probabilistic approach offers -in a natural way- the possibility of adapting the solution technique to the special structure of the problem. Moreover, posterior bounds for the solution are constructed, which lead to faster convergence of the approximations than with usual prior bounds