EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Convergence of Picard–CR Iterative Algorithm and Applications

Suheyla Elmas

Journal of Function Spaces · 2026-01 · 2026 (1)

DOI: 10.1155/jofs/3625869 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Function Spaces, online erschienen am 24.05.2026. Verfasst von Suheyla Elmas. Die Arbeit nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In applied mathematics, graph theory (GT) is a notably compelling area of study. In the last 50 years, the number of mathematicians making contributions to research in this field has consistently increased. This rising interest is mainly a result of the significant real‐world applications it offers. It has been utilized in various areas of study such as engineering, physical sciences, genetics, computer science, sociology, operations research, and economics. Grounded in these foundational ideas, we introduce and conduct an in‐depth analysis of the convergence theorems for the Picard–CR iterative sequences applied to G ‐nonexpansive mapping in Banach spaces via a graph. In addition, Picard–CR iterative algorithm′s applications to image deblurring and refining (or denoising) a signal are illustrated.

Zitieren

APA

Elmas, S. (2026). Convergence of Picard–CR Iterative Algorithm and Applications. Journal of Function Spaces, 2026(1). https://doi.org/10.1155/jofs/3625869

Vancouver

Elmas S. Convergence of Picard–CR Iterative Algorithm and Applications. Journal of Function Spaces. 2026;2026(1). doi:10.1155/jofs/3625869

BibTeX
@article{Elmas2026,
  author = {Elmas, Suheyla},
  title = {Convergence of Picard–CR Iterative Algorithm and Applications},
  journal = {Journal of Function Spaces},
  year = {2026},
  volume = {2026},
  number = {1},
  doi = {10.1155/jofs/3625869}
}
Kostenlos starten →