Improving the efficiency of exclusion algorithms

DOI10.1515/ADVG.2001.013MaRDI QIDQ2726409zbMATH OpenOpenAlexFDO

Authors Kurt Georg

Publication date 17 July 2001

Published in Advances in Geometry (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121723, https://semanticscholar.org/paper/c512375508f6b9039b9a343f4a935e8df4301448

zbMATH Keywords

exclusion algorithmhomotopy methodinterval analysisnumerical examplessystem of nonlinear equations

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) General methods in interval analysis (65G40) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Review text

The author investigates exclusion algorithms as a tool in the area of interval analysis, for finding all solutions of a system of nonlinear equations. The homotopy and exclusion methods may be combined. Here an exclusion algorithm is used as a module to be investigated real components of a suitably reduced subproblem. One of the main results is a statement that summarizes the possible choices of exclusion tests, which are introduced here. It is shown as well that even degenerate zero points do not excessively increase the number of intervals generated by the algorithm, provided that a sufficiently tight test is used. A number of numerical examples is given to illustrate the statements.

Recommendations

• Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
• A new exclusion test.
• On the complexity of exclusion algorithms for optimization
• scientific article; zbMATH DE number 3990753
• Exclusion Regions for Systems of Equations

Cites work

• Algorithm 795
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• Numerical decomposition of the solution sets of polynomial systems into irreducible components
• Rigorous global search: continuous problems

Cited in

(12)

• An improvement of the inclusion-exclusion principle
• A new exclusion test.
• Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
• Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
• AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
• scientific article; zbMATH DE number 3990753 (Why is no real title available?)
• Exclusion Regions for Systems of Equations
• Knowledge Discovery in Inductive Databases
• Khovanskii-Rolle continuation for real solutions
• On the complexity of exclusion algorithms for optimization
• Solution of polynomial systems derived from differential equations
• A new exclusion test for finding the global minimum

Describes a project that uses

Uses Software

• INTOPT_90
• PHCpack

This page was built for publication: Improving the efficiency of exclusion algorithms

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