On order-interval methods for bounding zeros of order convex operators
DOI10.1016/0096-3003(89)90046-5zbMath0678.65037OpenAlexW2019032288MaRDI QIDQ1124282
Publication date: 1989
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(89)90046-5
upper boundsinterval arithmeticBanach spacelower boundsregular conenonlinear algebraic equationsMonotone convergencebounds of zerosorder convex operatororder-interval methods
Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Monotone and positive operators on ordered Banach spaces or other ordered topological vector spaces (47H07)
Cites Work
- Some algorithms for the solution of a class of nonlinear algebraic equations
- On the monotone convergence of Newton's method
- On the convergence of some methods for determining zeros of order-convex operators
- Zur Konvergenz des Verfahrens der tangierenden Hyperbeln und des Tschebyscheff-Verfahrens bei konvexen Abbildungen
- Eingrenzung von Lösungen mit Hilfe der Regula falsi. (Inclusion of solutions by regula falsi)
- Eingrenzung von Lösungen nichtlinearer Gleichungen durch Verfahren mit höherer Konvergenzgeschwindigkeit. (Inclusion of solutions of nonlinear equations by methods with higher convergence rate).
- Newton’s Method for Convex Operators in Partially Ordered Spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On order-interval methods for bounding zeros of order convex operators
