Mercurial > hg > octave-nkf
view scripts/polynomial/polygcd.m @ 6994:3fbf49bde6d4
[project @ 2007-10-10 00:21:29 by jwe]
author | jwe |
---|---|
date | Wed, 10 Oct 2007 00:21:29 +0000 |
parents | 9398f6a81bdf |
children | 93c65f2a5668 |
line wrap: on
line source
## Copyright (C) 2000 Paul Kienzle ## ## This program is free software; you can redistribute it and/or modify ## it under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 2 of the License, or ## (at your option) any later version. ## ## This program is distributed in the hope that it will be useful, ## but WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ## GNU General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with this program; if not, write to the Free Software ## Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA ## 02110-1301 USA ## -*- texinfo -*- ## @deftypefn {Function File} {@var{q} =} polygcd (@var{b}, @var{a}, @var{tol}) ## ## Find greatest common divisor of two polynomials. This is equivalent ## to the polynomial found by multiplying together all the common roots. ## Together with deconv, you can reduce a ratio of two polynomials. ## Tolerance defaults to ## @example ## sqrt(eps). ## @end example ## Note that this is an unstable ## algorithm, so don't try it on large polynomials. ## ## Example ## @example ## polygcd (poly(1:8), poly(3:12)) - poly(3:8) ## @result{} [ 0, 0, 0, 0, 0, 0, 0 ] ## deconv (poly(1:8), polygcd (poly(1:8), poly(3:12))) - poly(1:2) ## @result{} [ 0, 0, 0 ] ## @end example ## @seealso{poly, polyinteg, polyderiv, polyreduce, roots, conv, deconv, ## residue, filter, polyval, and polyvalm} ## @end deftypefn function x = polygcd (b, a, tol) if (nargin == 2 || nargin == 3) if (nargin == 2) tol = sqrt (eps); endif if (length (a) == 1 || length (b) == 1) if (a == 0) x = b; elseif (b == 0) x = a; else x = 1; endif else a /= a(1); while (1) [d, r] = deconv (b, a); nz = find (abs (r) > tol); if (isempty (nz)) x = a; break; else r = r(nz(1):length(r)); endif b = a; a = r / r(1); endwhile endif else print_usage (); endif endfunction