GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-05-02 00:34:14 +08:00
Code Issues Packages Projects Releases Wiki Activity

PolynomialSolver: fix bugs related to linear polynomials.

Browse Source
This commit is contained in:
Benjamin Chrétien 2014-05-19 19:08:51 +02:00
parent df92649379
commit eda79321be
1 changed files with 17 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
unsupported/Eigen/src/Polynomials/PolynomialSolver.h
View File

@ -41,7 +41,7 @@ class PolynomialSolverBase
protected: protected:
template< typename OtherPolynomial > template< typename OtherPolynomial >
inline void setPolynomial( const OtherPolynomial& poly ){ inline void setPolynomial( const OtherPolynomial& poly ){
m_roots.resize(poly.size()); } m_roots.resize(poly.size()-1); }
public: public:
template< typename OtherPolynomial > template< typename OtherPolynomial >
@ -345,10 +345,19 @@ class PolynomialSolver : public PolynomialSolverBase<_Scalar,_Deg>
void compute( const OtherPolynomial& poly ) void compute( const OtherPolynomial& poly )
{ {
eigen_assert( Scalar(0) != poly[poly.size()-1] ); eigen_assert( Scalar(0) != poly[poly.size()-1] );
internal::companion<Scalar,_Deg> companion( poly ); eigen_assert( poly.size() > 1 );
companion.balance(); if(poly.size() > 2 )
m_eigenSolver.compute( companion.denseMatrix() ); {
m_roots = m_eigenSolver.eigenvalues(); internal::companion<Scalar,_Deg> companion( poly );
companion.balance();
m_eigenSolver.compute( companion.denseMatrix() );
m_roots = m_eigenSolver.eigenvalues();
}
else if(poly.size () == 2)
{
m_roots.resize(1);
m_roots[0] = -poly[0]/poly[1];
}
} }
public: public:
@ -376,8 +385,9 @@ class PolynomialSolver<_Scalar,1> : public PolynomialSolverBase<_Scalar,1>
template< typename OtherPolynomial > template< typename OtherPolynomial >
void compute( const OtherPolynomial& poly ) void compute( const OtherPolynomial& poly )
{ {
eigen_assert( Scalar(0) != poly[poly.size()-1] ); eigen_assert( poly.size() == 2 );
m_roots[0] = -poly[0]/poly[poly.size()-1]; eigen_assert( Scalar(0) != poly[1] );
m_roots[0] = -poly[0]/poly[1];
} }
public: public: