Processor efficient parallel solution of linear systems over an abstract field

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991

Volumn , Issue , 1991, Pages 180-191

  Kaltofen, Erich ^a,c   Pan, Victor ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS; MATRIX ALGEBRA; PARALLEL ALGORITHMS;

ARITHMETIC OPERATIONS; COUNT MEASURE; DIMENSIONAL SYSTEMS; HIGH PROBABILITY; NON SINGULAR MATRICES; PARALLEL SOLUTIONS; RANDOM ELEMENTS; RANDOMIZED ALGORITHMS;

PARALLEL ARCHITECTURES;

EID: 85058940739     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113379.113396     Document Type: Conference Paper

References (25)

1. Baur, W. and Strassen, V., "The complexity of partial derivatives," Theoretical Comp. Sci. 22, pp. 317-330 (1983).
2. Berkowitz, S. J., "On computing the determinant in small parallel time using a small number of processors," Inform. Process. Letters 18, pp. 147-150 (1984).
3. Bini, D. and Pan, V., Numerical and Algebraic Computations with Matrices and Polynomials; Lecture Notes in Theor. Comput. Sci., edited by R. V. Book; Birkhauser Boston, Inc., 1991. To appear.
4. Borodin, A., von zur Gathen, J., and Hopcroft, J. E., "Fast parallel matrix and GCD computations," Inf. Control 52, pp. 241-256 (1982).
5. Borodin, A. and Munro, I., Computational Complexity of Algebraic and Numeric Problems; American Elsevier, New York, N.Y., 1975.
6. Brent, R. P., Gustavson, F. G., and Yun, D. Y. Y., "Fast solution of Toeplitz systems of equations and computation of Pade approximants," J. Algorithms 1, pp. 259-295 (1980).
7. Bunch, J. R. and Hopcroft, J. E., "Triangular factorization and inversion by fast matrix multiplication," Math. Comp. 28, pp. 231-236 (1974).
8. Cantor, D. G. and Kaltofen, E., "Fast multiplication of polynomials over arbitrary rings," Tedi. Report 8735, Dept. Comput. Sci., Rensselaer Polytechnic Institute, December 1987. Revised version to appear in Acta Informatica.
9. Chistov, A. L., "Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic," Proc. FCT '85, Springer Lec. Notes Comp. Sci. 199, pp. 63-69 (1985).
10. Coppersmith, D. and Winograd, S., "Matrix multiplication via arithmetic progressions," J. Symbolic Comput. 9/3, pp. 251-280 (1990).
11. Csanky, L., "Fast parallel matrix inversion algorithms," SIAM J. Comput. 5/4, pp. 618-623 (1976).
12. Galil, Z. and Pan, V., "Parallel evaluation of the determinant and of the inverse of a matrix," Inform. Process. Letters 30, pp. 41-45 (1989).
13. Hoover, H. J., Klawe, M. M., and Pippenger, N. J., "Bounding fan-out in logical networks," J. ACM 31/1, pp. 13-18 (1984).
14. Kaltofen, E. and Singer, M. F., "Size efficient parallel algebraic circuits for partial derivatives," Tech. Report 90-32, Dept. Comput. Sci., Rensselaer Polytechnic Inst., Troy, N.Y., October 1990.
15. Kaminski, M., Kirkpatrick, D. G., and Bshouty, N. H., "Addition requirements for matrix and transposed matrix products," J. Algorithms 9, pp. 354-364 (1988).
16. Karp, R. M. and Ramachandran, V., "Parallel algorithms for shared-memory machines," in Handbook for Theoretical Computer Science; North-Holland, pp. 869-941, 1990.
17. Keller-Gehrig, W., "Fast algorithms for the characteristic polynomial," Theor. Comput. Sci. 36, pp. 309-317 (1985).
18. Lipson, J., Elements of Algebra and Algebraic Computing; Addison-Wesley Publ., Reading, Mass., 1981.
19. Pan, V., "Parallel least-square solution of general and Toeplitz-like linear systems," Proc. 2nd Ann. Symp. Parallel Algorithms Architecture, pp. 244-253 (1990a).
20. Pan, V., "Parameterization of Newton's iteration for computations with structured matrices and applications," Tedi. Report CUCS-032-90, Comput. Sci. Dept., Columbia University, New York, N. Y., 1990b.
21. Preparata, F. P. and Sarwate, D. V., "An improved parallel processor bound in fast matrix inversion," Inform. Process. Letters 7/3, pp. 148-150 (1978).
22. Schwartz, J. T., "Fast probabilistic algorithms for verification of polynomial identities," J. ACM 27, pp. 701-717 (1980).
23. Schonhage, A., "The fundamental theorem of algebra in terms of computational complexity," Tech. Report, Univ. Tubingen, 1982.
24. Wiedemann, D., "Solving sparse linear equations over finite fields," IEEE Trans. Inf. Theory IT-32, pp. 54-62 (1986).
25. Zippel, R. E., "Probabilistic algorithms for sparse polynomials," Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci. 72, pp. 216-226 (1979).