Re: problem with consistency of root finding and sorting

[David Bateman]

Ben Abbott wrote:
>
> Thanks for anticipating the last part
>
>  p(indx)
> ans =
>
>   -0.0000 + 3.0000i
>    0.0000 + 3.0000i
>   -0.0000 - 3.0000i
>    0.0000 - 3.0000i
>
> The problem appears to have been solved!
>
> Thanks David
> (and Henry too)
>

Can you now send this as a patch against the CVS with a changelog so
that we can ensure that exactly what you want is included.

D.

-- 
David Bateman                                address@hidden
Motorola Labs - Paris                        +33 1 69 35 48 04 (Ph) 
Parc Les Algorithmes, Commune de St Aubin    +33 6 72 01 06 33 (Mob) 
91193 Gif-Sur-Yvette FRANCE                  +33 1 69 35 77 01 (Fax) 

The information contained in this communication has been classified as: 

[x] General Business Information 
[ ] Motorola Internal Use Only 
[ ] Motorola Confidential Proprietary