Lines Matching full:roots
45 const RootsType& roots( psolve.roots() ); in aux_evalSolver() local
47 for( int i=0; i<roots.size(); ++i ){ in aux_evalSolver()
48 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } in aux_evalSolver()
55 cerr << "Roots found: " << roots.transpose() << endl; in aux_evalSolver()
56 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl; in aux_evalSolver()
60 std::vector<Scalar> rootModuli( roots.size() ); in aux_evalSolver()
61 Map< EvalRootsType > aux( &rootModuli[0], roots.size() ); in aux_evalSolver()
62 aux = roots.array().abs(); in aux_evalSolver()
95 template< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >
96 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_ro… in evalSolverSugarFunction() argument
107 // 1) the roots found are correct in evalSolverSugarFunction()
108 // 2) the roots have distinct moduli in evalSolverSugarFunction()
132 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), in evalSolverSugarFunction()
136 VERIFY( internal::isApprox( roots.array().abs().minCoeff(), in evalSolverSugarFunction()