.png){kind=icon}
返回
K-ITERATED FUNCTION SYSTEM
.png){kind=icon}
PRE
AI
DOI：10.1142/S0218348X10004713.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
K-Iterated Function System
Iterated Function System
Kannan Mapping
Compact Set
Contraction Mapping
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
2.9
论文数:
2.8K
被引数:
5.6K
.png){kind=icon}
