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

DOI10.1007/BF00122427zbMATH Open0759.65020MaRDI QIDQ1201902FDOQ1201902

Authors: S. Singh 

Publication date: 17 January 1993

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

Recommendations

• Numerically determining solutions of systems of polynomial equations
• scientific article
• scientific article; zbMATH DE number 710644
• Homotopy continuation method for solving systems of nonlinear and polynomial equations
• scientific article; zbMATH DE number 778129

zbMATH Keywords

systems of nonlinear equationsNielsen fixed point theoryhomotopy methodssystems of polynomial equationszeros of a polynomialsimplicial algorithmsKuhn's methodpivoting 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) Real polynomials: location of zeros (26C10)

Cites Work

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

Cited In (5)

• Simplicial algorithms on the simplotope
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• PITCON
• praxis

This page was built for publication: Some computational methods for systems of nonlinear equations and systems of polynomial equations

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