Solution of polynomial equations in arbitrary orders

The article deals with an algorithm of solving polynomial equations in a ring $\mathfrak D [x]$, where $\mathfrak D$ is an arbitrary order of field $\mathbb Q (\omega)$ and $\omega$ is an algebraic integer. The algorithm develops Kurt Hensel's idea published in 1904 which was named Hensel's lifting lemma later. The algorithm described is based on the following theoretical results. Firstly, basis of order $\mathfrak D$ expansion coefficients of the equation roots are estimated, i. e. an estimate for the polynomial equation roots height in an algebraic number field arbitrary order is derived. Secondly, an iterative formula for the corresponding polynomial congruence solution quadratic lifting modulo power of prime in the order is obtained. This formula does not contain any divisions. Thirdly, an effective bound for prime power the congruence solution needs to be lifted to obtain the exact solution of the original equation is derived.
Notice that a prime $p$ which is used for lifting needs to satisfy certain conditions for the algorithm correct work. In particular, $p$ should not derive the original polynomial and its derivative resultant norm and also $p$ should not derive discriminant of an algebraic integer $\omega$. Also the algorithm complexity is decreased if it is possible to choose prime $p$ which in addition to two previous conditions has the following property: the minimal polynomial of $\omega$ which coefficients are reduced modulo $p$ is irreducible over finite field $\mathbb F_p$. In this case the algorithm complexity is $\mathcal O(m^4+m^3\ln m\ln (\max_{0\le i\le m}$$)+m^3\ln (\max_{0\le i\le m}$$)\ln\ln(\max_{0\le i\le m}$$)$ arithmetic operations. Here $m$ is the original polynomial degree, $\gamma_i$, $0\le i\le m$ are its coefficients and is the algebraic numbers conjugated to $\gamma$ absolute values maximum. If it is impossible to choose prime number $p$ such that minimal polynomial of $\omega$ is irreducible over $\mathbb F_p$ then the algorithm complexity is $\mathcal O(m^4+m^3\ln m\ln (\max_{0\le i\le m}$$)+m^3\ln (\max_{0\le i\le m}$$)\ln\ln(\max_{0\le i\le m}$$)+m^d\ln\ln(\max_{0\le i\le m}$$))$ arithmetic operations. Here $d$ is the minimal polynomial of $\omega$ irreducible factors over $\mathbb F_p$ number. The algorithm includes strategy to select a prime $p$ to achieve lower computational complexity.
Bibliography: 15 titles.