📄 rr_factor.m
字号:
function lst = rr_factor(Q,D,m)% Roth-Ruckstein algorithm for finding roots of a bivariate polynomial%initializep = -1;deg = -1;t = 2;u = 1;coeff = gf(0,m);f = gf([],m);% Check first if we were passed an all-y polynomial, in which% case we can factor it immediately. Otherwise, recurse down % the tree using the standard depth-first search.if (size(Q,1) == 1) a = roots(fliplr(Q)); lst = [0; a];else [t,p,deg,coeff,f] = rr_dfs(Q,D,u,t,p,deg,coeff,f,m); lst = f;end
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -