An efficient degree-computation method for a generalized method of bisection
From MaRDI portal
Cites work
- A search routine for a Sperner simplex
- Computing the Brouwer Degree in R 2
- Computing the topological degree of a mapping in \(R^n\)
- scientific article; zbMATH DE number 3438078 (Why is no real title available?)
- scientific article; zbMATH DE number 3272188 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3423524 (Why is no real title available?)
- scientific article; zbMATH DE number 3191561 (Why is no real title available?)
- The Approximation of Fixed Points of a Continuous Mapping
- The Calculation of the Topological Degree by Quadrature
Cited in
(29)- Optimal solution of nonlinear equations
- Computing the topological degree with noisy information
- Experiments with new stochastic global optimization search techniques
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- Numerical methods for static and periodic bifurcation problems
- O-epi families of mappings, topological degree and optimization
- OPTAC: A portable software package for analyzing and comparing optimization methods by visualization
- Quasi-decidability of a fragment of the first-order theory of real numbers
- Survey on generalizations of the intermediate value theorem and applications
- 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}\)
- Solving systems of nonlinear equations In using a rotating hyperplane in
- A dimension-reducing method for solving systems of nonlinear equations in
- Computation of Topological Degree Using Interval Arithmetic, and Applications
- The topological degree theory for the localization and computation of complex zeros of bessel functions
- Computing the topological degree of polynomial maps
- Existence verification for singular and nonsmooth zeros of real nonlinear systems
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
- Effective topological degree computation based on interval arithmetic
- On perturbation of roots of homogeneous algebraic systems
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- Application of the characteristic bisection method for locating and computing periodic orbits in molecular systems
- An algorithm for finding all solutions of a nonlinear system
- Algorithmic differentiation and hull-consistency enforcing using C++ template meta-programming
- Verifying topological indices for higher-order rank deficiencies
- On the complexity of isolating real roots and computing with certainty the topological degree
- On degeneration of tetrahedra under longest-edge n-section refinement
- Computing topological degree using noisy information
- Existence and computation of short-run equilibria in economic geography
This page was built for publication: An efficient degree-computation method for a generalized method of bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249835)
