✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
We show that the second algorithm is bounded perturbations resilient, and it is strongly convergent.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In order to solve the fixed point of nonexpansive mappings, we propose two iterative algorithms based on runge-kutta method.
📊
Key Findings & Data:The first algorithm is focused on solving the fixed point problem of a single nonexpansive mapping, and weak convergence has been proved. we suggest the second algorithm by dynamic string-averaging rule.
💡
Conclusion & Impact:We show that the second algorithm is bounded perturbations resilient, and it is strongly convergent.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:nonexpansive mapping · common fixed point · runge-kutta method
Abstract
In order to solve the fixed point of nonexpansive mappings, we propose two iterative algorithms based on runge-kutta method. The first algorithm is focused on solving the fixed point problem of a single nonexpansive mapping, and weak convergence has been proved. we suggest the second algorithm by dynamic string-averaging rule. It can be used to find a common fixed point of a family of finite nonexpansive mappings. We show that the second algorithm is bounded perturbations resilient, and it is strongly convergent.
🔖
Cite This Article
Li, X., Zhu, L., Postolache, M. (2023). Algorithm analysis of solving fixed point of nonexpansive mappings based on runge-kutta method. Hacettepe Journal of Mathematics and Statistics, Volume: 52 Issue: 6. https://ajindex.com/articles/1402149