✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
We show that the second algorithm is bounded perturbations resilient, and it is strongly convergent.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In order to solve the fixed point of nonexpansive mappings, we propose two iterative algorithms based on runge-kutta method.
📊
Temel Bulgular & Veri: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.
💡
Sonuç & Katkı:We show that the second algorithm is bounded perturbations resilient, and it is strongly convergent.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler: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.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
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