This method has a completely iterative scheme that is used for converting quartic equation to a product of quadratic factors. To convert equation, x4 + ax3 + bx2 + cx + d = 0 to a form of (x2 + px + q)(x2 + rx + s)=0 we consider different cases such as d>0, d<0 and other conditions that are introduced under the title of theorems, proofs and then values of p, q, r, s exactly or approximately with a desired by the use of iterative procedure and then we compared this method with methods of Newton's and Bairstow's in terms of Precision of roots and number of the required iterative due to gain roots.