AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS

DOI10.1017/S0004972708000117zbMath1175.65057OpenAlexW1973829059MaRDI QIDQ3533767

Ibraheem Alolyan

Publication date: 24 October 2008

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972708000117

zbMATH Keywords

computational complexitynumerical exampleglobal convergencesystem of nonlinear equationsexclusion algorithmroot conditiondecomposable functions

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20)

Related Items

On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods

Uses Software

• PITCON
• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Globally convergent homotopy methods: A tutorial
• On the complexity of exclusion algorithms for optimization
• A new exclusion test for finding the global minimum
• A rapid generalized method of bisection for solving systems of non-linear equations
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
• Improving the efficiency of exclusion algorithms
• Solving systems of nonlinear equations using the nonzero value of the topological degree
• Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Note on the end game in homotopy zero curve tracking
• Finding all isolated solutions to polynomial systems using HOMPACK
• Introduction to Numerical Continuation Methods