[Help-gsl] Polynomial root

[Fepps]

Hello,

I was looking through the code used to calculate the root of a polynomial,
and I was wondering about two things:

1-Why is a separate qr coded inside of the iteration strategy, when there
already exists code to build off of this in the linalg section?  I'm
guessing this is some sort of design choice?
2-Why is the particular shifting strategy used? (i.e., where 0.4375
constant comes from in the qr.c file in poly)

Thanks,
~F