Hello,
there exists a built-in function "roots" which computes the roots of a given polynomial. How does octave computes these roots? This function is pretty fast, but are there faster functions doing the same? We have to compute the roots of a huge number of polynomials in our program, thus this could minimize the runtime.
Or are there faster algorithms in the case that we aren't interested in all roots, but only in a special root whose real part is already known?