Abstract
Based on a principle of successively minimizing the ball containing the solution set, a new ball algorithm is developed for solving the fixed point equation x = Tx, with T a contractive operator. It is shown that this algorithm is optimal in computational efficiency among all known ball methods for the given problem. Numerical examples are provided to support the conclusion.
| Original language | English |
|---|---|
| Pages (from-to) | 183-195 |
| Number of pages | 13 |
| Journal | International Journal of Computer Mathematics |
| Volume | 50 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - 1 Jan 1994 |
Keywords
- Dahlquist constant
- Geometric estimator
- KEY WORDS Ball iteration
- Region contraction algorithm
Fingerprint
Dive into the research topics of 'An optimal ball algorithm for fixed point equations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver