complex polynomials

[Brian Gough]

J.J.Green writes:
 > Ive been looking into the possibility of porting an algorithm for
 > calculating the maximum modulus of a complex polynomial to GSL. The
 > algortithm is described in SINUM 83 (2000), also available at
 >   http://www.vindaloo.uklinux.net/jjg/papers/
 > Would there be an interest in having this included in GSL?

I'm not familiar with this area... could you give some examples where
it is used in practical applications (e.g. digital filters?).  Thanks.

 >  - the algorithm uses adaptive subdivision and
 >    there are no hard bounds on the amount of memory needed. I read
 >    in the design guide that allocation should be left to the
 >    calling function, so I guess it (the calling routine) should
 >    look something like....

Yes.   Something like that.

-- 
Brian Gough