Superior Julia Set

Julia sets, their variants and generalizations have been studied extensively by using the Picard iterations. The purpose of this paper is to introduce Mann iterative procedure in the study of Julia sets. Escape criterions with respect to this process are obtained for polynomials in the complex plane. New escape criterions are significantly much superior to their corresponding cousins. Further, new algorithms are devised to compute filled Julia sets. Some beautiful and exciting figures of new filled Julia sets are included to show the power and fascination of our new venture.