Skip to main content

A Parallel Method of Verifying Solutions for Systems of Two Nonlinear Equations

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2019)

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

Abstract

The paper describes a new algorithm for verifying solutions of nonlinear systems of equations. Interval methods provide us a few tools for such verification. Some of them are based on topological theorems. Also our new test is based on checking the extendability of the function from a subspace of the boundary of the box to its interior. For a system of two equations, we can provide an efficient implementation. Generalization to a higher number of equations is also theoretically possible, yet cumbersome. Some numerical results are presented.

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 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. C++ eXtended Scientific Computing library (2017). http://www.xsc.de

  2. HIBA\_USNE, C++ library (2017). https://www.researchgate.net/publication/316687827_HIBA_USNE_Heuristical_Interval_Branch-and-prune_Algorithm_for_Underdetermined_and_well-determined_Systems_of_Nonlinear_Equations_-_Beta_25

  3. Intel TBB (2017). http://www.threadingbuildingblocks.org

  4. Franek, P., Krčál, M.: Robust satisfiability of systems of equations. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 193–203. SIAM (2014)

    Google Scholar 

  5. Franek, P., Ratschan, S.: Effective topological degree computation based on interval arithmetic. Math. Comput. 84(293), 1265–1290 (2015)

    Article  MathSciNet  Google Scholar 

  6. Frommer, A., Lang, B.: Existence tests for solutions of nonlinear equations using Borsuk’s theorem. SIAM J. Numer. Anal. 43(3), 1348–1361 (2005)

    Article  MathSciNet  Google Scholar 

  7. Goldsztejn, A.: Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests. Computing 79(1), 53–60 (2007)

    Article  MathSciNet  Google Scholar 

  8. Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer, London (2001). https://doi.org/10.1007/978-1-4471-0249-6_2

    Book  MATH  Google Scholar 

  9. Kearfott, R.B.: An efficient degree-computation method for a generalized method of bisection. Numerische Mathematik 32(2), 109–127 (1979)

    Article  MathSciNet  Google Scholar 

  10. Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht (1996)

    Book  Google Scholar 

  11. Kearfott, R.B., Nakao, M.T., Neumaier, A., Rump, S.M., Shary, S.P., van Hentenryck, P.: Standardized notation in interval analysis. Vychislennyie Tiehnologii (Comput. Technol.) 15(1), 7–13 (2010)

    MATH  Google Scholar 

  12. Kubica, B.J.: Interval methods for solving underdetermined nonlinear equations systems. In: SCAN 2008 Proceedings Reliable Computing, vol. 15, pp. 207–217 (2011)

    Google Scholar 

  13. Kubica, B.J.: Tuning the multithreaded interval method for solving underdetermined systems of nonlinear equations. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds.) PPAM 2011. LNCS, vol. 7204, pp. 467–476. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31500-8_48

    Chapter  Google Scholar 

  14. Kubica, B.J.: Using quadratic approximations in an interval method for solving underdetermined and well-determined nonlinear systems. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds.) PPAM 2013. LNCS, vol. 8385, pp. 623–633. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-55195-6_59

    Chapter  Google Scholar 

  15. Kubica, B.J.: Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems. Numer. Algorithms 70(4), 929–963 (2015)

    Article  MathSciNet  Google Scholar 

  16. Kubica, B.J.: Parallelization of a bound-consistency enforcing procedure and its application in solving nonlinear systems. J. Parallel Distrib. Comput. 107, 57–66 (2017)

    Article  Google Scholar 

  17. Kubica, B.J.: Role of hull-consistency in the HIBA\(\_\)USNE multithreaded solver for nonlinear systems. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017. LNCS, vol. 10778, pp. 381–390. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78054-2_36

    Chapter  Google Scholar 

  18. Kubica, B.J.: Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems: From Inequalities Systems to Game Solutions. Studies in Computational Intelligence, vol. 805. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-030-13795-3

    Book  MATH  Google Scholar 

  19. Shary, S.P.: Finite-dimensional Interval Analysis. Institute of Computational Technologies, SB RAS, Novosibirsk (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bartłomiej Jacek Kubica .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kubica, B.J., Kurek, J. (2020). A Parallel Method of Verifying Solutions for Systems of Two Nonlinear Equations. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K. (eds) Parallel Processing and Applied Mathematics. PPAM 2019. Lecture Notes in Computer Science(), vol 12044. Springer, Cham. https://doi.org/10.1007/978-3-030-43222-5_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-43222-5_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-43221-8

  • Online ISBN: 978-3-030-43222-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics