An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions

DOI10.1137/0910042zbMath0683.65039OpenAlexW2084579782MaRDI QIDQ4733311

No author found.

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1137/0910042

zbMATH Keywords

complexityalgorithmtopological degreeLipschitz functionnumber of function evaluationsworst-case lower bound

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Degree, winding number (55M25)

Related Items (4)

Improved subdivision scheme for the root computation of univariate polynomial equations ⋮ A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\) ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ COMPUTING TWO LINCHPINS OF TOPOLOGICAL DEGREE BY A NOVEL DIFFERENTIAL EVOLUTION ALGORITHM

This page was built for publication: An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions