Hello, yes please feel free to send a patch. Is the new algorithm better
than the existing one? Can you demonstrate why its better?
On 10/30/24 16:12, hugohp via Users list for GNU Scientific Library
(GSL) help wrote:
[External email - use caution]
Hi
Is GSL still working on new features?
I am looking at gsl_poly_complex_solve which computes the roots of polynomials.
There are other ways (better?) of computing roots of polynomials. I am looking
at NAG's c02aac which uses a technique detailed in Cameron 2008.
Source code (fortran/MIT license) is here:
https://github.com/trcameron/FPML/blob/master/src/fpml.f90
I am thinking of re-implementing this function in C and adding it to GSL.
We can legally change license to GPL.
Would you accept it?
Regards
Hugo
c02aac: https://support.nag.com/numeric/nl/nagdoc_latest/clhtml/c02/c02aac.html
Cameron 2008: https://www.thomasrcameron.com/pubs/PML.pdf
Sent with [Proton Mail](https://proton.me/mail/home) secure email.
