Lines Matching full:polynomial
29 * \brief This module provides a QR based polynomial solver.
44 and a QR based polynomial solver.
48 polynomials, computing estimates about polynomials and next the QR based polynomial
55 void roots_to_monicPolynomial( const RootVector& rv, Polynomial& poly )
68 evaluates a polynomial at a given point using stabilized Hörner method.
70 The following code: first computes the coefficients in the monomial basis of the monic polynomial that has the provided roots;
71 then, it evaluates the computed polynomial, using a stabilized Hörner method.
79 Real cauchy_max_bound( const Polynomial& poly )
81 provides a maximum bound (the Cauchy one: \f$C(p)\f$) for the absolute value of a root of the given polynomial i.e.
89 Real cauchy_min_bound( const Polynomial& poly )
91 provides a minimum bound (the Cauchy one: \f$c(p)\f$) for the absolute value of a non zero root of the given polynomial i.e.
98 \section QR polynomial solver class
99 Computes the complex roots of a polynomial by computing the eigenvalues of the associated companion matrix with the QR algorithm.
114 Therefore the current polynomial solver is guaranteed to provide a correct result only when the complex roots \f$r_1,r_2,...,r_d\f$ have distinct moduli i.e.
120 (double) floating types and small polynomial degree (<20).
126 -# a simple use of the polynomial solver is shown;
127 -# the accuracy problem with the QR algorithm is presented: a polynomial with almost conjugate roots is provided to the solver.
