Skip to main content
SpringerLink
Log in

A Note on Sekigawa’s Zero Separation Bound

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8136))

Included in the following conference series:

  • 882 Accesses

Abstract

Regarding zero separation bounds for arithmetic expressions, we prove that the bfms bound dominates the Sekigawa bound for division-free radical expressions with integer operands.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: Efficient exact geometric computation made easy. In: Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 341–350 (1999)

    Google Scholar 

  2. Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: A strong and easily computable separation bound for arithmetic expressions involving radicals. Algorithmica 27(1), 87–99 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Burnikel, C., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: A separation bound for real algebraic expressions. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 254–265. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Canny, J.F.: The complexity of robot motion planning. MIT Press, Cambridge (1988)

    Google Scholar 

  5. Cgal, Computational Geometry Algorithms Library, http://www.cgal.org

  6. Edelsbrunner, H., Mücke, E.P.: Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9(1), 66–104 (1990)

    Article  MATH  Google Scholar 

  7. Emiris, I.Z., Mourrain, B., Tsigaridas, E.P.: The DMM bound: multivariate (aggregate) separation bounds. In: ISSAC 2010, pp. 243–250 (2010)

    Google Scholar 

  8. Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.: A core library for robust numeric and geometric computation. In: Proceedings of the 15th Annual ACM Symposium on Computational Geometry, Miami, Florida, pp. 351–359 (1999)

    Google Scholar 

  9. Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.: Classroom examples of robustness problems in geometric computations. Computational Geometry: Theory and Applications 40(1), 61–78 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Li, C., Yap, C.: A new constructive root bound for algebraic expressions. In: 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) (January 2001)

    Google Scholar 

  11. Mehlhorn, K., Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  12. Mignotte, M.: Mathematics for computer algebra. Springer-Verlag New York, Inc., New York (1992)

    Book  MATH  Google Scholar 

  13. Mörig, M., Rössling, I., Schirra, S.: On design and implementation of a generic number type for real algebraic number computations based on expression dags. Mathematics in Computer Science 4(4), 539–556 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pion, S., Yap, C.: Constructive root bound for k-ary rational input numbers. Journal of Theoretical Computer Science (TCS) 369(1-3), 361–376 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Scheinerman, E.R.: When close enough is close enough. Am. Math. Mon. 107(6), 489–499 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schirra, S.: Robustness and precision issues in geometric computation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, ch. 14, pp. 597–632. Elsevier (1999)

    Google Scholar 

  17. Seidel, R.: The nature and meaning of perturbations in geometric computing. Discrete & Computational Geometry 19(1), 1–17 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sekigawa, H.: Using interval computation with the Mahler measure for zero determination of algebraic numbers. Josai University Information Sciences Research 9(1), 83–99 (1998)

    MathSciNet  Google Scholar 

  19. Sekigawa, H.: Zero Determination of Algebraic Numbers using Approximate Computation and its Application to Algorithms in Computer Algebra. PhD thesis, University of Tokyo (2004)

    Google Scholar 

  20. Yap, C.K.: Towards exact geometric computation. Computational Geometry: Theory and Applications 7, 3–23 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yap, C.-K.: Fundamental problems of algorithmic algebra. Oxford University Press (2000)

    Google Scholar 

  22. Yap, C.K.: Robust geometric computation. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 41, 2nd edn., pp. 927–952. Chapmen & Hall/CRC, Boca Raton (2004); revised and expanded from 1997 version

    Google Scholar 

  23. Yap, C.K.: In praise of numerical computation. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 380–407. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  24. Yap, C.K., Dubé, T.: The exact computation paradigm. In: Du, D.-Z., Hwang, F.K. (eds.) Computing in Euclidean Geometry, 2nd edn. Lecture Notes Series on Computing, vol. 4, pp. 452–492. World Scientific, Singapore (1995)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Department of Simulation and Graphics, Otto von Guericke University Magdeburg, 39106, Magdeburg, Germany

    Stefan Schirra

Authors
  1. Stefan Schirra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Joint Institute for Nuclear Research, Dubna, Moscow Region, Russia

    Vladimir P. Gerdt

  2. Institut für Mathematik, Universität Kassel, Heinrich-Plett-Straße 40, 34132, Kassel, Germany

    Wolfram Koepf

  3. Technische Universität München, 85748, Garching, Germany

    Ernst W. Mayr

  4. Khristianovich Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, 630090, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Schirra, S. (2013). A Note on Sekigawa’s Zero Separation Bound. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2013. Lecture Notes in Computer Science, vol 8136. Springer, Cham. https://doi.org/10.1007/978-3-319-02297-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02297-0_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02296-3

  • Online ISBN: 978-3-319-02297-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation