Skip to main content
SpringerLink
Log in

On pseudo-resultants

  • Solution Of Equations
  • Conference paper
  • First Online:
EUROSAM 84 (EUROSAM 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 174))

Included in the following conference series:

Abstract

Given an integral domain D and an indeterminate X over D, there exist many functionals mapping D[X]×D[X] into D that are similar to the resultant. If D is a Unique Factorization Domain, a specific functional, called the “minimal resultant”, could be useful in many places where a resultant would be required, and also for solving certain Diophantine Equations.

Work supported in part by the National Science Foundation under Grants MCS 82-02671 and MCS 78-02234 and by the Department of Energy under Grant DE-AS02-ER7602075-A010

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Buchberger, B., Collins, G. E. and Loos, R. editors, Computer Algebra, Symbolic and Algebraic Computation Springer-Verlag, Vienna, 1982, pages 173–188.

    Google Scholar 

  2. Collins, G. E. “Subresultants and Reduced Polynomial Remainder Sequences” ACM Journal, January 1967, Vol 14 Nr. 1

    Google Scholar 

  3. — “The Calculation of Multivariate Polynomial Resultants” ACM Journal, October 1971, Vol 18 Nr. 4

    Google Scholar 

  4. Griss, Martin L. “Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and GCD” IEEE Transactions on Computing, C-27 (1978), 945–950.

    Google Scholar 

  5. Herstein, I. N. Topics in Algebra Blaisdell Publishing Co. Waltham, Mass, 1964

    Google Scholar 

  6. Knuth, Donald E. The Art of Computer Programming Volume 2/Seminumerical Algorithms, Addison-Wesley Publishing Co., Reading, Mass., 1969.

    Google Scholar 

  7. Ku, S. Y. and Adler, R. J. “Computing Polynomial Resultants: Bezout's Determinant vs Collins' Reduced PRS Algorithm” CACM Vol 23 Nr 12 (Dec 1969)

    Google Scholar 

  8. Lauer, Markus “generalized p-Adic Constructions” SIAM J. Computing Vol 12 Nr 2, (May 1983), 395–410.

    Google Scholar 

  9. Loos P and Collins, G. E. “Resultant Algorithms for Exact Arithmetic on Algebraic Numbers” Paper presented at SIAM 1973 Natl Mtg, Hampton, Va.

    Google Scholar 

  10. Miola, Alfonso M. “The Conversion of Hensel Codes to their Rational Equivalents (or how to solve the Gregory's open problem)” SIGSAM Bulletin Number 64 (Vol 16 Number 4, November 1982)

    Google Scholar 

  11. Rothstein, M Aspects of Symbolic Integration and Simplification of Exponential and Primitive Functions Ph D Thesis, University of Wisconsin, Madison, 1976, (114 pages) Available from University Microfilms.

    Google Scholar 

  12. van der Waerden B L, Algebra I, Heidelberger Taschenbucher Nr 12, Springer-Verlag, Berlin, 1971 (German)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematical Sciences, Kent State University, 44242, Kent, OH

    Michael Rothstein

Authors
  1. Michael Rothstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Fitch

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rothstein, M. (1984). On pseudo-resultants. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032861

Download citation

  • DOI: https://doi.org/10.1007/BFb0032861

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13350-6

  • Online ISBN: 978-3-540-38893-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation