Polynomial equation solving by lifting procedures for ramified fibers

DOI10.1016/j.tcs.2004.01.015zbMath1060.65054OpenAlexW1992722016MaRDI QIDQ598210

Guillermo Matera, Rosita Wachenchauzer, Ariel Waissbein, Agustín Bompadre

Publication date: 6 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.015

zbMATH Keywords

numerical examplesNewton-Hensel liftingmultivariate polynomial systemsPuiseux expansion of space curvesramified fibers of dominant mappingssymbolic elimination methods

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Real polynomials: location of zeros (26C10)

Related Items

Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Polynomial equation solving by lifting procedures for ramified fibers, A concise proof of the Kronecker polynomial system solver from scratch, Solving determinantal systems using homotopy techniques, On the bit complexity of polynomial system solving, Homotopy techniques for solving sparse column support determinantal polynomial systems, The method of Gauss-Newton to compute power series solutions of polynomial homotopies, Deformation techniques for sparse systems, Computing critical points for invariant algebraic systems

Uses Software

• Kronecker
• PoSSo
• ISOLATE

Cites Work

• Polynomial equation solving by lifting procedures for ramified fibers
• Definability and fast quantifier elimination in algebraically closed fields
• Cauchy index computation
• Geometric theory of semilinear parabolic equations
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Lectures on deformations of singularities. Notes by C. S. Seshadri, Allen Tannenbaum
• Solving zero-dimensional systems through the rational univariate representation
• On the complexity of rational Puiseux expansions
• Algebraic geometry I: algebraic curves, algebraic manifolds and schemes. Transl. from the Russian by D. Coray and V. N. Shokurov
• Lower bounds for diophantine approximations
• Straight-line programs in geometric elimination theory
• The hardness of polynomial equation solving
• Computing parametric geometric resolutions
• Deformation techniques for efficient polynomial equation solving.
• Multivariate polynomials, duality, and structured matrices
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Le rôle des structures de données dans les problèmes d'élimination
• Blow-up vs. spurious steady solutions
• NUMERICAL BLOW-UP FOR A NONLINEAR PROBLEM WITH A NONLINEAR BOUNDARY CONDITION
• What can be computed in algebraic geometry?
• A Polyhedral Method for Solving Sparse Polynomial Systems
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
• On the time-space complexity of geometric elimination procedures
• A Gröbner free alternative for polynomial system solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item