Deformation techniques to solve generalised Pham systems

DOI10.1016/J.TCS.2004.01.009MaRDI QIDQ598226zbMATH OpenOpenAlexFDO

Authors Luis Miguel Pardo, Jorge 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)

Recommendations

• scientific article; zbMATH DE number 3954172
• scientific article; zbMATH DE number 1176642
• Improved general mapping deformation method for nonlinear partial differential equations in mathematical physics
• Deformation from symmetry and multiplicity of solutions in non-homogeneous problems
• scientific article; zbMATH DE number 3869866
• scientific article; zbMATH DE number 4028472
• Deformation techniques for sparse systems
• On deformations of linear differential systems
• Algebraic deformation for (S)PDEs

Cites work

• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• A Gröbner free alternative for polynomial system solving
• Bounds of traces in complete intersections and degrees in the Nullstellensatz
• Complexity of Bezout's Theorem I: Geometric Aspects
• Complexity of Bezout's theorem. III: Condition number and packing
• Complexity of Bezout's theorem. V: Polynomial time
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Computing Multidimensional Residues
• Definability and fast quantifier elimination in algebraically closed fields
• Deformation techniques for efficient polynomial equation solving.
• Factoring polynomials with rational coefficients
• Fast Parallel Matrix Inversion Algorithms
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• scientific article; zbMATH DE number 421657 (Why is no real title available?)
• scientific article; zbMATH DE number 3859276 (Why is no real title available?)
• scientific article; zbMATH DE number 3809326 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3759547 (Why is no real title available?)
• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 3550860 (Why is no real title available?)
• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 621806 (Why is no real title available?)
• scientific article; zbMATH DE number 1736023 (Why is no real title available?)
• scientific article; zbMATH DE number 1008369 (Why is no real title available?)
• scientific article; zbMATH DE number 1057737 (Why is no real title available?)
• scientific article; zbMATH DE number 1057749 (Why is no real title available?)
• scientific article; zbMATH DE number 1142301 (Why is no real title available?)
• scientific article; zbMATH DE number 939812 (Why is no real title available?)
• scientific article; zbMATH DE number 1827070 (Why is no real title available?)
• scientific article; zbMATH DE number 806915 (Why is no real title available?)
• scientific article; zbMATH DE number 3893305 (Why is no real title available?)
• scientific article; zbMATH DE number 3227305 (Why is no real title available?)
• scientific article; zbMATH DE number 3334305 (Why is no real title available?)
• scientific article; zbMATH DE number 3196340 (Why is no real title available?)
• Kronecker's and Newton's approaches to solving: a first comparison
• Le rôle des structures de données dans les problèmes d'élimination
• Lectures on results on Bezout's theorem. Notes by D. P. Patil
• Lower bounds for diophantine approximations
• Multivariate polynomials, duality, and structured matrices
• Numerical decomposition of the solution sets of polynomial systems into irreducible components
• On computing the determinant in small parallel time using a small number of processors
• On the efficiency of effective Nullstellensätze
• On the intrinsic complexity of the arithmetic Nullstellensatz
• On the time-space complexity of geometric elimination procedures
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Sharp estimates for the arithmetic Nullstellensatz
• Some speed-ups and speed limits for real algebraic geometry
• Straight-line programs in geometric elimination theory
• Structured matrices and Newton's iteration: unified approach
• The Distribution of Galois Groups and Hilbert's Irreducibility Theorem
• The fundamental theorem of algebra and complexity theory
• The hardness of polynomial equation solving
• The intrinsic complexity of parametric elimination methods
• Toric Newton method for polynomial homotopies

Cited in

(18)

• Deformation techniques for sparse systems
• Deformation method for investigation of constrained minimization of performance functionals of systems with infinitely many degrees of freedom
• On the bit complexity of polynomial system solving
• Deformation techniques for efficient polynomial equation 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
• Solving determinantal systems using homotopy techniques
• Factorization patterns on nonlinear families of univariate polynomials over a finite field
• Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
• A concise proof of the Kronecker polynomial system solver from scratch
• Deformation Argument under PSP Condition and Applications
• Improved general mapping deformation method for nonlinear partial differential equations in mathematical physics
• scientific article; zbMATH DE number 1005439 (Why is no real title available?)
• Deformation methods for single paraoscillator systems
• Polynomial equation solving by lifting procedures for ramified fibers
• Robust algorithms for generalized Pham systems
• Interpolation by decomposable univariate polynomials
• A Kronecker algorithm for locally closed sets over a perfect field

Describes a project that uses

Uses Software

• Kronecker

This page was built for publication: Deformation techniques to solve generalised Pham systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598226)