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

DOI10.1007/978-3-030-40616-5_17MaRDI QIDQ5122292OpenAlexFDO

Authors Michael N. Vrahatis

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

zbMATH Keywords

nonlinear equationsBolzano theoremexistence theoremsfixed pointsbisection methodsintermediate value theoremsBolzano-Poincaré-Miranda theorem

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Recommendations

• Approximating fixed points for continuous functions on an arbitrary interval
• scientific article; zbMATH DE number 3853993
• scientific article; zbMATH DE number 5289500
• 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

Cites work

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

Cited in

(1)

• Survey on generalizations of the intermediate value theorem and applications

Describes a project that uses

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)