Skip to main content

SyNRAC: A Toolbox for Solving Real Algebraic Constraints

  • Conference paper
Mathematical Software – ICMS 2014 (ICMS 2014)

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

Included in the following conference series:

Abstract

We introduce various aspects of the design and the implementation of a symbolic/symbolic-numeric computation toolbox, called SyNRAC. SyNRAC is a package of commands written in the Maple language and the C language. This package indeed provides an environment for dealing with first-order formulas over the reals.

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

Access this chapter

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. Anai, H., Hara, S.: Fixed-structure robust controller synthesis based on sign definite condition by a special quantifier elimination. In: Proceedings of American Control Conference, vol. 2, pp. 1312–1316 (2000)

    Google Scholar 

  2. Anai, H., Hara, S.: A parameter space approach to fixed-order robust controller synthesis by quantifier elimination. International Journal of Control 79(11), 1321–1330 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brown, C.W.: QEPCAD B: A program for computing with semi-algebraic sets using CADs. SIGSAM Bulletin 37, 97–108 (2003)

    Article  MATH  Google Scholar 

  4. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)

    Google Scholar 

  5. Dolzmann, A., Sturm, T.: Simplification of quantifier-free formulas over ordered fields. Journal of Symbolic Computation 24, 209–231 (1995)

    Article  MathSciNet  Google Scholar 

  6. Dolzmann, A., Sturm, T.: REDLOG computer algebra meets computer logic. ACM SIGSAM Bulletin 31, 2–9 (1996)

    Article  Google Scholar 

  7. González-Vega, L., Recio, T., Lombardi, H., Roy, M.-F.: Sturm-Habicht sequences determinants and real roots of univariate polynomials, pp. 300–316. Springer, Vienna (1998), softcover reprint of the original 1st ed. 1998 edition

    Google Scholar 

  8. Iwane, H., Higuchi, H., Anai, H.: An effective implementation of a special quantifier elimination for a sign definite condition by logical formula simplification. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 194–208. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Iwane, H., Yanami, H., Anai, H.: A symbolic-numeric approach to multi-objective optimization in manufacturing design. Mathematics in Computer Science 5(3), 315–334 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  10. Iwane, H., Yanami, H., Anai, H., Yokoyama, K.: An effective implementation of symbolic–numeric cylindrical algebraic decomposition for quantifier elimination. Theoretical Computer Science 479, 43–69 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Matsui, Y., Iwane, H., Anai, H.: Two controller design procedures using SDP and QE for a power supply unit. In: Development of Computer Algebra Research and Collaboration with Industry. COE Lecture Note, vol. 49, pp. 43–51 (2013)

    Google Scholar 

  12. Strzeboński, A.W.: Cylindrical algebraic decomposition using validated numerics. Journal of Symbolic Computation 41(9), 1021–1038 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Tarski, A.: A decision method for elementary algebra and geometry, 2nd edn. University of California Press (1952)

    Google Scholar 

  14. Weispfenning, V.: The complexity of linear problems in fields. Journal of Symbolic Computation 5, 3–27 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  15. Weispfenning, V.: Quantifier elimination for real algebra - the quadratic case and beyond. Applicable Algebra in Engineering, Communication and Computing 8, 85–101 (1993)

    Article  MathSciNet  Google Scholar 

  16. Wilson, D.J., Bradford, R.J., Davenport, J.H.: Speeding up cylindrical algebraic decomposition by Gröbner bases. CoRR, abs/1205.6285 (2012)

    Google Scholar 

  17. Yanami, H.: Multi-objective design based on symbolic computation and its application to hard disk slider design. Journal of Math-for-Industry 1, 149–156 (2009)

    MATH  MathSciNet  Google Scholar 

  18. Yanami, H., Anai, H.: The Maple package SyNRAC and its application to robust control design. Future Generation Computer Systems 23(5), 721–726 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwane, H., Yanami, H., Anai, H. (2014). SyNRAC: A Toolbox for Solving Real Algebraic Constraints. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44199-2_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44198-5

  • Online ISBN: 978-3-662-44199-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics