Polynomiography and applications in art, education, and science

Pan, 1997, Solving a polynomial equation: some history and recent progress, SIAM Review, 39, 187, 10.1137/S0036144595288554 Smale, 1981, The fundamental theorem of algebra and complexity theory, Bulletin of the American Mathematical Society, 4, 1, 10.1090/S0273-0979-1981-14858-8 McNamee, 1993, A bibliography on root of polynomials, Journal of Computational and Applied Mathematics, 47, 391, 10.1016/0377-0427(93)90064-I Jenkins, 1970, A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, Numerische Mathematik, 14, 252, 10.1007/BF02163334 Weyl, 1924, Randbemerkungen zu Hauptproblemen der Mathematik. II. Fundamentalsatz der Algebra und Grundlagen der Mathematik, Mathematische Zeitschrift, 20, 131, 10.1007/BF01188076 Renegar, 1987, On the worst-case complexity of approximating zeros of polynomials, Journal of Complexity, 3, 90, 10.1016/0885-064X(87)90022-7 Pan VY. New techniques for approximating complex polynomial zeros. Proceedings of the Fifth Annual ACM–SIAM Symposium on Discrete Algorithms, 1994. p. 260–70. Kirrinnis, 1998, Partial fraction decomposition in C(z) and simultaneous Newton iteration for factorization in C[z], Journal of Complexity, 14, 378, 10.1006/jcom.1998.0481 Smale, 1986, Newton's method estimates from data at one point, 185 Shub, 1985, Computational complexity: on the geometry of polynomials and a theory of cost, part I, Annales Scientifiques de l'Ecole Normale Superieure, 18, 107, 10.24033/asens.1486 Shub, 1986, Computational complexity: on the geometry of polynomials and a theory of cost, part II, SIAM Journal on Computing, 15, 145, 10.1137/0215011 Friedman, 1989, On the convergence of Newton's method, Journal of Complexity, 5, 12, 10.1016/0885-064X(89)90010-1 Bini D, Pan VY. Polynomials and matrix computations, fundamental algorithms, vol. 1. Boston: Birkhäuser; 1994. Borwein P, Erdélyi T. Polynomials and polynomial inequalities, vol. 161. New York: Springer; 1995. Kalantari B. On homogeneous linear recurrence relations and approximation of zeros of complex polynomials. Technical report DCS-TR 412, Department of Computer Science, Rutgers University, New Brunswick, NJ, 2000. DIMACS Proceedings on Unusual Applications in Number Theory, to appear. Kalantari, 1996, High order iterative methods for approximating square roots, BIT, 36, 395, 10.1007/BF01731991 Kalantari, 1997, A basic family of iteration functions for polynomial root finding and its characterizations, Journal of Computational and Applied Mathematics, 80, 209, 10.1016/S0377-0427(97)00014-9 Halley, 1694, A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction, Philosophical Transactions of the Royal Society of London, 18, 136, 10.1098/rstl.1694.0029 Ypma, 1995, Historical development of Newton–Raphson method, SIAM Review, 37, 531, 10.1137/1037125 Traub, 1964 Kalantari, 1999, On the order of convergence of a determinantal family of root-finding methods, BIT, 39, 96, 10.1023/A:1022321325108 Kalantari, 2000, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications, Journal of Computational and Applied Mathematics, 126, 287, 10.1016/S0377-0427(99)00360-X Kalantari B. Approximation of polynomial root using a single input and the corresponding derivative values. Technical report DCS-TR 369, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1998. Kalantari B. Halley's method is the first member of an infinite family of cubic order root-finding methods. Technical report DCS-TR 370, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1998. Kalantari, 2000, Newton's method and generation of a determinantal family of iteration functions, Journal of Computational and Applied Mathematics, 116, 195, 10.1016/S0377-0427(99)00361-1 Kalantari, 2000, New formulas for approximation of π and other transcendental numbers, Numerical Algorithms, 24, 59, 10.1023/A:1019184908442 Kalantari B. An infinite family of iteration functions of order m for every m. Department of Computer Science, Rutgers University, New Brunswick, NJ, forthcoming. Kalantari, 2001, A computational comparison of the first nine members of a determinantal family of root-finding methods, Journal of Computational and Applied Mathematics, 130, 197, 10.1016/S0377-0427(99)00383-0 Schröder E. On infinitely many algorithms for solving equations (German). Mathematische Annalen 1870; 2: 317–65. (English translation by Stewart GW. TR-92-121, Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 1992.) Vrscay, 1988, Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König iteration functions, Numerische Mathematik, 52, 1, 10.1007/BF01401018 Gerlach, 1994, Accelerated convergence in Newton's method, SIAM Review, 36, 272, 10.1137/1036057 Kalantari, 2003, On extraneous fixed-points of the basic family of iteration functions, BIT, 43, 453, 10.1023/A:1026095904985 Kalantari B. An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound. Technical report DCS-TR-521, Department of Computer Science, Rutgers University, New Brunswick, NJ, 2003. Mathematics of Computation, to appear. Jin Y, Kalantari B. On general convergence of the Basic Family for extracting radicals. Technical report DCS-TR-530, Department of Computer Science, Rutgers University, New Brunswick, NJ, 2003. Kalantari B. Polynomiography: a new intersection between mathematics and art. Technical report DCS-TR-521, Department of Computer Science, Rutgers University, New Brunswick, NJ, 2002. Kalantari B. Polynomiography and applications in art, education, and science. Proceedings of ACM SIGGRAPH, Educator Program, 2003. Kalantari B. The art in polynomiography of special polynomials. Proceedings of ISAMA-BRIDGES 2003, Granada, Spain, 2003. p. 173–80. Kalantari B. The fundamental theorem of algebra and iteration functions. Department of Computer Science, Rutgers University, New Brunswick, NJ, forthcoming. Gleick, 1988 Neuberger, 1999, Continuous Newton's method for polynomials, The Mathematical Intelligencer, 21, 18, 10.1007/BF03025411 Varona, 2002, Graphic and numerical comparison between iterative methods, The Mathematical Intelligencer, 24, 37, 10.1007/BF03025310 Mandelbrot, 1983 Julia, 1918, Sur les équations fonctionelles, Journal de Mathematiques Pures et Appliquees, 4, 47 Fatou, 1919, Sur les équations fonctionelles, Bulletin de la Societe Mathematique de France, 47, 161, 10.24033/bsmf.998 Peitgen, 1992 Peitgen, 1992 Devaney, 1986 Falconer, 1990