We present a class of methods for approximating the root of a function. The methods are designed for execution on a parallel processor and when they are so executed, the speed of the approximation process is increased. The increase in speed is estimated analytically by computations of the order of convergence of the various methods presented.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.