2009
DOI: 10.1007/s10851-009-0171-0
|View full text |Cite
|
Sign up to set email alerts
|

Effect of Stochastic Noise on Superior Julia Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
26
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 50 publications
(26 citation statements)
references
References 14 publications
0
26
0
Order By: Relevance
“…This will give the ability of changing a biomorph's shape in a predictable way. Negi et al [20] and Rani et al [26] have made a research on the noise in superior Mandelbrot set and superior Julia sets, so we will try to extend their work on the modified biomorphs introduced in this paper.…”
Section: Discussionmentioning
confidence: 99%
“…This will give the ability of changing a biomorph's shape in a predictable way. Negi et al [20] and Rani et al [26] have made a research on the noise in superior Mandelbrot set and superior Julia sets, so we will try to extend their work on the modified biomorphs introduced in this paper.…”
Section: Discussionmentioning
confidence: 99%
“…Also, they have studied the fractal structure and discontinuity law of the generalized Julia sets generated from the extended complex mapping z n + c, where n ∈ R [25]. Further, Julia and Mandelbrot sets have been studied under the effect of noises [19,4,14,15,27]. In 2004, Rani and Kumar [17,18] introduced the superior iterate and created superior Julia and Mandelbrot sets for quadratic [17,18] and cubic [17,18] polynomials.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, the attention of scientists has focused on the use of different iteration schemes from fixed point theory in the generation of patterns. The iteration schemes have been mainly used in the generation of fractal patterns defined in the complex plane, such as the well‐known Mandelbrot and Julia sets [AA12, ARC14, RA10], and in polynomiography [GKL15] (a method that is based on the root‐finding methods of complex polynomials).…”
Section: Introductionmentioning
confidence: 99%