The roots tag has no wiki summary.
3
votes
4answers
161 views
How to find more than one root of a polynomial?
This program finds the first root of the function f, defined in the code. There are 5 roots of this function. (x=1,2,3,4,5) I wish to find all of the roots in this program and print them to the ...
6
votes
2answers
124 views
Find all the roots of a function in a given interval
I need to find all the roots of a scalar function in a given interval. The function may have discontinuities. The algorithm can have a precision of ε (e.g. it is ok if the algorithm doesn't find two ...
2
votes
1answer
78 views
Non-linear root finding when the Jacobian is almost singular
I'm trying to solve a system non linear-equations:
$$
\frac{\partial K(\mathbf{\lambda})}{\partial \lambda_i} - c_i = 0
$$
for $i = 1, \dots, 15$, using Newton's method:
$$
\lambda^{k + 1} = \lambda^k ...
5
votes
2answers
303 views
Solution of quartic equation
Is there a open C-implementation for the solution of quartic equations:
$$ax⁴+bx³+cx²+dx+e=0$$
I am thinking of an implementation of Ferrari's solution. On Wikipedia I read that the solution is ...
7
votes
5answers
275 views
Iterative solution to a nonlinear equation
I appologize in advance if this question is silly.
I need to compute the root of
\begin{equation}
u -f(u) =0
\end{equation}
Where $u$ is a real vector and $f(u)$ is a real-vector valued function.
...
5
votes
2answers
124 views
Is there a backward stable $\tilde{O}(n \log(1/\epsilon))$ algorithm to factor a complex polynomial?
Finding the roots of a complex polynomial is in general extremely numerically unstable, as discussed in (1). According to Pan ((2), (3)), this produces a cubic complexity lower bound, and he presents ...
