An efficient degree-computation method for a generalized method of bisection
From MaRDI portal
Publication:1249835
DOI10.1007/BF01404868zbMath0386.65016MaRDI QIDQ1249835
Publication date: 1979
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132598
Related Items (28)
Optimal solution of nonlinear equations ⋮ Existence verification for singular and nonsmooth zeros of real nonlinear systems ⋮ Computing the topological degree with noisy information ⋮ Existence and computation of short-run equilibria in economic geography ⋮ A dimension-reducing method for solving systems of nonlinear equations in ⋮ Solving systems of nonlinear equations In using a rotating hyperplane in ⋮ OPTAC: A portable software package for analyzing and comparing optimization methods by visualization ⋮ Algorithmic differentiation and hull-consistency enforcing using C++ template meta-programming ⋮ Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions ⋮ The topological degree theory for the localization and computation of complex zeros of bessel functions ⋮ Improved subdivision scheme for the root computation of univariate polynomial equations ⋮ Computing the topological degree of polynomial maps ⋮ Computation of Topological Degree Using Interval Arithmetic, and Applications ⋮ A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\) ⋮ Verifying topological indices for higher-order rank deficiencies ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ Effective topological degree computation based on interval arithmetic ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers ⋮ Application of the characteristic bisection method for locating and computing periodic orbits in molecular systems ⋮ Complexity of computing topological degree of Lipschitz functions in n dimensions ⋮ An algorithm for finding all solutions of a nonlinear system ⋮ On perturbation of roots of homogeneous algebraic systems ⋮ Computing topological degree using noisy information ⋮ Experiments with new stochastic global optimization search techniques ⋮ O-epi families of mappings, topological degree and optimization ⋮ Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization ⋮ Survey on generalizations of the intermediate value theorem and applications ⋮ Numerical methods for static and periodic bifurcation problems
Cites Work
- Computing the topological degree of a mapping in \(R^n\)
- A search routine for a Sperner simplex
- The Calculation of the Topological Degree by Quadrature
- Computing the Brouwer Degree in R 2
- The Approximation of Fixed Points of a Continuous Mapping
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient degree-computation method for a generalized method of bisection
