Parallel computation of polynomial GCD and some related parallel computations over abstract fields

Theoretical Computer Science

Volumn 162, Issue 2, 1996, Pages 173-223

  Pan, Victor Y ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS;

ABSTRACT FIELDS; EXTENDED EUCLIDEAN SCHEME; GREATEST COMMON DENOMINATOR; LEAST COMMON DENOMINATOR; PADE APPROXIMATION TABLE;

POLYNOMIALS;

EID: 0030214595     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00030-8     Document Type: Article

References (92)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. G.S. Ammar and W.G. Gragg, Superfast solution of real positive definite Toeplitz Systems, SIAM J. Matrix Anal. Appl. 9 (1988) 61-76.
3. A. Ben-Israel and T.N.E. Grevill, Generalized Inverses: Theory and Applications (Wiley, New York, 1974).
4. M. Ben-Or and P. Tiwari, Simple algorithm for approximating all roots of a polynomial with real roots, J. Complexity 6 (1990) 417-442.
5. E.R. Berlekamp, Algebraic Coding Theory (McGraw-Hill, New York, 1968).
6. S. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Inform. Proc. Lett. 18 (1984) 147-150.
7. D. Bini and L. Gemignani, On the Euclidean scheme for polynomials having interlaced real zeros, Proc. 2nd Ann. ACM Symp. on Parallel Algorithms and Architectures (ACM Press, New York, 1990) 254-258.
8. D. Bini and L. Gemignani, Fast parallel computation of the polynomial remainder sequence via Bezout and Hankel Matrices, SIAM J. Comput. 17 (1995) 63-77.
9. D. Bini and V.Y. Pan, Parallel complexity of tridiagonal symmetric eigenvalue problem, Proc. 2nd Ann. ACM-SIAM Symposium on Discrete Algorithms (ACM Press, New York, and SIAM Publications, Philadelphia, Pennsylvania, 1991) 384-393.
10. D. Bini and V.Y. Pan, Improved parallel polynomial division, Proc. 33rd Ann. IEEE Symp. on Foundation of Computer Science (IEEE Computer Society Press, 1992) 131-136, and SIAM J. Comput. 22 (1993) 617-626.
11. D. Bini and V.Y. Pan, Improved parallel polynomial division, Proc. 33rd Ann. IEEE Symp. on Foundation of Computer Science (IEEE Computer Society Press, 1992) 131-136, and SIAM J. Comput. 22 (1993) 617-626.
12. D. Bini and V.Y. Pan, Improved parallel computations with Toeplitz-like and Hankel-like Matrices, Linear Algebra Appl. 188, 189 (1993) 3-29 [Proce. version, in: M. Bronstein, ed., Proc. ACM- SIGAM Int. Symp. on Symbolic and Alg. Comp. (ISSAC '93) (ACM Press, New York, 1993) 193 -200].
13. D. Bini and V.Y. Pan, Improved parallel computations with Toeplitz-like and Hankel-like Matrices, Linear Algebra Appl. 188, 189 (1993) 3-29 [Proce. version, in: M. Bronstein, ed., Proc. ACM-SIGAM Int. Symp. on Symbolic and Alg. Comp. (ISSAC '93) (ACM Press, New York, 1993) 193 -200].
14. D. Bini and V.Y. Pan, Matrix and Polynomial Computations, Vol. 1: Fundamental Algorithms (Birkhauser, Boston, 1994).
15. D. Bini and V.Y. Pan, Matrix and Polynomial Computations, Vol. 1: Fundamental Algorithms, 2nd edn, to appear.
16. R.R. Bitmead and B.D.O. Anderson, Asymptotically fast solution of Toeplitz and related systems of linear equations, Linear Algebra Appl. 34 (1980) 103-116.
17. A. Borodin, J. von zur Gathen and J. Hopcroft, Fast parallel matrix and GCD computation, Inform. Control 52 (1982) 241-256.
18. R.P. Brent, The parallel evaluation of general arithmetic expressions, J. ACM 21 (1974) 201-206.
19. R.P. Brent, F.G. Gustavson and D.Y.Y. Yun, Fast solution of Toeplitz systems of equations and computation of Padé approximations, J. Algorithms 1 (1980) 259-295.
20. W.S. Brown, On Euclid's algorithm and the computation of polynomial greatest common divisors, J. ACM 18 (1971) 478-504.
21. W.S. Brown and J.F. Traub, On Euclid's algorithm and the theory of subresultants, J. ACM 18 (1971) 505-514.
22. A. Bruckstein and T. Kailath, An inverse scattering framework for several problems in signal processing, IEEE ASSP Magazine (1987) 6-20.
23. D.G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary rings, Acta Inform. 28 (1991) 697-701.
24. A.L. Chistov, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristics, Proc. FCT 85, Lecture Notes in Computer Science, Vol. 199 (Springer, Berlin, 1985) 63-69.
25. J. Chun, T. Kailath and H. Lev-Ari, Fast parallel algorithm for QR-factorization of structured matrices, SIAM J. Sci. Statist. Comput. 8 (1987) 899-913.
26. J. Chun and T. Kailath, Divide-and-conquer solution of least-squares problems for matrices with displacement structure, SIAM J. Matrix Anal. Appl. 12 (1991) 128-145.
27. G.E. Collins, Subresultants and reduced polynomial sequences, J. ACM 14 (1967) 128-142.
28. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990) 251-280.
29. L. Csanky, Fast parallel matrix inversion algorithm, SIAM J. Comput. 5 (1976) 618-623.
30. F.R. deHoog, On the solution of Toeplitz systems, Linear Algebra Appl. 88/89 (1987) 123-138.
31. R.A. Demillo and R.J. Lipton, A probabilistic remark on algebraic program testing, Inform. Process. Lett. 7 (1978) 193-195.
32. D. Eppstein and Z. Galil, Parallel algorithmic techniques for combinatorial computation, Ann. Rev. Comput. Sci. 3 (1988) 233-283.
33. Z. Galil and V.Y. Pan, Parallel evaluation of the determinant and of the inverse of a matrix, Inform. Proc. Lett. 30 (1989) 41-45.
34. J. von zur Gathen, Parallel algorithms for algebraic problems, SIAM J. Comput. 13 (1984) 802-824.
35. W.B. Gragg, The Padé table and its relation to certain algorithms of numerical analysis, SIAM Rev. 14 (1972) 1-62.
36. M.H. Gutknecht and W.B. Gragg, Stable look-ahead versions of the Euclidean and Chebyshev algorithms, IPS Research Report 94-04, ETH-Zentrum, Zürich, Switzerland, 1994.
37. J. Ja Ja, An Introduction to Parallel Algorithms (Addison-Wesley, Reading, MA, 1992).
38. T. Kailath, A view of three decades of linear filtering theory, IEEE Trans. Inform. Theory 20 (1974) 146-181.
39. T. Kailath, Signal processing applications of some moment problems, Proc. AMS Symp. Appl. Math. 37 (1987) 71-100.
40. T. Kailath and J. Chun, Generalized Gohberg-smencul formulas for matrix inversion, Operator Theory: Adv. Apll. 40 (1989) 231-246.
41. T. Kailath, S.-Y. Kung and M. Morf, Displacement ranks of matrices and linear equations, J. Math. Anal. Appl. 68 (1979) 395-407.
42. T. Kailath, A. Viera and M. Morf, Inverses of Toeplitz operators, innovations, and orthogonal polynomials, SIAM Rev. 20 (1978) 106-119.
43. S. Kakeya, On fundamental systems of symmetric functions, Japan J. of Math. 2 (1925) 69-80.
44. S. Kakeya, On fundamental systems of symmetric functions, Japan J. of Math. 4 (1927) 77-85.
45. E. Kaltofen, Asymptotically fast solution of Toeplitz-like singular linear systems, in: J. von zur Gathen and M. Giesbrecht eds., Proc. ACM-SIGSAM Internat. Symp. on Symbolic and Algebraic Comput. (ISSAC' 94) (ACM Press, New York, 1994) 297-304.
46. E. Kaltofen, Analysis of Coppersmith's Block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comput., to appear.
47. E. Kaltofen and V.Y. Pan, to appear.
48. E. Kaltofen and V.Y. Pan, Processor efficient parallel solution of linear systems over an abstract field, Proc. 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures (ACM Press, New York, 1991) 180-191.
49. E. Kaltofen and V.Y. Pan, Processor efficient parallel solution of linear systems II. The positive characteristic and singular cases, Proc. 33rd Ann. IEEE Symp. on Foundation of Computer Science (IEEE Computer Society Press, New York, 1992) 714-723.
50. E. Kaltofen and V.Y. Pan, Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic, in: Hoon Hong ed., Proc. First Intern. Symp. on Parallel Symbolic Computation (PASCO '94), Linz Austria (Sept. 1994), Lecture Notes in Computing, Vol. 5 (World Scientific Publishing Company, Singapore, 1994) 225-233.
51. E. Kaltofen and B.D. Saunders, On Wiedemann's method for solving sparse linear systems, Proc. AAECC-5, Lecture Note in Computer Science, Vol. 536 (Springer, Berlin, 1991) 29-38.
52. R. Karp and V. Ramachandran, A survey of parallel algorithms for shared memory machines, in: J. van Leeuwen, ed., Handbook for Theoretical Computer Science (North Holland, Amsterdam, 1990) 869-941.
53. H. Lev-Ari and T. Kailath, Lattice filter parametrization and modelling of nonstationary processes, IEEE Trans. Inform. Theory IT-30 (1984) 2-16.
54. H. Lev-Ari, T. Kailath and J. Cioffi, Least squares adaptive lattice and transversal filters; a unified geometrical theory, IEEE Trans. Inform. Theory IT-30 (1984) 222-236.
55. J. Makhoul, Linear prediction: a tutorial review, Proc. IEEE 63 (1975) 561-580.
56. M. Morf, Doubling algorithms for Toeplitz and related equations, Proc. IEEE Internat. Conf. on ASSP (IEEE Computer Society Press, New York, 1980) 954-959.
57. B.R. Musicus, Levinson and fast choleski algorithms for Toeplitz and almost Toeplitz matrices, Internal Report, Lab. of Electronics, M.I.T., Cambridge, MA, 1981.
58. K. Nakamura, On the representation of symmetric functions by power-sums which form the fundamental system, Japan J. Math. 4 (1927) 87-92.
59. V.Y. Pan, Fast and efficient parallel algorithms for the exact inversion of integer matrices, Proc. 5th Ann. Conf. on Foundation of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 206 (Springer, Berlin, 1985) 504-521
60. V.Y. Pan, Complexity of parallel matrix computations, Theoret. Comput. Sci. 54 (1987) 65-85.
61. V.Y. Pan, New effective methods for computations with structured matrices, Technical Report 88-28, Computer Science Dept., SUNY Albany, Albany, New York, 1988.
62. V.Y. Pan, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, Comput. Math. (with Appl.) 17 (1989) 1475-1480.
63. V.Y. Pan, On computations with dense structured matrices, Proc. ACM-SIGSAM Intern. Symp. on Symbolic and Algebraic Comp. (ISSAC' 89), (ACM Press, New York, 1989) 34-42 and Math. Comp. 55 (1990) 191, 179-190.
64. V.Y. Pan, On computations with dense structured matrices, Proc. ACM-SIGSAM Intern. Symp. on Symbolic and Algebraic Comp. (ISSAC' 89), (ACM Press, New York, 1989) 34-42 and Math. Comp. 55 (1990) 191, 179-190.
65. V.Y. Pan, Complexity of algorithms for linear systems of equations, in: E. Spedicato ed., Computer Algorithms for Solving Linear Algebraic Equations (The State of the Art), NATO ASI Series, Series F: Computer and Systems Sciences, Vol. 77 (Springer, Berlin 1991) 27-56.
66. V.Y. Pan, Parametrization of Newton's iteration for computations with structured matrices and applications, Comput. Math. (with Appl.) 24 (1992) 61-75.
67. V.Y. Pan, Complexity of computations with matrices and polynomials, SIAM Rev. 34 (1992) 225-262.
68. V.Y. Pan, Parallel solution of Toeplitzlike linear systems, J. Complexity 8 (1992) 1-21.
69. V.Y. Pan, Decreasing the displacement rank of a matrix, SIAM J. Matrix Anal. Appl. 14 (1993) 118 -121.
70. V.Y. Pan, On randomized parallel computations with general and Toeplitz-like matrices, manuscript, 1993.
71. V.Y. Pan, Concurrent iterative algorithm for Toeplitz-like linear systems, IEEE Trans. Parallel Distributed Systems 4 (1993) 592-600.
72. V.Y. Pan, Optimal and nearly optimal algorithms for approximating complex polynomial zeros, Computer Math. (with Appl.), (1996) to appear; also in Proc. 27th Ann. ACM Symp. on Theory of Computing (ACM Press, New York, 1995) 741-750.
73. V.Y. Pan, Optimal and nearly optimal algorithms for approximating complex polynomial zeros, Computer Math. (with Appl.), (1996) to appear; also in Proc. 27th Ann. ACM Symp. on Theory of Computing (ACM Press, New York, 1995) 741-750.
74. V.Y. Pan, Effective parallel computations with Toeplitz and Toeplitz-like matrices filled with integers, in: M. Shub, S. Smale and J. Renegar ed., Proc. AMS-SIAM Workshop on Mathematics of Numerical Analysis: Real Number Algorithms, Park City, Utah, June-July 1995 [Lectures in Applied Mathematics: Mathematics of Numerical Analysis 32 (1996)] (Amer. Math. Soc., Providence, RI, 1996) to appear.
75. V.Y. Pan, Effective parallel computations with Toeplitz and Toeplitz-like matrices filled with integers, in: M. Shub, S. Smale and J. Renegar ed., Proc. AMS-SIAM Workshop on Mathematics of Numerical Analysis: Real Number Algorithms, Park City, Utah, June-July 1995 [Lectures in Applied Mathematics: Mathematics of Numerical Analysis 32 (1996)] (Amer. Math. Soc., Providence, RI, 1996) to appear.
76. V.Y. Pan and F.P. Preparata, Work-preserving speed-up of parallel matrix computations, SIAM J. Comput. 24 (1995) 811-821.
77. V.Y. Pan and J. Reif, The parallel computation of the minimum cost paths in graphs by stream contraction, Inform. Process. Lett. 40 (1991) 79-83.
78. V.Y. Pan, A. Sadikou, E. Landowne and O. Tiga, A new approach to fast polynomial interpolation and multipoint evaluation, Comput. Math. (with Appl.) 25 (1993) 25-30.
79. F.P. Preparata and D.V. Sarwate, An improved parallel processor bound in fast matrix inversion, Inform. Proc. Lett. 1 (1978) 148-149.
80. M.J. Quinn, Parallel Computing: Theory and Practice (McGraw-Hill, New York, 1994).
81. 3 n) algorithm for the real root problem, Proc. 34rd Ann. IEEE Symp. on Foundations of Computer Science (IEEE Computer Society Press, New York, 1993) 626-635.
82. J.H. Reif, Work efficient parallel solution of Toeplitz systems and polynomial GCD, Proc. 27th Ann. ACM Symp. on Theory of Computing (ACM Press, New York, 1995) 751-761.
83. A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, manuscript, Dept. of Math., University of Tübingen, Tübingen, Germany, 1982.
84. A. Schönhage, Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic, Proc. 20th ICALP, Lecture Notes in Computer Science, Vol.700 (Springer, Berlin, 1993) 410-417.
85. J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980) 701-717.
86. V. Shoup, Fast construction of irreducible polynomials over finite fields, J. Symb. Comput. 17 (1994) 371-392.
87. W.F. Stewart, Introduction to the Numerical Solution of Markov Chains (Princeton University Press, Princeton, NJ, 1994).
88. K.T. Vahlen, Über Fundamentalsysteme für symmetrisch Functionen, Acta Mathematica 23 (1900) 91-120.
89. D.H. Wiedemann, Solving spare linear equations over finite fields, IEEE Trans. Inform. Theory IT-32 (1986) 54-62.
90. R.E. Zippel, Probabilistic algorithms for sparse polynomials, Proc. EUROSAM 79, Lecture Notes in Computer Science, Vol. 72 (Springer, Berlin, 1979) 216-226.
91. G.H. Golub and C.F. Van Loan, Matrix Computations (Johns Hopkins University Press, Baltimore, MD, 1989).
92. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes (Morgan Kaufmann, San Mateo, CA, 1992).