+@Book{Kalantari08,
+ALTauthor = {B. Kalantari},
+title = {Polynomial root finding and polynomiography.},
+publisher = {World Scientifict,New Jersey},
+year = {2008},
+OPTkey = {•},
+OPTvolume = {•},
+OPTnumber = {•},
+OPTseries = {•},
+OPTaddress = {•},
+OPTmonth = {December},
+OPTnote = {•},
+OPTannote = {•}
+}
+
+
+@InProceedings{Gemignani07,
+ author = "Luca Gemignani",
+ title = "Structured matrix methods for polynomial
+ root-finding",
+ editor = "C. W. Brown",
+ booktitle = "Proceedings of the 2007 International Symposium on
+ Symbolic and Algebraic Computation, July 29--August 1,
+ 2007, University of Waterloo, Waterloo, Ontario,
+ Canada",
+ publisher = "ACM Press",
+ address = "pub-ACM:adr",
+ ISBN = "1-59593-743-9 (print), 1-59593-742-0 (CD-ROM)",
+ isbn-13 = "978-1-59593-743-8 (print), 978-1-59593-742-1
+ (CD-ROM)",
+ pages = "175--180",
+ year = "2007",
+ doi = "http://doi.acm.org/10.1145/1277548.1277573",
+ bibdate = "Fri Jun 20 08:46:50 MDT 2008",
+ bibsource = "http://portal.acm.org/;
+ http://www.math.utah.edu/pub/tex/bib/issac.bib",
+ abstract = "In this paper we discuss the use of structured matrix
+ methods for the numerical approximation of the zeros of
+ a univariate polynomial. In particular, it is shown
+ that root-finding algorithms based on floating-point
+ eigenvalue computation can benefit from the structure
+ of the matrix problem to reduce their complexity and
+ memory requirements by an order of magnitude.",
+ acknowledgement = "Nelson H. F. Beebe, University of Utah, Department
+ of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
+ City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
+ 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
+ \path|beebe@acm.org|, \path|beebe@computer.org|
+ (Internet), URL:
+ \path|http://www.math.utah.edu/~beebe/|",
+ keywords = "complexity; eigenvalue computation; polynomial
+ root-finding; rank-structured matrices",
+ doi-url = "http://dx.doi.org/10.1145/1277548.1277573",
+}
