On the Rate of Convergence of P-Iteration, SP-Iteration, and D-Iteration Methods for Continuous Nondecreasing Functions on Closed Intervals
© 2018 Jukkrit Daengsaen and Anchalee Khemphet. We introduce a new iterative method called D-iteration to approximate a fixed point of continuous nondecreasing functions on arbitrary closed intervals. The purpose is to improve the rate of convergence compared to previous work. Specifically, our main...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85050179926&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/58829 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 2018 Jukkrit Daengsaen and Anchalee Khemphet. We introduce a new iterative method called D-iteration to approximate a fixed point of continuous nondecreasing functions on arbitrary closed intervals. The purpose is to improve the rate of convergence compared to previous work. Specifically, our main result shows that D-iteration converges faster than P-iteration and SP-iteration to the fixed point. Consequently, we have that D-iteration converges faster than the others under the same computational cost. Moreover, the analogue of their convergence theorem holds for D-iteration. |
|---|