Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions

DOI10.1007/978-3-030-40616-5_17OpenAlexW3006601077MaRDI QIDQ5122292FDOQ5122292

Publication date: 22 September 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_17

Recommendations

Approximating fixed points for continuous functions on an arbitrary interval
scientific article; zbMATH DE number 3853993
scientific article
Publication:4733108
Continuous approximations of multivalued mappings and fixed points
scientific article; zbMATH DE number 4067849
Fixed and approximate fixed point theorems
Generalizations of fixed point theorems and computation
Approximation results and fixed points

nonlinear equations Bolzano theorem existence theorems fixed points bisection methods intermediate value theorems Bolzano-Poincaré-Miranda theorem

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions
Algorithm 987: MANBIS -- a C++ mathematical software package for locating and computing efficiently many roots of a function: theoretical issues
A Short Proof and a Generalization of Miranda's Existence Theorem
Computing the topological degree of a mapping in \(R^n\)
On the existence theorems of Kantorovich, Miranda and Borsuk
Generalization of the Bolzano theorem for simplices
Title not available (Why is that?)
Iterative Solution of Nonlinear Equations in Several Variables
The Approximation of Fixed Points of a Continuous Mapping
On the complexity of isolating real roots and computing with certainty the topological degree
A Proof of Convergence and an Error Bound for the Method of Bisection in R n
A new unconstrained optimization method for imprecise function and gradient values
Bisection is optimal
An efficient degree-computation method for a generalized method of bisection
An efficient method for locating and computing periodic orbits of nonlinear mappings
Title not available (Why is that?)
Efficiently Computing Many Roots of a Function
A rapid generalized method of bisection for solving systems of non-linear equations
Optimal solution of nonlinear equations
Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
Title not available (Why is that?)
Solving systems of nonlinear equations using the nonzero value of the topological degree
Locating and Computing Arbitrarily Distributed Zeros
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (1)

Survey on generalizations of the intermediate value theorem and applications

Uses Software

CHABIS
RFSFNS

This page was built for publication: Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5122292)