Abstract
Computational tools in numerical algebraic geometry can be used to numerically approximate solutions to a system of polynomial equations. If the system is well-constrained (i.e., square), Newton’s method is locally quadratically convergent near each nonsingular solution. In such cases, Smale’s alpha theory can be used to certify that a given point is in the quadratic convergence basin of some solution. This was extended to certifiably determine the reality of the corresponding solution when the polynomial system is real. Using the theory of Newton-invariant sets, we certifiably decide the reality of projections of solutions. We apply this method to certifiably count the number of real and totally real tritangent planes for instances of curves of genus 4.
JDH was supported by Sloan Fellowship BR2014-110 TR14 and NSF ACI-1460032. SNS was supported by Schmitt Leadership Fellowship in Science and Engineering.
AK was partially supported by the Max Planck Institute for Mathematics in the Sciences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bates, D.J., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Bertini: software for numerical algebraic geometry. bertini.nd.edu
Bates, D.J., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Numerically Solving Polynomial Systems with Bertini. Software, Environments, and Tools, vol. 25. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2013)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998). https://doi.org/10.1007/978-1-4612-0701-6
Hauenstein, J.D.: Certification using Newton-invariant subspaces. In: Blömer, J., Kotsireas, I.S., Kutsia, T., Simos, D.E. (eds.) MACIS 2017. LNCS, vol. 10693, pp. 34–50. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72453-9_3
Hauenstein, J.D., Levandovskyy, V.: Certifying solutions to square systems of polynomial-exponential equations. J. Symb. Comput. 79(3), 575–593 (2017)
Hauenstein, J.D., Sottile, F.: Algorithm 921: alphaCertified: certifying solutions to polynomial systems. ACM ToMS 38(4), 28 (2012)
Gross, B.H., Harris, J.: Real algebraic curves. Ann. Sci. École Norm. Sup. (4) 14(2), 157–182 (1981)
Kulkarni, A., Ren, Y., Sayyary Namin, M., Sturmfels, B.: Real space sextics and their tritangents. arXiv:1712.06274 (2017)
Kummer, M.: Totally real theta characteristics. arXiv:1802.05297 (2018)
Morgan, A.P., Sommese, A.J.: Coefficient-parameter polynomial continuation. Appl. Math. Comput. 29, 123–160 (1989)
Shub, M., Smale, S.: Complexity of Bézout’s theorem. I. Geometric aspects. J. Amer. Math. Soc. 6(2), 459–501 (1993)
Sommese, A.J., Wampler II, C.W.: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science. World Scientific Publishing, Hackensack (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Hauenstein, J.D., Kulkarni, A., Sertöz, E.C., Sherman, S.N. (2018). Certifying Reality of Projections. In: Davenport, J., Kauers, M., Labahn, G., Urban, J. (eds) Mathematical Software – ICMS 2018. ICMS 2018. Lecture Notes in Computer Science(), vol 10931. Springer, Cham. https://doi.org/10.1007/978-3-319-96418-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-96418-8_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96417-1
Online ISBN: 978-3-319-96418-8
eBook Packages: Computer ScienceComputer Science (R0)