A bisection method for systems of nonlinear equations
ACM Transactions on Mathematical Software (TOMS)
Computer algebra: symbolic and algebraic computation (2nd ed.)
Complexity of computing topological degree of Lipschitz functions in n dimensions
Journal of Complexity
A rapid generalized method of bisection for solving systems of non-linear equations
Numerische Mathematik
Some tests of generalized bisection
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
An optimal complexity algorithm for computing the topological degree in two dimensions
SIAM Journal on Scientific and Statistical Computing
Algorithm 681: INTBIS, a portable interval Newton/bisection package
ACM Transactions on Mathematical Software (TOMS)
Curves and surfaces for computer aided geometric design
Curves and surfaces for computer aided geometric design
Computation of topological degree using interval arithmetic, and applications
Mathematics of Computation
An efficient method for locating and computing periodic orbits of nonlinear mappings
Journal of Computational Physics
Solving systems of nonlinear equations using the nonzero value of the topological degree
ACM Transactions on Mathematical Software (TOMS)
Locating and Computing All the Simple Roots and Extrema of a Function
SIAM Journal on Scientific Computing
Computing the topological degree with noisy information
Journal of Complexity
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Locating and Computing Arbitrarily Distributed Zeros
SIAM Journal on Scientific Computing
Optimal solution of nonlinear equations
Optimal solution of nonlinear equations
Locating and computing in parallel all the simple roots of special functions using PVM
Journal of Computational and Applied Mathematics - Special issue on orthogonal polynomials, special functions and their applications
Existence Verification for Singular Zeros of Complex Nonlinear Systems
SIAM Journal on Numerical Analysis
An algorithm for the numerical calculation of the degree of a mapping.
An algorithm for the numerical calculation of the degree of a mapping.
Computing the degree of maps and a generalized method of bisection.
Computing the degree of maps and a generalized method of bisection.
On the computation of an arrangement of quadrics in 3D
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
Mathematics and Computers in Simulation
On the computation of the topology of a non-reduced implicit space curve
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
Topology and arrangement computation of semi-algebraic planar curves
Computer Aided Geometric Design
Real algebraic numbers and polynomial systems of small degree
Theoretical Computer Science
Subdivision methods for solving polynomial equations
Journal of Symbolic Computation
Experimental evaluation and cross-benchmarking of univariate real solvers
Proceedings of the 2009 conference on Symbolic numeric computation
On the computation of an arrangement of quadrics in 3D
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Determining the number of real roots of polynomials through neural networks
Computers & Mathematics with Applications
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Univariate real root isolation in an extension field
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A descartes algorithm for polynomials with bit-stream coefficients
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Real solving of bivariate polynomial systems
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
The diamond operator: implementation of exact real algebraic numbers
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
A root isolation algorithm for sparse univariate polynomials
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
In this contribution the isolation of real roots and the computation of the topological degree in two dimensions are considered and their complexity is analyzed. In particular, we apply Stenger's degree computational method by splitting properly the boundary of the given region to obtain a sequence of subintervals along the boundary that forms a sufficient refinement. To this end, we properly approximate the function using univariate polynomials. Then we isolate each one of the zeros of these polynomials on the boundary of the given region in various subintervals so that these subintervals form a sufficiently refined boundary.