|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
BOJAIqCZYK, A.Solving systems of algebraic equations in different models of computation. Ph.D thesis, Institute of Informatics, Univ. Warsaw, Warsaw, Poland, June 198 l, (in Polish).
|
| |
3
|
KUNG, H. T.Synchronized and asynchronous parallcI algorithms for muldprocessors, In New Dtrecttons and Recent Results m Algorithms and Complexity, J. F. Traub, ~d. Academic Press, New York, 1976.
|
| |
4
|
SHAMANSKII, V. E. A modification of Newton's method. Ukr. Mat. Zh. 19 (Sept. 1967), 210--220.
|
| |
5
|
TRMJB, J. F.lterat~ve Methods for the Solution of Equations. Prentice-Hall, Englewood Cliffs, N.J., 1964.
|
| |
6
|
TRAUB, J. F., AND WO#-NIAKOWSKI, H.Strict lower and upper bounds on iterative computational complexity. In New Dtrectwns and Results in Algorithms and Complexity, J. E Traub, ~d. Academic Press, New York, 1976, pp. 15-34.
|
| |
7
|
TRAUB, J. F., AND WOZNIAKOWSKI, H. Optimal radius of convergence of interpolatory iterations for operator equations. Aequattones Math. 21, 159-172.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.1