Effective topological degree computation based on interval arithmetic
From MaRDI portal
Abstract: We describe a new algorithm for calculating the topological degree deg (f, B, 0) where B subseteq Rn is a product of closed real intervals and f : B
ightarrow Rn is a real-valued continuous function given in the form of arithmetical expressions. The algorithm cleanly separates numerical from combinatorial computation. Based on this, the numerical part provably computes only the information that is strictly necessary for the following combinatorial part, and the combinatorial part may optimize its computation based on the numerical information computed before. We also present computational experiments based on an implementation of the algorithm. Also, in contrast to previous work, the algorithm does not assume knowledge of a Lipschitz constant of the function f, and works for arbitrary continuous functions for which some notion of interval arithmetic can be defined.
Recommendations
- Computation of Topological Degree Using Interval Arithmetic, and Applications
- scientific article; zbMATH DE number 4024108
- scientific article; zbMATH DE number 5171242
- Computation for topological degree and its applications
- A computational theorem of topological degree and applications
- An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
- scientific article; zbMATH DE number 3988625
- Computing the topological degrees via semi-concave functionals
- scientific article; zbMATH DE number 4126143
- scientific article; zbMATH DE number 1163119
Cites work
- A Comparison of the Existence Theorems of Kantorovich and Moore
- A comparison of the Moore and Miranda existence tests
- A framework for existence tests based on the topological degree and homotopy
- A set of axioms for the degree of a tangent vector field on differentiable manifolds
- A simplification of Stenger's topological degree formula
- An efficient degree-computation method for a generalized method of bisection
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- Computability and representations of the zero set
- Computation of Topological Degree Using Interval Arithmetic, and Applications
- Computing the Brouwer Degree in R 2
- Computing the topological degree of a mapping in \(R^n\)
- Differential Topology
- Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
- Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
- Existence verification for singular and nonsmooth zeros of real nonlinear systems
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- scientific article; zbMATH DE number 1694899 (Why is no real title available?)
- scientific article; zbMATH DE number 3643714 (Why is no real title available?)
- scientific article; zbMATH DE number 5114888 (Why is no real title available?)
- scientific article; zbMATH DE number 977420 (Why is no real title available?)
- scientific article; zbMATH DE number 1024113 (Why is no real title available?)
- scientific article; zbMATH DE number 1950480 (Why is no real title available?)
- scientific article; zbMATH DE number 2050348 (Why is no real title available?)
- scientific article; zbMATH DE number 772846 (Why is no real title available?)
- scientific article; zbMATH DE number 776267 (Why is no real title available?)
- scientific article; zbMATH DE number 3191561 (Why is no real title available?)
- scientific article; zbMATH DE number 3038388 (Why is no real title available?)
- Interval Methods for Systems of Equations
- Introduction to Interval Analysis
- Partial differential equations 1. Foundations and integral representations. With consideration of lectures by E. Heinz
- Quasi-decidability of a fragment of the first-order theory of real numbers
- The Calculation of the Topological Degree by Quadrature
- Topological degree theory and applications.
- Verification methods: rigorous results using floating-point arithmetic
Cited in
(22)- A framework for existence tests based on the topological degree and homotopy
- Computing the topological degree with noisy information
- Solving equations and optimization problems with uncertainty
- Zur numerischen Bestimmung des Abbildungsgrades im \(R^ n\). II
- Quasi-decidability of a fragment of the first-order theory of real numbers
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- Numerical calculation of the index of a function
- scientific article; zbMATH DE number 3880012 (Why is no real title available?)
- COMPUTING TWO LINCHPINS OF TOPOLOGICAL DEGREE BY A NOVEL DIFFERENTIAL EVOLUTION ALGORITHM
- Computation of Topological Degree Using Interval Arithmetic, and Applications
- A Unified Constructive Approach to the Topological Degree in Rn
- An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
- Estimates of the topological degree of a class of piecewise linear maps with applications
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- Algorithmic differentiation and hull-consistency enforcing using C++ template meta-programming
- Robust feasibility of systems of quadratic equations using topological degree theory
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test
- Estimating the coverage measure and the area explored by a line-sweep sensor on the plane
- Topological analysis of the complex SSH model using the quantum geometric tensor
- Satisfiability of non-linear transcendental arithmetic as a certificate search problem
- Computing topological degree using noisy information
- Proving the existence of zeros using the topological degree and interval arithmetic
This page was built for publication: Effective topological degree computation based on interval arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179223)
