Exact computation of the characteristic polynomial of an integer matrix

  • Asish Mukhopadhyay
  • Vangalur S. Alagar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 229)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Chatres, B.E., “Controlled Precision Calculations and the Danilevskii's Method”, Brown University, Division of Applied Mathematics Report, 1964.Google Scholar
  2. [2]
    Demidovich, B.P. and Maron, I.A., “Computational Mathematics”, Mir Publishers, Moscow, pp. 412–419, 1976.Google Scholar
  3. [3]
    Fank, W.I., “Computing Eingenvalues of Complex Matrices by Determinant Evaluation and by Methods of Danilevskii and Wielandt”, J. Siam, Vol. 6, pp. 378–392, 1958.Google Scholar
  4. [4]
    Hansen, E.R., “On the Danilevskii Method”, JACM. Vol. 10, pp. 102–109.Google Scholar
  5. [5]
    Koblitz, N., “P-adic Numbers, p-adic Analysis and Zeta Functions”, Springer-Verlag, Berlin, 1977.Google Scholar
  6. [6]
    Kornerup, P. and Gregory, R.T., “Mapping Integer and Hensel Codes onto Farey Fractions”, BIT 23, 1983.Google Scholar
  7. [7]
    Krishnamurthy, E.V., Mahadev Rao, T. and Subramanian, K., “Finite Segment p-adic Number System with Application to Exact Computation”, Proc. Indian Academy of Science, Vol. 81, Sec. A, No. 2, pp. 58–79, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Asish Mukhopadhyay
    • 1
  • Vangalur S. Alagar
    • 1
  1. 1.Department of Computer ScienceConcordia UniversityMontrealCanada

Personalised recommendations