This is the authors' abstract. We don't add key points for this paper.
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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
W. L. Miranker (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: