Skip to content
Free planNo credit card requiredStart writing

article · Fractals · 2010

K-ITERATED FUNCTION SYSTEM

Daya Ram Sahu, Anindita Chakraborty, R.P. Dubey

Cited by 45Abstract and details only

Abstract

In 1969, Kannan1 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.

Cite this paper

APA 7

Sahu, D. R., Chakraborty, A., & Dubey, R. (2010). K-ITERATED FUNCTION SYSTEM. Fractals, 18(01), 139–144. https://doi.org/10.1142/s0218348x10004713

MLA 9

Sahu, Daya Ram, et al. “K-ITERATED FUNCTION SYSTEM.” Fractals, vol. 18, no. 01, 2010, pp. 139–44, https://doi.org/10.1142/s0218348x10004713.

Chicago

Sahu, Daya Ram, Anindita Chakraborty, and R.P. Dubey. 2010. “K-ITERATED FUNCTION SYSTEM.” Fractals 18 (01): 139–44. https://doi.org/10.1142/s0218348x10004713.

Harvard

Sahu, D.R., Chakraborty, A. and Dubey, R. (2010) ‘K-ITERATED FUNCTION SYSTEM’, Fractals, 18(01), pp. 139–144. Available at: https://doi.org/10.1142/s0218348x10004713.

BibTeX
@article{sahu2010iterated,
  title = {{K-ITERATED FUNCTION SYSTEM}},
  author = {Sahu, Daya Ram and Chakraborty, Anindita and Dubey, R.P.},
  journal = {Fractals},
  volume = {18},
  number = {01},
  pages = {139--144},
  year = {2010},
  doi = {10.1142/s0218348x10004713}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.