final LaguerreSolver solver = new LaguerreSolver(); final Complex[] result = solver.solveAllComplex(coeff, 0);
try { if (laguerreSolver == null) { laguerreSolver = new LaguerreSolver();
public void design() { reset(); for (int i = 0; i < degree + 1; ++i) { m_a[i] = reversebessel(i, degree); } LaguerreSolver laguerreSolver = new LaguerreSolver(); m_root = laguerreSolver.solveAllComplex(m_a,0.0); Complex inf = Complex.INF; int pairs = degree / 2; for (int i = 0; i < pairs; ++i) { Complex c = m_root[i]; addPoleZeroConjugatePairs(c, inf); } if ((degree & 1) == 1) add(new Complex(m_root[pairs].getReal()), inf); }
try { if (laguerreSolver == null) { laguerreSolver = new LaguerreSolver();
", derivative is " + derivative.toString()); final LaguerreSolver solver = new LaguerreSolver(); final Complex[] roots = solver.solveAllComplex(derivative.getCoefficients(), initialGuess, getMaxEvaluations()); if (roots == null)