Skip to main content

On improving approximate results of Buchberger's algorithm by Newton's method

  • Algebraic Algorithms V
  • Conference paper
  • First Online:

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

Abstract

In some applications of Buchberger's algorithm it is possible to avoid the use of multiple precision arithmetics in the main part of the calculations, even if the results are large numbers.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Bob F. Caviness

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trinks, W. (1985). On improving approximate results of Buchberger's algorithm by Newton's method. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_342

Download citation

  • DOI: https://doi.org/10.1007/3-540-15984-3_342

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15984-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics