Polynomiography and applications in art, education, and science

Computers and Graphics (Pergamon)

Volumn 28, Issue 3, 2004, Pages 417-430

  Kalantari, Bahman ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Arts and humanities; Computer graphics; Computers and education; Mathematical software; Polynomials; Roots of nonlinear equations

Indexed keywords

ABSTRACTING; ALGORITHMS; APPROXIMATION THEORY; EDUCATION; HUMAN COMPUTER INTERACTION; IMAGE ANALYSIS; LEARNING SYSTEMS; NONLINEAR EQUATIONS; POLYNOMIALS; PROBLEM SOLVING; SOFTWARE ENGINEERING; THEOREM PROVING; VISUALIZATION;

ARTS AND GRAPHICS; COMPUTER AND EDUCATION; MATHEMATICAL SOFTWARE; ROOTS OF NONLINEAR EQUATIONS;

COMPUTER GRAPHICS;

EID: 2542502724     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2004.03.009     Document Type: Conference Paper

References (48)

1. Pan V.Y. Solving a polynomial equation: some history and recent progress. SIAM Review. 39:1997;187-220.
2. Smale S. The fundamental theorem of algebra and complexity theory. Bulletin of the American Mathematical Society. 4:1981;1-36.
3. McNamee J.M. A bibliography on root of polynomials. Journal of Computational and Applied Mathematics. 47:1993;391-394.
4. Jenkins M.A., Traub J.F. A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration. Numerische Mathematik. 14:1970;252-263.
5. Weyl H. Randbemerkungen zu Hauptproblemen der Mathematik. II. Fundamentalsatz der Algebra und Grundlagen der Mathematik. Mathematische Zeitschrift. 20:1924;131-150.
6. Renegar J. On the worst-case complexity of approximating zeros of polynomials. Journal of Complexity. 3:1987;90-113.
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.
8. Kirrinnis P. Partial fraction decomposition in C(z) and simultaneous Newton iteration for factorization in C[z]. Journal of Complexity. 14:1998;378-444.
9. Smale S. Newton's method estimates from data at one point. Ewing R.E., Gross K.I., Martin C.F. The merging of disciplines: new directions in pure, applied, and computational mathematics. 1986;185-196 Springer-Verlag, Berlin.
10. Shub M., Smale S. Computational complexity: on the geometry of polynomials and a theory of cost, part I. Annales Scientifiques de l'Ecole Normale Superieure. 18:1985;107-142.
11. Shub M., Smale S. Computational complexity: on the geometry of polynomials and a theory of cost, part II. SIAM Journal on Computing. 15:1986;145-161.
12. Friedman J. On the convergence of Newton's method. Journal of Complexity. 5:1989;12-33.
13. Bini D, Pan VY. Polynomials and matrix computations, fundamental algorithms, vol. 1. Boston: Birkhäuser; 1994.
14. Borwein P, Erdélyi T. Polynomials and polynomial inequalities, vol. 161. New York: Springer; 1995.
15. 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.
16. Kalantari B., Kalantari I. High order iterative methods for approximating square roots. BIT. 36:1996;395-399.
17. Kalantari B., Kalantari I., Zaare-Nahandi R. A basic family of iteration functions for polynomial root finding and its characterizations. Journal of Computational and Applied Mathematics. 80:1997;209-226.
18. Halley E. 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:1694;136-145.
19. Ypma T.J. Historical development of Newton-Raphson method. SIAM Review. 37:1995;531-551.
20. Traub J.F. Iterative methods for the solution of equations. 1964;Prentice-Hall, Englewood Cliffs, NJ.
21. Kalantari B. On the order of convergence of a determinantal family of root-finding methods. BIT. 39:1999;96-109.
22. Kalantari B. 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:2000;287-318.
23. 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.
24. 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.
25. Kalantari B., Gerlach J. Newton's method and generation of a determinantal family of iteration functions. Journal of Computational and Applied Mathematics. 116:2000;195-200.
26. Kalantari B. New formulas for approximation of. π and other transcendental numbers Numerical Algorithms. 24:2000;59-81.
27. Kalantari B. An infinite family of iteration functions of order m for every m. Department of Computer Science, Rutgers University, New Brunswick, NJ, forthcoming.
28. Kalantari B., Park S. A computational comparison of the first nine members of a determinantal family of root-finding methods. Journal of Computational and Applied Mathematics. 130:2001;197-204.
29. 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.).
30. Vrscay E.R., Gilbert W.J. Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König iteration functions. Numerische Mathematik. 52:1988;1-16.
31. Gerlach J. Accelerated convergence in Newton's method. SIAM Review. 36:1994;272-276.
32. Kalantari B., Jin Y. On extraneous fixed-points of the basic family of iteration functions. BIT. 43:2003;453-458.
33. 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.
34. 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.
35. 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.
36. Kalantari B. Polynomiography and applications in art, education, and science. Proceedings of ACM SIGGRAPH, Educator Program, 2003.
37. Kalantari B. The art in polynomiography of special polynomials. Proceedings of ISAMA-BRIDGES 2003, Granada, Spain, 2003. p. 173-80.
38. Kalantari B. The fundamental theorem of algebra and iteration functions. Department of Computer Science, Rutgers University, New Brunswick, NJ, forthcoming.
39. Gleick J. Chaos: making a new science. 1988;Penguin Books, Harmondsworth.
40. Neuberger J.W. Continuous Newton's method for polynomials. The Mathematical Intelligencer. 21:1999;18-23.
41. Varona J.L. Graphic and numerical comparison between iterative methods. The Mathematical Intelligencer. 24:2002;37-45.
42. Mandelbrot B.B. The fractal geometry of nature. 1983;W.F. Freeman, New York.
43. Julia G. Sur les équations fonctionelles. Journal de Mathematiques Pures et Appliquees. 4:1918;47-245.
44. Fatou P. Sur les équations fonctionelles. Bulletin de la Societe Mathematique de France. 47:1919;161-271.
45. Peitgen H.-.O., Saupe D., Jurgens H., Yunker L. Chaos and fractals. 1992;Springer, New York.
46. Peitgen H.-.O., Richter P.H. The beauty of fractals. 1992;Springer, New York.
47. Devaney R.L. Introduction to chaotic dynamic systems. 1986;Benjamin Cummings, Menlo Park, CA.
48. Falconer K.J. Fractal geometry: mathematical foundations and applications. 1990;Wiley, New York.