Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Robust Numerical Algebraic Geometry (2403.18749v1)

Published 27 Mar 2024 in math.NA and cs.NA

Abstract: The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a member of a parameterized family of polynomial systems where the parameter values may be measured with imprecision or arise from prior numerical computations, uncertainty may arise in the structure of the solution set, including the number of isolated solutions, the existence of higher dimensional solution components, and the number of irreducible components along with their multiplicities. The loci where these structures change form a stratification of exceptional algebraic sets in the space of parameters. We describe methodologies for making the interpretation of numerical results more robust by searching for nearby parameter values on an exceptional set. We demonstrate these techniques on several illustrative examples and then treat several more substantial problems arising from the kinematics of mechanisms and robots.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. Ideals of the multiview variety. IEEE Transactions on Pattern Analysis and Machine Intelligence, 43(4):1279–1292, 2021.
  2. Recovering exact results from inexact numerical data in algebraic geometry. Experimental Mathematics, 22(1):38–50, 2013.
  3. A numerical local dimension test for points on the solution set of a system of polynomial equations. SIAM Journal on Numerical Analysis, 47(5):3608–3623, 2009.
  4. Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials. In Approximate Commutative Algebra, pages 55–77. Springer Vienna, 2010.
  5. Bertini: Software for numerical algebraic geometry. Available at bertini.nd.edu.
  6. Numerically Solving Polynomial Systems with Bertini. SIAM, Philadelphia, 2013.
  7. Complexity and Real Computation. Springer-Verlag, New York, 1998.
  8. Decomposing solution sets of polynomial systems using derivatives. In G.-M. Greuel, T. Koch, P. Paule, and A. Sommese, editors, Mathematical Software – ICMS 2016, pages 127–135, Cham, 2016. Springer International Publishing.
  9. P. Breiding and S. Timme. Homotopycontinuation.jl: A package for homotopy continuation in Julia. In J. Davenport, M. Kauers, G. Labahn, and J. Urban, editors, Mathematical Software – ICMS 2018, pages 458–465, Cham, 2018. Springer International Publishing.
  10. T. Brysiewicz and M. Burr. Sparse trace tests. Math. Comp., 92(344):2893–2922, 2023.
  11. B. H. Dayton and Z. Zeng. Computing the multiplicity structure in solving polynomial systems. In Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, ISSAC ’05, page 116–123, New York, NY, USA, 2005. Association for Computing Machinery.
  12. A. M. Dickenstein. Algebraic geometry tools in systems biology. Notices of the AMS, 67(11):1706–1715, 2020.
  13. Trifocal relative pose from lines at points. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2022.
  14. Real solutions to systems of polynomial equations and parameter continuation. Adv. Geom., 15(2):173–187, 2015.
  15. Numerical computation of the Hilbert function and regularity of a zero dimensional scheme. In S. M. Cooper and S. Sather-Wagstaff, editors, Connections Between Algebra, Combinatorics, and Geometry, pages 235–250, New York, NY, 2014. Springer New York.
  16. Algorithm 931: an algorithm and software for computing multiplicity structures at zeros of nonlinear systems. ACM Trans. Math. Software, 40(1):Art. 5, 16, 2013.
  17. Multiprojective witness sets and a trace test. Advances in Geometry, 20(3):297–318, 2020.
  18. Exceptional Stewart–Gough platforms, Segre embeddings, and the special Euclidean group. SIAM Journal on Applied Algebra and Geometry, 2(1):179–205, 2018.
  19. Witness sets of projections. Appl. Math. Comput., 217(7):3349–3354, 2010.
  20. Membership tests for images of algebraic sets by linear projections. Appl. Math. Comput., 219(12):6809–6818, 2013.
  21. Regenerative cascade homotopies for solving polynomial systems. Appl. Math Comput., 218(4):1240–1246, 2011.
  22. J. D. Hauenstein and F. Sottile. Algorithm 921: alphaCertified: Certifying solutions to polynomial systems. ACM Trans. Math. Softw., 38(4), 2012.
  23. Unification and extension of intersection algorithms in numerical algebraic geometry. Appl. Math Comput., 293:226–243, 2017.
  24. A. Heyden and K. Åström. Algebraic properties of multilinear constraints. Mathematical Methods in the Applied Sciences, 20(13):1135–1162, 1997.
  25. B. Huber and B. Sturmfels. A polyhedral method for solving sparse polynomial systems. Mathematics of Computation, 64(212):1541–1555, 1995.
  26. W. Kahan. Conserving confluence curbs ill-condition. Technical report, Computer Science Department, University of California, Berkeley, 1972.
  27. A. Leykin. NAG4M2: Numerical algebraic geometry for Macaulay2. Available at people.math.gatech.edu/~aleykin3/NAG4M2.
  28. Trace test. Arnold Math. J., 4(1):113–125, 2018.
  29. T.-Y. Li. Numerical solution of multivariate polynomial systems by homotopy continuation methods. Acta numerica, 6:399–436, 1997.
  30. An Invitation to 3-D Vision: From Images to Geometric Models, volume 26. Springer, 2004.
  31. F. S. Macaulay. The Algebraic Theory of Modular Systems. Cambridge Mathematical Library. Cambridge University Press, Cambridge, 1994. Revised reprint of the 1916 original, with an introduction by Paul Roberts.
  32. R. E. Moore. Methods and Applications of Interval Analysis. Society for Industrial and Applied Mathematics, 1979.
  33. A. P. Morgan. A transformation to avoid solutions at infinity for polynomial systems. Appl. Math. Comput., 18(1):77–86, 1986.
  34. A. P. Morgan. Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems, volume 57 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2009. Reprint of the 1987 original.
  35. A homotopy for solving general polynomial systems that respects m-homogeneous structures. Appl. Math Comput., 24(2):101–113, 1987.
  36. Coefficient-parameter polynomial continuation. Appl. Math. Comput., 29(2, part II):123–160, 1989.
  37. Chemical reaction systems with toric steady states. Bulletin of Mathematical Biology, 74:1027–1065, 2012.
  38. M. Raghavan and B. Roth. Solving polynomial systems for the kinematic analysis and synthesis of mechanisms and robot manipulators. J. Vib. Acoust., 117(B):71–79, 1995.
  39. S. Smale. Newton’s method estimates from data at one point. In The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics (Laramie, Wyo., 1985), pages 185–196. Springer, New York, 1986.
  40. A. J. Sommese and J. Verschelde. Numerical homotopies to compute generic points on positive dimensional algebraic sets. Journal of Complexity, 16(3):572–602, 2000.
  41. Using monodromy to decompose solution sets of polynomial systems into irreducible components. In Applications of Algebraic Geometry to Coding Theory, Physics and Computation (Eilat, 2001), volume 36 of NATO Sci. Ser. II Math. Phys. Chem., pages 297–315. Kluwer Acad. Publ., Dordrecht, 2001.
  42. Symmetric functions applied to decomposing solution sets of polynomial systems. SIAM Journal on Numerical Analysis, 40(6):2026–2046, 2002.
  43. Numerical algebraic geometry. In The Mathematics of Numerical Analysis (Park City, UT, 1995), volume 32 of Lectures in Appl. Math., pages 749–763. Amer. Math. Soc., Providence, RI, 1996.
  44. The Numerical Solution of Systems of Polynomials Arising in Engineering and Science. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2005.
  45. Exceptional sets and fiber products. Found. Comput. Math., 8(2):171–196, 2008.
  46. H. J. Stetter. Numerical Polynomial Algebra. Society for Industrial and Applied Mathematics, USA, 2004.
  47. Solving the kinematics of the most general six-and five-degree-of-freedom manipulators by continuation methods. J. Mech., Trans., and Automation, 107(2):189–200, 1985.
  48. J. Verschelde. Polynomial homotopy continuation with PHCpack. ACM Communications in Computer Algebra, 44(3/4):217–220, 2011.
  49. Homotopies exploiting newton polytopes for solving sparse polynomial systems. SIAM Journal on Numerical Analysis, 31(3):915–930, 1994.
  50. C. W. Wampler. Isotropic coordinates, circularity, and Bezout numbers: planar kinematics from a new perspective. In International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, volume 2A: 24th Biennial Mechanisms Conference, page V02AT02A073, 1996.
  51. Mechanism mobility and a local dimension test. Mechanism and Machine Theory, 46(9):1193–1206, 2011.
  52. Numerical algebraic geometry and algebraic kinematics. Acta Numer., 20:469–567, 2011.
  53. W. Wu and Z. Zeng. The numerical factorization of polynomials. Foundations of Computational Mathematics, 17(1):259–286, 2017.
  54. Z. Zeng. The closedness subspace method for computing the multiplicity structure of a polynomial system. In Interactions of Classical and Numerical Algebraic Geometry, volume 496 of Contemp. Math., pages 347–362. Amer. Math. Soc., Providence, RI, 2009.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets