The usual formulation of efficient division uses Newton iteration to compute an inverse in a related domain where multiplicative inverses exist. On one hand, Newton iteration allows quotients to be calculated using an efficient multiplication method. On the other hand, working in another domain is not always desirable and can lead to a library structure where arithmetic domains are interdependent. This paper uses the concept of a whole shifted inverse and modified Newton iteration to compute quotients efficiently without leaving the original domain. The iteration is generic to domains having a suitable shift operation, such as integers or polynomials with coefficients that do not necessarily commute.

翻译：通常的除法高效计算公式利用牛顿迭代法在存在乘法逆的相关域中计算逆元。一方面，牛顿迭代法允许通过高效乘法方法计算商；另一方面，在另一个域中运算并非总是理想的选择，可能导致算术域相互依赖的库结构。本文采用整体移位逆和修正牛顿迭代法的概念，在不离开原始域的情况下高效计算商。该迭代方法适用于具有合适移位操作的域（例如整数或系数不一定可交换的多项式域），具有通用性。