Fast and efficient parallel algorithms for the exact inversion of integer matrices

  • Victor Pan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 206)


Let A = (aij) be a nonsingular n×n integer matrix such that log ∥A∥ ≤ no(1), \(\mathop {\max }\limits_{i,j}\) |aij| ≤ ∥A∥ ≤ n \(\mathop {\max }\limits_{i,j}\) |aij|. Then adj A, A−1 and all the coefficients of the characteristic polynomial of A including det A can be exactly evaluated on arithmetic circuits using O(log2n) parallel steps and M(n) processors where M(n) is the minimum number of processors required in order to multiply two n×n matrices in O(log n) steps, M(n) = o(n2.5). This substantially improves the processor bound \(\sqrt n\) M(n) of [Preparata and Sarwate, 78] and extends the recent results of [Pan and Reif, 85], where the same complexity estimates were obtained for the approximate evaluation of A−1 and under the additional assumption that A is a well-conditioned or strongly diagonally dominant matrix. All arithmetic operations can be performed with the precision of ≤ d bits so the total cost of computation is only O(log(dn))2 steps, o(n2.496d log d log log d) processors under the Boolean circuit model of parallel computation. Here d is O(n2log(n∥A∥) in the worst case; d is O(n log(n∥A∥)) with probability 1-O(1/(nh−1∥A∥h)) for arbitrary constant h. This extends our \(\sqrt n\)-improvement of the efficiency of the previously known algorithms to the case of the Boolean circuit model and consequently increases the efficiency of the known parallel algorithms for several related algebraic and combinatorial problems.

Key Words

Parallel algorithms computational complexity matrix inversion systems of linear equations determinant characteristic polynomial of a matrix 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Berkowitz, S., “On Computing the Determinant in Small Parallel Time Using a Small Number of Processors”, Information Processing Letters 18, 147–150 (1984).CrossRefGoogle Scholar
  2. Bini, D., and V. Pan, “Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power,” to appear in Information Processing Letters.Google Scholar
  3. Borodin, A., S. Cook and N. Pippenger, “Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines,” Information and Control 58, 113–136 (1983).CrossRefGoogle Scholar
  4. Borodin, A., J. von zur Gathen, and J. Hopcroft, “Fast Parallel Matrix and GCD Computations”, Proc. 23-rd Ann. ACM FOCS, 65–71 (1982) and Information and Control 53, 5 241–256 (1982).Google Scholar
  5. Borodin, A. and I. Munro, The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York (1975).Google Scholar
  6. Coppersmith, D. and S. Winograd, “On the Asymptotic Complexity of Matrix Multiplication”, SIAM J. on Computing 11(3), 472–492 (1982).CrossRefGoogle Scholar
  7. Csanky, L., “Fast Parallel Matrix Inversion Algorithms”, SIAM J. on Computing 5(4), 618–623 (1976).CrossRefGoogle Scholar
  8. Eberly, W., “Very Fast Parallel Matrix and Polynomial Arithmetic,” Proc. 25-th Ann. IEEE Symp. FOCS, 21–30 (1984).Google Scholar
  9. Galil, Z. and V. Pan, “Fast and Efficient Parallel Computation of Perfect Matching,” Tech. Report, Columbia University, N.Y. (March 1985).Google Scholar
  10. Gathen, I. von zur, “Parallel Algorithms for Algebraic Problems”, SIAM J. on Computing 13, 4, 802–824 (1984).CrossRefGoogle Scholar
  11. Golub, G.H. and C.F. van Loan, Matrix Computation, The Johns Hopkins University Press, Baltimore (1983).Google Scholar
  12. Ireland, K. and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag (1982).Google Scholar
  13. Keller, W., Fast Algorithms for the Characteristic Polynomial, Master's Thesis, Institüt für Angewandte Mathematik, Univ. Zürich (1982).Google Scholar
  14. Knuth, D.E., The Art of Computer Programming: Seminumerical Algorithms, v.2, Addison-Wesley (1981).Google Scholar
  15. Marcus, M. and H. Minc, A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston (1964).Google Scholar
  16. Moenck, R.T., and J.H. Carter, “Approximate Algorithms to Derive Exact Solutions to Systems of Linear Equations”, Proc. EUROSAM 1979, Lecture Notes in Computer Science 72, 63–73, Springer (1979).Google Scholar
  17. Pan, V., The Bit-Complexity of the Convolution of Vectors and of the DFT, Tech. Report TR-80-6, Computer Science Dept., SUNY Albany, New York, (May 1980).Google Scholar
  18. Pan, V., How to Multiply Matrices Faster, Lecture Notes in Computer Science 179, Springer-Verlag, Berlin (1984).Google Scholar
  19. Pan, V., “The Bit Complexity of Matrix Multiplication and of Related Computational Problems in Linear Algebra. The Segmented λ Algorithms”, Nota Interna, Dept. of Informatica, University of Pisa, Italy (August 1984), to appear in Computers and Mathematics (with Applications) (1984a).Google Scholar
  20. Pan, V., and J. Reif, Fast and Efficient Parallel Solution of Linear Systems, Tech. Report TR-02-85, Center for Research in Computer Technology, Aiken Computation Laboratory, Harvard University (1985), (Short version in Proc. 17-th Ann. ACM Symp. on Theory of Computing, 143–152, Providence, R.I. (1985)).Google Scholar
  21. Preparata, F.P. and D.V. Sarwate, “An Improved Parallel Processor Bound in Fast Matrix Inversion”, Information Processing Letters 7(3), 148–149 (1978).CrossRefGoogle Scholar
  22. Savage, J.E., The Complexity of Computing, John Wiley and Sons, N.Y. (1976).Google Scholar
  23. Schwartz, J.T., “Fast Probabilistic Algorithms for Verification of Polynomial Identities,” J. of ACM 27(4), 701–717 (1980).CrossRefGoogle Scholar
  24. Wilkinson, J.H., The Algebraic Eigenvalue Problem, Clarendon Press, Oxford (1965).Google Scholar
  25. Yun, D.Y.Y., “Algebraic Algorithms Using p-adic Constructions”, Proc. 1976 ACM Symp. Symbolic and Algebraic Computation, 248–259 (1976).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Victor Pan
    • 1
  1. 1.Computer Science DepartmentState University of New York at AlbanyAlbany

Personalised recommendations