On computing determinants of matrices without divisions

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn Part F129620, Issue , 1992, Pages 342-349

  Kaltofen, Erich ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

ADJOINT MATRIX; COMMUTATIVE RING; FAST MATRIX MULTIPLICATION; N-MATRIX; RUNNING TIME;

MATRIX ALGEBRA;

EID: 49249136112     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/143242.143350     Document Type: Conference Paper

References (31)

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. Brent, R. P., Gustavson, F. G., and Yun, D. Y. Y., "Fast solution of Toeplitz systems of equations and computation of Padé approximants", J. Algorithms 1, pp. 259-295 (1980).
4. Cantor, D. G. and Kaltofen, E., "On fast multiplication of polynomials over arbitrary rings", Acta inform. 28/7, pp. 693-701 (1991).
5. 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).
6. Coppersmith, D. and Winograd, S., "Matrix multiplication via arithmetic progressions", J. Symbolic Corn-put. 9/3, pp. 251-280 (1990).
7. Davenport, J. H. and Trager, B. M., "Scratchpad's view of algebra I: basic commutative algebra", in Design and Implementation of Symbolic Computation Systems, Springer Lect. Notes Comput. Sci. 429, edited by A. Miola; pp. 40-54, 1988.
8. Dornstetter, J. L., "On the equivalence between Berle-kamp's and Euclid's algorithms", IEEE Trans. Inf. Theory IT-33/3, pp. 428-431 (1987).
9. Duval, D., "Simultaneous computations in fields of different characteristics", in Computers and Mathematics, edited by E. Kaltofen and S. M. Watt; Springer-Verlag, New York, pp. 321-326, 1989.
10. 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).
11. Graham, R. L., Knuth, D. E., and Patashnik, O., Concrete Mathematics; Addison-Wesley Publ. Comp., Reading, Massachusetts, 1989.
12. Jacobson, N., Basic Algebra I; W. H. Freeman & Co., San Francisco, 1974.
13. Kaltofen, E., "Greatest common divisors of polynomials given by straight-line programs", J. ACM 35/1, pp. 231-264 (1988).
14. Kaltofen, E., "Factorization of polynomials given by straight-line programs", in Randomness and Computation, Advances in Computing Research 5, edited by S. Micali; JAI Press, Greenwhich, Connecticut, pp. 375-412, 1989.
15. Kaltofen, E., "Efficient Solution of Sparse Linear Systems", Lect. Notes, Dept. Comput. Sci., Rensselaer Polytech. Inst., Troy, New York, 1992.
16. Kaltofen, E. and Pan, V., "Processor efficient parallel solution of linear systems over an abstract field", in Proc. 3rd Ann. ACM Symp. Parallel Algor. Architecture; ACM Press, pp. 180-191, 1991.
17. Kaltofen, E. and Saunders, B. D., "On Wiedemann's method of solving sparse linear systems", in Proc. AAECC-5, Springer Lect. Notes Comput. Sci. 536; pp. 29-38, 1991.
18. Kaltofen, E. and Trager, B., "Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators", J. Symbolic Comput. 9/3, pp. 301-320 (1990).
19. Knuth, D. E., "The analysis of algorithms", Actes du congrès international des Mathématiciens 3, pp. 269274 (1970).
20. Kung, H. T., "On computing reciprocals of power series", Numer. Math. 22, pp. 341-348 (1974).
21. Linnainmaa, S., "Taylor expansion of the accumulated rounding error", BIT 16, pp. 146-160 (1976).
22. Massey, J. L., "Shift-register synthesis and BCH decoding", IEEE Trans. Inf. Theory IT-15, pp. 122-127 (1969).
23. Moenck, R. T., "Fast computation of GCDs", Proc. 5th ACM Symp. Theory Comp., pp. 142-151 (1973).
24. 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).
25. Richardson, D., "Some undecidable problems involving elementary functions of a real variable", J. Symbolic Logic 33/4, pp. 511-520 (1968).
26. Sasaki, T. and Murao, H., "Efficient Gaussian elimination method for symbolic determinants and linear systems", ACM Trans. Math. Software 8/3, pp. 277-289 (1982).
27. Schönhage, A., "Schnelle Kettenbruchentwicklungen", Acta Inform. 1, pp. 139-144 (1971). In German.
28. Sieveking, M., "An algorithm for division of power series", Computing 10, pp. 153-156 (1972).
29. Strassen, V., "Vermeidung von Divisionen", J. reine u. angew. Math. 264, pp. 182-202 (1973). In German.
30. Strassen, V., "The computational complexity of continued fractions", SIAM J. Comput. 12/1, pp. 1-27 (1983).
31. Wiedemann, D., "Solving sparse linear equations over finite fields", IEEE Trans. Inf. Theory IT-32, pp. 5462 (1986).