
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
T.A. Rice, L.H. Jamieson, "A Highly Parallel Algorithm for Root Extraction," IEEE Transactions on Computers, vol. 38, no. 3, pp. 443449, March, 1989.  
BibTex  x  
@article{ 10.1109/12.21130, author = {T.A. Rice and L.H. Jamieson}, title = {A Highly Parallel Algorithm for Root Extraction}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {3}, issn = {00189340}, year = {1989}, pages = {443449}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.21130}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Highly Parallel Algorithm for Root Extraction IS  3 SN  00189340 SP443 EP449 EPD  443449 A1  T.A. Rice, A1  L.H. Jamieson, PY  1989 KW  highly parallel algorithm; root extraction; roots of a polynomial; iterative technique; interprocessor communication; SIMD machine; arithmetic complexity; computational complexity; iterative methods; parallel algorithms; polynomials. VL  38 JA  IEEE Transactions on Computers ER   
[1] E. H. Bareiss, "Resultant procedure and the mechanization of the Graeffe process,"J. ACM, vol. 7, pp. 346386, Oct. 1960.
[2] G. Barneset al., "The Illiac IV computer,"IEEE Trans. Comput., pp. 746757, Aug. 1968.
[3] B. A. Crane, "PEPE computer architecture," inProc. COMPCON, Sept. 1972, pp. 5760.
[4] M. J. Flynn, "Very highspeed computing systems,"Proc. IEEE, vol. 54, pp. 19011909, Dec. 1966.
[5] P. Henrici,Elements of Numerical Analysis. New York: Wiley, 1964.
[6] F. B. Hildebrand,Introduction to Numerical Analysis. New York: McGrawHill, 1956, ch. 2.
[7] M. A. Jenkins and J. F. Traub, "A threestage algorithm for real polynomials using quadratic iteration,"SIAM J. Numer. Anal., pp. 545566, Dec. 1970.
[8] M. A. Jenkins and J. F. Traub, "Zeros of a real polynomial,"ACM Trans. Math. Software, 1975.
[9] T. Kanade and J. Webb, "Vision on a systolic array machine," inProc. DARPA Comput. Architecture Vision Workshop, May 1984, pp. 2125.
[10] W. L. Miranker, "Parallel methods for approximating the root of a function,"IBM J. Res. Develop., pp. 297301, 1969.
[11] W. L. Miranker, "A survey of parallelism in numerical analysis,"SIAM Rev., pp. 524547, Oct. 1971.
[12] NCR Corp., Digital Signal Processing Technical Seminar Supplemental Documents, Fort Collins, CO, 1985.
[13] A. Norton and G. F. Pfister, "A methodology for predicting multiprocessor performance," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 772781.
[14] G. F. Pfisteret al., "The IBM research parallel processor prototype (RP3): Introduction and architecture," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 764771.
[15] H. J. Siegel, L. J. Siegel, F. C. Kemmerer, P. T. Mueller, Jr., H. E. Smalley, Jr., and S. D. Smith, "PASM: A partitionable SIMD/MIMD system for image processing and pattern recognition,"IEEE Trans. Comput., vol. C30, pp. 934947, Dec. 1981.
[16] G. S. Shedler, "Parallel numerical methods for the solution of equations,"Commun. ACM, pp. 286290, May 1967.
[17] H. J. Siegel,Interconnection Networks for LargeScale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[18] K. J. Thurber,Large Scale Computer Architecture: Parallel and Associative Processors. Rochelle Park, NJ: Hayden, 1976.
[19] J. A. Webb and T. Kanade, "Vision on a systolic array machine," inEvaluation of Multicomputers for Image Processing, L. Uhr, K. Preston, Jr., S. Levialdi, and M. J. B. Duff, Eds. Orlando, FL: Academic, 1986, pp. 181201.
[20] S. Winograd, "Parallel iteration methods," inComplexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 5360.