Skip to main content
SpringerLink
Log in

Algorithm and Implementation for Computation of Jordan Form over A[x 1,...,x m ]

  • Conference paper
Computers and Mathematics

  • 134 Accesses

Abstract

I outline a sequential algorithm for computation of the Jordan form for matrices in K = A[x1,... ,xm], with A an unique factorization domain with separability. The algorithm has average cost (for K integers) of O(n4L(d)2). I have implemented this algorithm in MACSYMA and it is currently distributed as part of the Climax system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buchberger B., Collins G.E., and Loos R.,–Computer Algebra:Symbolic and Algebraic Manipulation”, Springer, Wien, 1982.

    Google Scholar 

  2. Kaltofen E., Krishnamoorthy M., and Saunders B.D., “Fast Parallel Algorithms for Similarity of Matrices”, SYMSAC 1986, Proc. of 1986 Symposium on Symbolic and Alg. Computation, July 21–23, Waterloo, Ontario, B. Char ed., 1986, ACM.

    Google Scholar 

  3. ibid.“Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices”, SIAM J.Alg.Disc.Math., vol. 8, no. 4, October 1987, pp. 683–690.

    Google Scholar 

  4. Kannan R., Bachem A.“Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix”, SIAM J. Computing, vol. 8, no. 4, November 1979, pp. 499–507.

    Article  MATH  MathSciNet  Google Scholar 

  5. Lang S.“Algebra”, Addison Wesley, Reading, Massachusetts, 1974.

    MATH  Google Scholar 

  6. Najid-Zejli H.“Computations in Radical Extensions”, in Proc. Eurosam 84:Springer Lecture Notes in Computer Science 174, Springer-Verlag, Berlin, 1984, pp. 115–122.

    Google Scholar 

  7. Strauss N.“Jordan Form and Eigen Finite Field”, The Macsyma Newsletter, Symbolics Inc., Cambridge, Massachusetts, October, 1985.

    Google Scholar 

  8. ibid.“Jordan Form of a Binomial Coefficient Matrix over Zp”, Linear Algebra and Its Applications, 90:65–72, no. 7, Elsevier.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departemento de Matematica, Pontificia Universidade Catolica, Rio De Janeiro, R.J., Brasil

    Nicholas Strauss

Authors
  1. Nicholas Strauss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rensselaer Polytechnic, Troy, NY, 12180, USA

    Erich Kaltofen

  2. IBM Watson Research Center, Yorktown Heights, NY, 10598, USA

    Stephen M. Watt

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag New York Inc.

About this paper

Cite this paper

Strauss, N. (1989). Algorithm and Implementation for Computation of Jordan Form over A[x 1,...,x m ]. In: Kaltofen, E., Watt, S.M. (eds) Computers and Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9647-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-9647-5_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97019-6

  • Online ISBN: 978-1-4613-9647-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation