English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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.

On the Rate of Convergence of P-Iteration, SP-Iteration, and D-Iteration Methods for Continuous Nondecreasing Functions on Closed Intervals