tocrtpoly.m

来自「Mathematical Methods by Moor n Stiling.」· M 代码 · 共 24 行

M
24
字号
function y = tocrt(f,m)
% 
% Compute the representation of the polynomial f using the
% using the Chinese Remainder Theorem (CRT) with
% moduli m = {m1,m2,...,mr}.  It is assumed (without checking)
% that the moduli are relatively prime.
% m is passed in as a cell array containing polynomial vectors
% and y is returned as a cell array containing polynomial vectors
%
% function y = tocrt(f,m)
%
% f = polynomial
% m = set of modulo polynomials
%
% y = CRT form of f

% Copyright 1999 by Todd K. Moon

[n,r] = size(m);
for i=1:r
  [q,y{i}] = polydiv(f,m{i});
end

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?