Deformation techniques to solve generalised Pham systems

DOI10.1016/j.tcs.2004.01.009zbMath1053.65038OpenAlexW2030515241MaRDI QIDQ598226

Luis Miguel Pardo, Jorge Alonso San Martín

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.009

zbMATH Keywords

complexityGeneralised Pham systemGeometric degreeHomotopic deformationUniversal algorithms

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Complexity and performance of numerical algorithms (65Y20)

Related Items

Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, 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, A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density, Factorization patterns on nonlinear families of univariate polynomials over a finite field, Deformation techniques for sparse systems

Uses Software

• Kronecker

Cites Work

• 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
• On computing the determinant in small parallel time using a small number of processors
• Definability and fast quantifier elimination in algebraically closed fields
• Lectures on results on Bezout's theorem. Notes by D. P. Patil
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Factoring polynomials with rational coefficients
• Complexity of Bezout's theorem. V: Polynomial time
• Structured matrices and Newton's iteration: unified approach
• Lower bounds for diophantine approximations
• Straight-line programs in geometric elimination theory
• The hardness of polynomial equation solving
• Toric Newton method for polynomial homotopies
• Some speed-ups and speed limits for real algebraic geometry
• Sharp estimates for the arithmetic Nullstellensatz
• Bounds of traces in complete intersections and degrees in the Nullstellensatz
• On the intrinsic complexity of the arithmetic Nullstellensatz
• Deformation techniques for efficient polynomial equation solving.
• Multivariate polynomials, duality, and structured matrices
• Complexity of Bezout's theorem. III: Condition number and packing
• On the efficiency of effective Nullstellensätze
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• The fundamental theorem of algebra and complexity theory
• The Distribution of Galois Groups and Hilbert's Irreducibility Theorem
• Complexity of Bezout's Theorem I: Geometric Aspects
• Fast Parallel Matrix Inversion Algorithms
• The intrinsic complexity of parametric elimination methods
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• Le rôle des structures de données dans les problèmes d'élimination
• Computing Multidimensional Residues
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• On the time-space complexity of geometric elimination procedures
• A Gröbner free alternative for polynomial system solving
• Kronecker's and Newton's approaches to solving: a first comparison