[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-gsl] solving polynomials of arbitrary degree
From: |
Brian Gough |
Subject: |
Re: [Help-gsl] solving polynomials of arbitrary degree |
Date: |
Mon, 29 Nov 2004 18:04:04 +0000 |
David Monniaux writes:
> I'm therefore wondering which guarantees the *gsl_poly_complex_solve*
> algorithm provides.
Hello,
There is a reference to the original paper for the algorithm in the
GSL manual. If there are any error bounds they should be described
there, but I don't believe the QR method provides a strict bound.
Algorithms for guaranteed bounds aren't part of the current GSL,
although they do exist.
--
best regards,
Brian Gough
Network Theory Ltd,
Commercial support for GSL --- http://www.network-theory.co.uk/gsl/