.png){kind=icon}
Return
K-ITERATED FUNCTION SYSTEM
.png){kind=icon}
PRE
AI
DOI：10.1142/S0218348X10004713.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In 1969, Kannan(1) gave the definition of a new mapping which had presented a condition which is more lenient than contraction condition. The purpose of this note is to introduce K-Iterated Function System using Kannan mapping which will cover a larger range of mappings. We also prove the Collage theorem for the K-Iterated Function System.
Keywords:
K-Iterated Function System
Iterated Function System
Kannan Mapping
Compact Set
Contraction Mapping
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
2.9
Papers:
2.8K
Citations:
5.6K
Organization
.png){kind=icon}
