Abstract
A new ball algorithm for bounding a zero point of a nonlinear quasi-strongly monotone operator in Hilbert spaces is presented. It is shown that the algorithm converges much more rapidly than the existing ball algorithms for the given problems. Numerical comparisons are made to support the conclusion.
| Original language | English |
|---|---|
| Pages (from-to) | 83-96 |
| Number of pages | 14 |
| Journal | International Journal of Computer Mathematics |
| Volume | 57 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 1 Jan 1995 |
Keywords
- Ball algorithm
- geometric estimator
- gib Lipschitz constant
- nonlinear quasi-strongly monotone operator
- region contraction algorithm
Fingerprint
Dive into the research topics of 'The optimal ball algorithm for nonlinear equations of quasi-strongly monotone operators'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver