Distributed Cooperative Algorithm for k-M Set with Negative Integer k by Fractal Symmetrical Property

Gelan Yang and Shuai Liu

International Journal of Distributed Sensor Networks, 2014, vol. 10, issue 5, 398583

Abstract: In recent years, fractal is widely used everywhere and escape time algorithm (ETA) became the most useful fractal creating method. However, ETA performs not so well because it needs huge computations. So, in this paper, we first present an improved fractal creating algorithm by symmetrical radius of k - M set. Meanwhile, we use distributed cooperative method to improve classic ETA into parallel system, which is called distributed cooperative ETA (DCETA). Secondly, we present the proof of fractal property in k - M set f c z = z k + c with exponent k    ( k

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2014/398583 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:10:y:2014:i:5:p:398583

DOI: 10.1155/2014/398583

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().