辗转相除，又名欧几里德算法（Euclidean algorithm）乃求两个正整数之最大公约数的算法。
摘要求两个多项式的最大公因式，可以用辗转相除法及分解因式法。
Generally speaking division algorithm and factor resolution can be used to find the greatest common factor of the two multinomial.
该综合过程实质上是一个达林顿网络综合过程，需求出滤波器网络的输入、输出导纳函数，通过辗转相除逐步提取出网络元件值。
The synthesis process is essentially a Darlington approach, requiring to construct the input and output admittances to evaluate the elements of the network.
应用推荐