The convex-decomposable operator equation and its monotonic inclusive iteration
From MaRDI portal
Publication:2564992
A monotone inclusive iterative algorithm is proposed for solving nonlinear equations \(F(x)=0\) in a finite ordered interval \(\Omega= \{x\in\mathbb{R}^n \mid a\leq x\leq b\}\). This method is applicable to the class of operator equations with the property \(F(y)-F(x) \leq (D_1(x,y) +D_2 (x,y)) (y-x)\) for \(x\leq y\) in a partially ordered space. Here \(D_1\) and \(D_2\) are istone and anitone, respectively. Three numerical examples are included.
Recommendations
Cites work
Cited in
(5)- scientific article; zbMATH DE number 6493382 (Why is no real title available?)
- scientific article; zbMATH DE number 4172283 (Why is no real title available?)
- scientific article; zbMATH DE number 4080777 (Why is no real title available?)
- scientific article; zbMATH DE number 2015314 (Why is no real title available?)
- scientific article; zbMATH DE number 1417384 (Why is no real title available?)
This page was built for publication: The convex-decomposable operator equation and its monotonic inclusive iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564992)