Accuracy of Computer Generated Approximations to Julia Sets
| dc.contributor.author | Hoggard, John W. | en |
| dc.contributor.committeechair | Rossi, John F. | en |
| dc.contributor.committeemember | Olin, Robert F. | en |
| dc.contributor.committeemember | Haskell, Peter E. | en |
| dc.contributor.committeemember | Linnell, Peter A. | en |
| dc.contributor.committeemember | Wheeler, Robert L. | en |
| dc.contributor.department | Mathematics | en |
| dc.date.accessioned | 2014-03-14T20:15:11Z | en |
| dc.date.adate | 2000-08-17 | en |
| dc.date.available | 2014-03-14T20:15:11Z | en |
| dc.date.issued | 2000-07-31 | en |
| dc.date.rdate | 2001-08-17 | en |
| dc.date.sdate | 2000-08-14 | en |
| dc.description.abstract | A Julia set for a complex function 𝑓 is the set of all points in the complex plane where the iterates of 𝑓 do not form a normal family. A picture of the Julia set for a function can be generated with a computer by coloring pixels (which we consider to be small squares) based on the behavior of the point at the center of each pixel. We consider the accuracy of computer generated pictures of Julia sets. Such a picture is said to be accurate if each colored pixel actually contains some point in the Julia set. We extend previous work to show that the pictures generated by an algorithm for the family λe² are accurate, for appropriate choices of parameters in the algorithm. We observe that the Julia set for meromorphic functions with polynomial Schwarzian derivative is the closure of those points which go to infinity under iteration, and use this as a basis for an algorithm to generate pictures for such functions. A pixel in our algorithm will be colored if the center point becomes larger than some specified bound upon iteration. We show that using our algorithm, the pictures of Julia sets generated for the family λtan(z) for positive real λ are also accurate. We conclude with a cautionary example of a Julia set whose picture will be inaccurate for some apparently reasonable choices of parameters, demonstrating that some care must be exercised in using such algorithms. In general, more information about the nature of the function may be needed. | en |
| dc.description.degree | Ph. D. | en |
| dc.identifier.other | etd-08142000-10410017 | en |
| dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-08142000-10410017/ | en |
| dc.identifier.uri | http://hdl.handle.net/10919/28647 | en |
| dc.publisher | Virginia Tech | en |
| dc.relation.haspart | hoggard.pdf | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | tangent | en |
| dc.subject | meromorphic | en |
| dc.subject | computer algorithms | en |
| dc.subject | polynomial Schwarzian derivative | en |
| dc.subject | Julia sets | en |
| dc.title | Accuracy of Computer Generated Approximations to Julia Sets | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Mathematics | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1