Piecewise quadratic bounding functions for finding real roots of polynomials

In this paper, our main interest is to create/ construct a new useful and outstanding algorithm to obtain roots of the real polynomial represented by \begin{document}$ f(x) = c_{0}+c_{1}x+...+c_{i}x^{i}+...+c_{n}x^{n} $\end{document} where coefficients of the polynomials are real numbers and \begin{document}$ x $\end{document} is a real number in the closed interval of \begin{document}$ \mathbb{R} $\end{document} . Also, our results are supported by numerical examples. Then, a new algorithm is compared with the others (writer classical methods) and this algorithm is more useful than others.