On the complexity of isolating real roots and computing with certainty the topological degree
From MaRDI portal
Publication:700184
DOI10.1006/JCOM.2001.0636zbMATH Open1008.65022OpenAlexW2003860131MaRDI QIDQ700184FDOQ700184
Authors: Bernard Mourrain, Michael N. Vrahatis, Jean-Claude Yakoubsohn 
Publication date: 30 September 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2001.0636
Recommendations
- Topological complexity and real roots of polynomials
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- Topological complexity of a root finding algorithm
- From approximate factorization to root isolation
- An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
algorithmcomplexitytopological degreereal rootsB-SplinesStenger's degree computational methodzero isolation
Complexity and performance of numerical algorithms (65Y20) Numerical computation of solutions to single equations (65H05) Degree, winding number (55M25)
Cites Work
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions
- Rigorous global search: continuous problems
- ZEBEC: A mathematical software package for computing simple zeros of Bessel functions of real order and complex argument
- A Short Proof and a Generalization of Miranda's Existence Theorem
- Title not available (Why is that?)
- Computing the topological degree of a mapping in \(R^n\)
- The Poincare-Miranda Theorem
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounding the Solution of Interval Linear Equations
- Title not available (Why is that?)
- The dimension of bivariate spline spaces of smoothness r for degree \(d\geq 4r+1\)
- Locating and Computing All the Simple Roots and Extrema of a Function
- Title not available (Why is that?)
- Structure and Breakdown of Invariant Tori in a 4-D Mapping Model of Accelerator Dynamics
- PERIODIC ORBITS AND INVARIANT SURFACES OF 4D NONLINEAR MAPPINGS
- Optimal solution of nonlinear equations
- Some tests of generalized bisection
- On the construction of sufficient refinements for computation of topological degree
- Bisection is optimal
- An efficient degree-computation method for a generalized method of bisection
- A simplification of Stenger's topological degree formula
- An algorithm for numerical calculation of topological degree
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- An efficient method for locating and computing periodic orbits of nonlinear mappings
- An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
- Application of the characteristic bisection method for locating and computing periodic orbits in molecular systems
- A bisection method for systems of nonlinear equations
- A rapid generalized method of bisection for solving systems of non-linear equations
- On the calculation of the exact number of zeroes of a set of equations
- On the determination of the number and multiplicity of zeros of a function
- Computing the topological degree with noisy information
- Deflation techniques for the calculation of further solutions of a nonlinear system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
- Interval Slopes for Rational Functions and Associated Centered Forms
- The determination of the location of the global maximum of a function in the presence of several local extrema
- Title not available (Why is that?)
- Solving systems of nonlinear equations using the nonzero value of the topological degree
- Title not available (Why is that?)
- The Calculation of the Topological Degree by Quadrature
- A two-dimensional analogue to the method of bisections for solving nonlinear equations
- A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
- Computation of Topological Degree Using Interval Arithmetic, and Applications
- The topological degree theory for the localization and computation of complex zeros of bessel functions
- On the Localization and Computation of Zeros of Bessel Functions
- Locating and Computing Zeros of Airy Functions
- Locating and Computing Arbitrarily Distributed Zeros
- Title not available (Why is that?)
- Locating and computing in parallel all the simple roots of special functions using PVM
- Asymptotic near optimality of the bisection method
Cited In (22)
- Topological complexity and real roots of polynomials
- Subdivision methods for solving polynomial equations
- Survey on generalizations of the intermediate value theorem and applications
- Robust feasibility of systems of quadratic equations using topological degree theory
- Continuous amortization and extensions: with applications to bisection-based root isolation
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Topology and arrangement computation of semi-algebraic planar curves
- Topological degree theory and local analysis of area preserving maps
- Determining the number of real roots of polynomials through neural networks
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- On perturbation of roots of homogeneous algebraic systems
- Certified numerical real root isolation for bivariate nonlinear systems
- Real algebraic numbers and polynomial systems of small degree
- On the computation of an arrangement of quadrics in 3D
- COMPUTING TWO LINCHPINS OF TOPOLOGICAL DEGREE BY A NOVEL DIFFERENTIAL EVOLUTION ALGORITHM
- A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
- Existence and computation of short-run equilibria in economic geography
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- Univariate real root isolation in an extension field and applications
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
- Locating and Computing All the Simple Roots and Extrema of a Function
Uses Software
This page was built for publication: On the complexity of isolating real roots and computing with certainty the topological degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700184)
