Some computational methods for systems of nonlinear equations and systems of polynomial equations

DOI10.1007/BF00122427zbMath0759.65020MaRDI QIDQ1201902

S. Singh

Publication date: 17 January 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

systems of polynomial equations; zeros of a polynomial; systems of nonlinear equations; homotopy methods; Nielsen fixed point theory; simplicial algorithms; Kuhn's method; pivoting algorithms

Mathematics Subject Classification ID

DB lookup for MSC labels failed

Uses Software

• PITCON
• praxis

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A course in triangulations for solving equations with deformations
• Cayley's problem and Julia sets
• Homotopy algorithm for symmetric eigenvalue problems
• Minimal triangulation of the 4-cube
• A note on minimal triangulations of an n-cube
• Sandwich method for finding fixed points
• The computation of fixed points and applications
• Triangulations for the cube
• A convergent process of price adjustment and global Newton methods
• Topologic proofs of some combinatorial theorems
• A search routine for a Sperner simplex
• Unknotting combinatorial balls
• A generalization of Tucker's combinatorial lemma with topological applications
• A generalization of Brouwer's fixed point theorem
• On the cost of computing roots of polynomials
• Computation of all solutions to a system of polynomial equations
• On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
• On the cost of approximating all roots of a complex polynomial
• On the efficiency of algorithms of analysis
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
• Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
• The Homotopy Continuation Method: Numerically Implementable Topological Procedures
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• On the Least Number of Fixed Points
• The fundamental theorem of algebra and complexity theory
• The octahedral algorithm, a new simplicial fixed point algorithm
• Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• Nielsen Numbers of Maps of Tori
• Constructive proofs of theorems relating to:F(x) = y, with applications
• On Paths Generated by Fixed Point Algorithms
• A modification of todd's triangulationJ 3
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Determining All Solutions to Certain Systems of Nonlinear Equations
• Finding all solutions to polynomial systems and other systems of equations
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• The Approximation of Fixed Points of a Continuous Mapping
• An intuitionist correction of the fixed-point theorem on the sphere