Locating and Computing Arbitrarily Distributed Zeros

DOI10.1137/S1064827598333806zbMath0967.65060MaRDI QIDQ4702420

Frosso S. Makri, Dimitris J. Kavvadias, Michael N. Vrahatis

Publication date: 24 November 1999

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmconvergencenumerical examplessubdivisiontopological degreecomputing simple rootsKronecker-Picard theorybisection methodnumber of iterationsdistribution of the rootsexpected complexity of algorithmslocating simple rootszeros identificationszeros isolation

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions ⋮ Topological degree theory and local analysis of area preserving maps ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves ⋮ Stress update algorithm for elastoplastic models with nonconvex yield surfaces ⋮ Non-convexity and stress-path dependency of unsaturated soil models

Uses Software

• INTOPT_90

This page was built for publication: Locating and Computing Arbitrarily Distributed Zeros