AbstractThe bisection method provides an affirmative answer for scalar functions. We show that the answer is negative for bivariate functions. This means, in particular, that an arbitrary continuation method cannot approximate a zero of every smooth bivariate function with nonzero topological degree
AbstractThe topological complexity of algorithms is studied in a general context in the first part a...
Linear adaptive information for approximating a zero of f is studied where f belongs to the class of...
AbstractThis paper addresses the problem of computing topological degree of Lipschitz functions with...
The bisection method provides an affirmative answer for scalar functions. We show that the answer is...
AbstractThe bisection method provides an affirmative answer for scalar functions. We show that the a...
An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical predi...
An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical predi...
An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical predi...
AbstractHow many tests does one have to perform in order to compute an ε-approximation of a zero of ...
Journal ArticleThe bisection method is shown to possess the nearly best rate of convergence for infi...
AbstractThe topological complexity of zero-finding is studied using a BSS machine over the reals wit...
AbstractThe topological complexity of algorithms is studied in a general context in the first part a...
AbstractThe invariance of the topological degree under certain homotopies is used to computationally...
AbstractFor which error criteria can we solve a nonlinear scalar equation f (x) = 0, where f is a re...
AbstractWe survey recent average-case results (and prove a new one) for the solution of nonlinear eq...
AbstractThe topological complexity of algorithms is studied in a general context in the first part a...
Linear adaptive information for approximating a zero of f is studied where f belongs to the class of...
AbstractThis paper addresses the problem of computing topological degree of Lipschitz functions with...
The bisection method provides an affirmative answer for scalar functions. We show that the answer is...
AbstractThe bisection method provides an affirmative answer for scalar functions. We show that the a...
An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical predi...
An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical predi...
An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical predi...
AbstractHow many tests does one have to perform in order to compute an ε-approximation of a zero of ...
Journal ArticleThe bisection method is shown to possess the nearly best rate of convergence for infi...
AbstractThe topological complexity of zero-finding is studied using a BSS machine over the reals wit...
AbstractThe topological complexity of algorithms is studied in a general context in the first part a...
AbstractThe invariance of the topological degree under certain homotopies is used to computationally...
AbstractFor which error criteria can we solve a nonlinear scalar equation f (x) = 0, where f is a re...
AbstractWe survey recent average-case results (and prove a new one) for the solution of nonlinear eq...
AbstractThe topological complexity of algorithms is studied in a general context in the first part a...
Linear adaptive information for approximating a zero of f is studied where f belongs to the class of...
AbstractThis paper addresses the problem of computing topological degree of Lipschitz functions with...
DOI
Add to ORKG