Skip to main content
SpringerLink
Log in

Normal Forms and Algebraic Representations

  • Chapter
Algorithms for Computer Algebra

  • 1160 Accesses

Abstract

This chapter is concerned with the computer representation of the algebraic objects discussed in Chapter 2. The zero equivalence problem is introduced and the important concepts of normal form and canonical form are defined. Various normal forms are presented for polynomials, rational functions, and power series. Finally data structures are considered for the representation of multiprecision integers, rational numbers, polynomials, rational functions, and power series.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. W.S. Brown, “On Computing with Factored Rational Expressions,” ACM S1GSAM Bull., 8 pp. 26–34 (1974).

    Article  Google Scholar 

  2. B.F. Caviness, “On Canonical Forms and Simplification,” J. ACM, 2 pp. 385–396 (1970).

    Article  MathSciNet  Google Scholar 

  3. B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan, and S.M. Watt, Maple V Language Reference Manual, Springer-Verlag (1991).

    Google Scholar 

  4. A.C. Hearn, “Polynomial and Rational Function Representations,” Tech. Report UCP-29, Univ. of Utah (1974).

    Google Scholar 

  5. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Maryland (1978).

    MATH  Google Scholar 

  6. A.D. Hall Jr., “The Altran System for Rational Function Manipulation — A Survey,” Comm. ACM, 14 pp. 517–521 (1971).

    Article  Google Scholar 

  7. J. Moses, “Algebraic Simplification: A Guide for the Perplexed,” Comm. ACM, 14 pp. 527–537 (1971).

    Article  MATH  MathSciNet  Google Scholar 

  8. A.C. Norman, “Computing with Formal Power Series,” ACM TOMS, 1 pp. 346–356 (1975).

    Article  MATH  Google Scholar 

  9. D. Richardson, “Some Unsolvable Problems Involving Elementary Functions of a Real Variable,” J. Symbolic Logic, 33 pp. 511–520 (1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Waterloo, Canada

    K. O. Geddes & G. Labahn

  2. Laurentian University, Canada

    S. R. Czapor

Authors
  1. K. O. Geddes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. R. Czapor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Labahn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Kluwer Academic Publishers

About this chapter

Cite this chapter

Geddes, K.O., Czapor, S.R., Labahn, G. (1992). Normal Forms and Algebraic Representations. In: Algorithms for Computer Algebra. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-33247-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-0-585-33247-5_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-9259-0

  • Online ISBN: 978-0-585-33247-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation