Skip to main content
SpringerLink
Log in

The Subideal Version of the SOI-Algorithm and Its Application

  • Conference paper
  • First Online:
Bio-inspired Computing – Theories and Applications (BIC-TA 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 682))

  • 1063 Accesses

Abstract

The coordinates of the empirical points are known with only limited precision, typically up to a permitted tolerance \(\varepsilon \). In this paper, we present an algorithm which computes stable border bases of the ideal \(I\cap J\), where I is the approximately vanishing ideal of an empirical point set, and J is the vanishing ideal of an exact point set. This algorithm is the subideal version of the SOI-Algorithm and it can be applied to the production allocation problem in the Algebraic Oil Research Project.

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 EPUB and 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

References

  1. Sauer, T.: Approximate varieties, approximate ideals and dimension reductions. Numer. Algorithms 45, 295–313 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Heldt, D., Kreuzer, M., Pokutta, S., Poulisse, H.: Approximate computation of zero-dimensional polynomial ideals. J. Symb. Comput. 44, 1566–1591 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Abbott, J., Fassino, C., Torrente, M.: Stable border bases for ideals of points. J. Symb. Comput. 43, 883–894 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fassino, C.: Almost vanishing polynomials for sets of limited precision points. J. Symb. Comput. 45, 19–37 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kreuzer, M., Poulisse, H.: Subideal border bases. Math. Comput. 80, 1135–1154 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  6. The algebraic oil research project. http://www.fim.uni-passau.de/algebraic-oil

  7. Kreuzer, M., Poulisse, H., Robbiano, L.: From oil fields to Hilbert schemes. In: Robbiano, L., Abbott, J. (eds.) Approximate Commutative Algebra. Springer, Berlin (2010)

    Google Scholar 

  8. Kehrein, A., Kreuzer, M.: Characterizations of border bases. J. Pure Appl. Algebra 196, 251–270 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kehrein, A., Kreuzer, M., Robbiano, L.: An algebraists view on border bases. In: Bronstein, M., Cohen, A.M., Cohen, H., Eisenbud, D., Sturmfels, B., Dickenstein, A., Emiris, I.Z. (eds.) Solving Polynomial Equations. Springer, Berlin (2005)

    Google Scholar 

  10. Kreuzer, M., Robbiano, L.: Computational Commutative Algebra 1. Springer, Berlin (2008)

    MATH  Google Scholar 

  11. Kreuzer, M., Robbiano, L.: Computational Commutative Algebra 2. Springer, Berlin (2008)

    MATH  Google Scholar 

  12. Stetter, H.J.: Numerical Polynomial Algebra. SIAM, Philadelphia (2004)

    Book  MATH  Google Scholar 

  13. Mourrain, B., Ruatta, O.: Relation between roots and coefficients, interpolation and application to system solving. J. Symb. Comput. 33, 679–699 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Möller, H.M., Buchberger, B.: The construction of multivariate polynomials with preassigned zeros. In: Calmet, J. (ed.) EUROCAM 1982. LNCS, vol. 144, pp. 24–31. Springer, Heidelberg (1982). doi:10.1007/3-540-11607-9_3

    Chapter  Google Scholar 

  15. Abbott, J., Bigatti, A., Kreuzer, M., Robbiano, L.: Computing ideals of points. J. Symb. Comput. 30, 341–356 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work is supported by Jilin Province Department of Education Science and Technology Research Project under Grants 2015131 and 2015156.

Author information

Authors and Affiliations

  1. College of Mathematics and Statistics, Beihua University, Jilin, 132013, China

    Haifeng Sang & Qingchun Li

  2. School of Mathematics, Jilin University, Changchun, 130012, China

    Haifeng Sang

Authors
  1. Haifeng Sang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qingchun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haifeng Sang .

Editor information

Editors and Affiliations

  1. Xidian University , Xi’an, China

    Maoguo Gong

  2. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  3. China University of Petroleum, Qingdao, China

    Tao Song

  4. Southwest Jiaotong University , Chengdu, China

    Gexiang Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Sang, H., Li, Q. (2016). The Subideal Version of the SOI-Algorithm and Its Application. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds) Bio-inspired Computing – Theories and Applications. BIC-TA 2016. Communications in Computer and Information Science, vol 682. Springer, Singapore. https://doi.org/10.1007/978-981-10-3614-9_36

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3614-9_36

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3613-2

  • Online ISBN: 978-981-10-3614-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation