[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Help-gsl] solving polynomials of arbitrary degree

From: David Monniaux
Subject: [Help-gsl] solving polynomials of arbitrary degree
Date: Sun, 28 Nov 2004 10:57:37 +0100
User-agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4.1) Gecko/20031114

I'm considering using the *gsl_poly_complex_solve* function for obtaining the complex roots of a real polynomial. However, for my application, I need some precision assurance about the roots; that is, for each computed root zc_i, I need to have a guaranteed bound epsilon_i such that the "ideal" root zi_i fits |zc_i - zi_i| <= epsilon_i.

The epsilon_i need not be tight; however, they must be guaranteed without any kind of unproved approximation.

I'm therefore wondering which guarantees the *gsl_poly_complex_solve* algorithm provides.

D. Monniaux

reply via email to

[Prev in Thread] Current Thread [Next in Thread]