Informatica

The problem associated with the stiff ordinary differential equation (ODE) systems in parallel processing is that the calculus can not be started simultaneously on many processors with an explicit formula. The proposed algorithm is constructed for a special classes of stiff ODE, those of the form y′(t)=A(t)y(t)+g(t). It has a high efficiency in the implementation on a distributed memory multiprocessor when the ODEs function has many components. The approximation error is equal to that produced by the analogous sequential algorithm.

The article is dedicated to Newton's method for solving non-linear equation systems. The Kantorovich convergence theorem assumes that the derivative of the system function is Lipschitz continuous. Our purpose is to provide error estimates in the case of a Hölder continuous derivative.