MATLAB 欧几里得算法以及扩展欧几里得算法
前言
提示:在线性代数或高等代数中以熟悉求两个多项式最大公因子
一、Euclid算法
输入两个多项式 g(x) , h(x) ∈ F(x),满足 deg g(x) ≥ deg h(x) , 且 g(x) ≠ 0,
二、Code
1.引入库
代码如下(欧几里得代码):
function d= mGCD(g,h)
syms r r1 r2 d;
r = g; r1 = h;
while r1~=0
[~,r2] = quorem(r,r1);
r = r1;
r1 = r2;
end
c = sym2poly(r);
c = c(1,1);
d = simplify(r / c);
代码如下(扩展的欧几里得代码):
function [d,s,t]= XGCD(g,h)
% 例:
% [d,s,t]= XGCD(x^3 + 2 * x^2 + 3 * x^1 + 4 , x^2 + 2 * x + 1)
syms q t1 t2 y1 y2 r r1 s t r2 d ;
s=1;t=0;r=g;
t1=1;s1=0;r1=h;
while ~isreal(r1) && r1~=0
[q,r2] = quorem(r,r1);
r = r1;
s = s1;
t = t1;
r1 = r2;
s1 = s-q*s1;
t1 = t-q*s1;
end
c = sym2poly(r);
c = c(1,1);
d = simplify(r / c);
s = simplify(s / c);
t = simplify(t / c);
end
2.读入数据
示例:
欧几里得代码调用:
d=mGCD(x^3 + 3 * x^2 + 3 * x + 1 , x + 1)
欧几里得代码调用:
[d,s,t]= XGCD(x^3 + 2 * x^2 + 3 * x^1 + 4 , x^2 + 2 * x + 1)
使用的matlab版本位MATLAB 2019b
截图: