New algorithms for the approximation of fixed points and fractal functions
Resumen: This article is devoted to explore the abilities of an iterative scheme for the approximation of fixed points of self-maps, called the N-algorithm, defined in a previous paper. In a first part of the article, the algorithm is modified in order to consider operators with asymptotic properties, namely nearly uniform contractions and nearly asymptotically nonexpansive mappings. Sufficient conditions on the (normed or quasi-normed) underlying space and the operator are given in order to ensure weak or strong convergence of the new algorithm to a fixed point.
Afterwards, the definition of fractal functions as fixed points of the Read-Bajraktarević operator is considered, giving very general conditions for their existence when the operator is nonexpansive. This is done in the framework of the Hilbert space, where is a real compact interval. The capacity of the N-algorithm for the approximation of these fractal functions is proved as well. In the last part of the paper, the fractal convolution of operators on
is studied. The text explores the properties of the convolution when its components satisfy determined conditions, closely related to the existence of fixed points.

Idioma: Inglés
DOI: 10.1016/j.chaos.2024.115883
Año: 2025
Publicado en: Chaos, Solitons and Fractals 191 (2025), 115883 [8 pp.]
ISSN: 0960-0779

Tipo y forma: Article (Published version)

Rights Reserved All rights reserved by journal editor


Exportado de SIDERAL (2025-10-17-14:34:37)


Visitas y descargas

Este artículo se encuentra en las siguientes colecciones:
Articles



 Record created 2025-02-10, last modified 2025-10-17


Versión publicada:
 PDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)