On the complexity of isolating real roots and computing with certainty the topological degree
From MaRDI portal
(Redirected from Publication:700184)
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
Cites work
- scientific article; zbMATH DE number 3118042 (Why is no real title available?)
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- scientific article; zbMATH DE number 4139201 (Why is no real title available?)
- scientific article; zbMATH DE number 4060637 (Why is no real title available?)
- scientific article; zbMATH DE number 47178 (Why is no real title available?)
- scientific article; zbMATH DE number 49605 (Why is no real title available?)
- scientific article; zbMATH DE number 3572747 (Why is no real title available?)
- scientific article; zbMATH DE number 735289 (Why is no real title available?)
- scientific article; zbMATH DE number 804609 (Why is no real title available?)
- scientific article; zbMATH DE number 804611 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3191561 (Why is no real title available?)
- A Short Proof and a Generalization of Miranda's Existence Theorem
- A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
- A bisection method for systems of nonlinear equations
- A rapid generalized method of bisection for solving systems of non-linear equations
- A simplification of Stenger's topological degree formula
- A two-dimensional analogue to the method of bisections for solving nonlinear equations
- Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
- An algorithm for numerical calculation of topological degree
- An efficient degree-computation method for a generalized method of bisection
- An efficient method for locating and computing periodic orbits of nonlinear mappings
- Application of the characteristic bisection method for locating and computing periodic orbits in molecular systems
- Asymptotic near optimality of the bisection method
- Bisection is optimal
- Bounding the Solution of Interval Linear Equations
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- Computation of Topological Degree Using Interval Arithmetic, and Applications
- Computing the topological degree of a mapping in \(R^n\)
- Computing the topological degree with noisy information
- Deflation techniques for the calculation of further solutions of a nonlinear system
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Interval Slopes for Rational Functions and Associated Centered Forms
- Locating and Computing All the Simple Roots and Extrema of a Function
- Locating and Computing Arbitrarily Distributed Zeros
- Locating and Computing Zeros of Airy Functions
- Locating and computing in parallel all the simple roots of special functions using PVM
- On the Localization and Computation of Zeros of Bessel Functions
- On the calculation of the exact number of zeroes of a set of equations
- On the construction of sufficient refinements for computation of topological degree
- On the determination of the number and multiplicity of zeros of a function
- Optimal solution of nonlinear equations
- PERIODIC ORBITS AND INVARIANT SURFACES OF 4D NONLINEAR MAPPINGS
- RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions
- Rigorous global search: continuous problems
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Solving systems of nonlinear equations using the nonzero value of the topological degree
- Some tests of generalized bisection
- Structure and Breakdown of Invariant Tori in a 4-D Mapping Model of Accelerator Dynamics
- The Calculation of the Topological Degree by Quadrature
- The Poincare-Miranda Theorem
- The determination of the location of the global maximum of a function in the presence of several local extrema
- The dimension of bivariate spline spaces of smoothness r for degree \(d\geq 4r+1\)
- The topological degree theory for the localization and computation of complex zeros of bessel functions
- ZEBEC: A mathematical software package for computing simple zeros of Bessel functions of real order and complex argument
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
- Topology and arrangement computation of semi-algebraic planar curves
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- 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
- Certified numerical real root isolation for bivariate nonlinear systems
- On perturbation of roots of homogeneous algebraic 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
- Existence and computation of short-run equilibria in economic geography
- A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
- Univariate real root isolation in an extension field and applications
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- 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
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)
