Mercurial > octave-nkf
view scripts/general/interp1.m @ 14363:f3d52523cde1
Use Octave coding conventions in all m-file %!test blocks
* wavread.m, acosd.m, acot.m, acotd.m, acoth.m, acsc.m, acscd.m, acsch.m,
asec.m, asecd.m, asech.m, asind.m, atand.m, cosd.m, cot.m, cotd.m, coth.m,
csc.m, cscd.m, csch.m, sec.m, secd.m, sech.m, sind.m, tand.m, accumarray.m,
accumdim.m, bitcmp.m, bitget.m, bitset.m, blkdiag.m, cart2pol.m, cart2sph.m,
celldisp.m, chop.m, circshift.m, colon.m, common_size.m, cplxpair.m,
cumtrapz.m, curl.m, dblquad.m, deal.m, divergence.m, flipdim.m, fliplr.m,
flipud.m, genvarname.m, gradient.m, idivide.m, int2str.m, interp1.m,
interp1q.m, interp2.m, interp3.m, interpft.m, interpn.m, isa.m, isdir.m,
isequal.m, isequalwithequalnans.m, issquare.m, logspace.m, nargchk.m,
narginchk.m, nargoutchk.m, nextpow2.m, nthargout.m, num2str.m, pol2cart.m,
polyarea.m, postpad.m, prepad.m, profile.m, profshow.m, quadgk.m, quadv.m,
randi.m, rat.m, repmat.m, rot90.m, rotdim.m, shift.m, shiftdim.m, sph2cart.m,
structfun.m, trapz.m, triplequad.m, convhull.m, dsearch.m, dsearchn.m,
griddata3.m, griddatan.m, rectint.m, tsearchn.m, __makeinfo__.m, doc.m,
get_first_help_sentence.m, help.m, type.m, unimplemented.m, which.m, imread.m,
imwrite.m, dlmwrite.m, fileread.m, is_valid_file_id.m, strread.m, textread.m,
textscan.m, commutation_matrix.m, cond.m, condest.m, cross.m,
duplication_matrix.m, expm.m, housh.m, isdefinite.m, ishermitian.m,
issymmetric.m, logm.m, normest.m, null.m, onenormest.m, orth.m, planerot.m,
qzhess.m, rank.m, rref.m, trace.m, vech.m, ans.m, bincoeff.m, bug_report.m,
bzip2.m, comma.m, compare_versions.m, computer.m, edit.m, fileparts.m,
fullfile.m, getfield.m, gzip.m, info.m, inputname.m, isappdata.m, isdeployed.m,
ismac.m, ispc.m, isunix.m, list_primes.m, ls.m, mexext.m, namelengthmax.m,
news.m, orderfields.m, paren.m, recycle.m, rmappdata.m, semicolon.m,
setappdata.m, setfield.m, substruct.m, symvar.m, ver.m, version.m,
warning_ids.m, xor.m, fminbnd.m, fsolve.m, fzero.m, lsqnonneg.m, optimset.m,
pqpnonneg.m, sqp.m, matlabroot.m, __gnuplot_drawnow__.m,
__plt_get_axis_arg__.m, ancestor.m, cla.m, clf.m, close.m, colorbar.m,
colstyle.m, comet3.m, contourc.m, figure.m, gca.m, gcbf.m, gcbo.m, gcf.m,
ginput.m, graphics_toolkit.m, gtext.m, hggroup.m, hist.m, hold.m, isfigure.m,
ishghandle.m, ishold.m, isocolors.m, isonormals.m, isosurface.m, isprop.m,
legend.m, line.m, loglog.m, loglogerr.m, meshgrid.m, ndgrid.m, newplot.m,
orient.m, patch.m, plot3.m, plotyy.m, __print_parse_opts__.m, quiver3.m,
refreshdata.m, ribbon.m, semilogx.m, semilogxerr.m, semilogy.m, stem.m,
stem3.m, subplot.m, title.m, uigetfile.m, view.m, whitebg.m, compan.m, conv.m,
deconv.m, mkpp.m, mpoles.m, pchip.m, poly.m, polyaffine.m, polyder.m,
polyfit.m, polygcd.m, polyint.m, polyout.m, polyval.m, polyvalm.m, ppder.m,
ppint.m, ppjumps.m, ppval.m, residue.m, roots.m, spline.m, intersect.m,
ismember.m, powerset.m, setdiff.m, setxor.m, union.m, unique.m,
autoreg_matrix.m, bartlett.m, blackman.m, detrend.m, fftconv.m, fftfilt.m,
fftshift.m, freqz.m, hamming.m, hanning.m, ifftshift.m, sinc.m, sinetone.m,
sinewave.m, unwrap.m, bicg.m, bicgstab.m, gmres.m, gplot.m, nonzeros.m, pcg.m,
pcr.m, spaugment.m, spconvert.m, spdiags.m, speye.m, spfun.m, spones.m,
sprand.m, sprandsym.m, spstats.m, spy.m, svds.m, treelayout.m, bessel.m,
beta.m, betaln.m, factor.m, factorial.m, isprime.m, lcm.m, legendre.m,
nchoosek.m, nthroot.m, perms.m, pow2.m, primes.m, reallog.m, realpow.m,
realsqrt.m, hadamard.m, hankel.m, hilb.m, invhilb.m, magic.m, rosser.m,
vander.m, __finish__.m, center.m, cloglog.m, corr.m, cov.m, gls.m, histc.m,
iqr.m, kendall.m, kurtosis.m, logit.m, mahalanobis.m, mean.m, meansq.m,
median.m, mode.m, moment.m, ols.m, ppplot.m, prctile.m, probit.m, quantile.m,
range.m, ranks.m, run_count.m, runlength.m, skewness.m, spearman.m,
statistics.m, std.m, table.m, var.m, zscore.m, betacdf.m, betainv.m, betapdf.m,
betarnd.m, binocdf.m, binoinv.m, binopdf.m, binornd.m, cauchy_cdf.m,
cauchy_inv.m, cauchy_pdf.m, cauchy_rnd.m, chi2cdf.m, chi2inv.m, chi2pdf.m,
chi2rnd.m, discrete_cdf.m, discrete_inv.m, discrete_pdf.m, discrete_rnd.m,
empirical_cdf.m, empirical_inv.m, empirical_pdf.m, empirical_rnd.m, expcdf.m,
expinv.m, exppdf.m, exprnd.m, fcdf.m, finv.m, fpdf.m, frnd.m, gamcdf.m,
gaminv.m, gampdf.m, gamrnd.m, geocdf.m, geoinv.m, geopdf.m, geornd.m,
hygecdf.m, hygeinv.m, hygepdf.m, hygernd.m, kolmogorov_smirnov_cdf.m,
laplace_cdf.m, laplace_inv.m, laplace_pdf.m, laplace_rnd.m, logistic_cdf.m,
logistic_inv.m, logistic_pdf.m, logistic_rnd.m, logncdf.m, logninv.m,
lognpdf.m, lognrnd.m, nbincdf.m, nbininv.m, nbinpdf.m, nbinrnd.m, normcdf.m,
norminv.m, normpdf.m, normrnd.m, poisscdf.m, poissinv.m, poisspdf.m,
poissrnd.m, stdnormal_cdf.m, stdnormal_inv.m, stdnormal_pdf.m, stdnormal_rnd.m,
tcdf.m, tinv.m, tpdf.m, trnd.m, unidcdf.m, unidinv.m, unidpdf.m, unidrnd.m,
unifcdf.m, unifinv.m, unifpdf.m, unifrnd.m, wblcdf.m, wblinv.m, wblpdf.m,
wblrnd.m, kolmogorov_smirnov_test.m, kruskal_wallis_test.m, base2dec.m,
bin2dec.m, blanks.m, cstrcat.m, deblank.m, dec2base.m, dec2bin.m, dec2hex.m,
findstr.m, hex2dec.m, index.m, isletter.m, mat2str.m, rindex.m, str2num.m,
strcat.m, strjust.m, strmatch.m, strsplit.m, strtok.m, strtrim.m, strtrunc.m,
substr.m, validatestring.m, demo.m, example.m, fail.m, speed.m, addtodate.m,
asctime.m, clock.m, ctime.m, date.m, datenum.m, datetick.m, datevec.m,
eomday.m, etime.m, is_leap_year.m, now.m:
Use Octave coding conventions in all m-file %!test blocks
author | Rik <octave@nomad.inbox5.com> |
---|---|
date | Mon, 13 Feb 2012 07:29:44 -0800 |
parents | 7277fe922e99 |
children | 7ce925166af6 |
line wrap: on
line source
## Copyright (C) 2000-2012 Paul Kienzle ## Copyright (C) 2009 VZLU Prague ## ## This file is part of Octave. ## ## Octave 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 3 of the License, or (at ## your option) any later version. ## ## Octave 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 Octave; see the file COPYING. If not, see ## <http://www.gnu.org/licenses/>. ## -*- texinfo -*- ## @deftypefn {Function File} {@var{yi} =} interp1 (@var{x}, @var{y}, @var{xi}) ## @deftypefnx {Function File} {@var{yi} =} interp1 (@var{y}, @var{xi}) ## @deftypefnx {Function File} {@var{yi} =} interp1 (@dots{}, @var{method}) ## @deftypefnx {Function File} {@var{yi} =} interp1 (@dots{}, @var{extrap}) ## @deftypefnx {Function File} {@var{pp} =} interp1 (@dots{}, "pp") ## ## One-dimensional interpolation. Interpolate @var{y}, defined at the ## points @var{x}, at the points @var{xi}. The sample points @var{x} ## must be monotonic. If not specified, @var{x} is taken to be the ## indices of @var{y}. If @var{y} is an array, treat the columns ## of @var{y} separately. ## ## Method is one of: ## ## @table @asis ## @item "nearest" ## Return the nearest neighbor. ## ## @item "linear" ## Linear interpolation from nearest neighbors ## ## @item "pchip" ## Piecewise cubic Hermite interpolating polynomial ## ## @item "cubic" ## Cubic interpolation (same as @code{pchip}) ## ## @item "spline" ## Cubic spline interpolation---smooth first and second derivatives ## throughout the curve ## @end table ## ## Appending '*' to the start of the above method forces @code{interp1} ## to assume that @var{x} is uniformly spaced, and only @code{@var{x} ## (1)} and @code{@var{x} (2)} are referenced. This is usually faster, ## and is never slower. The default method is "linear". ## ## If @var{extrap} is the string "extrap", then extrapolate values beyond ## the endpoints. If @var{extrap} is a number, replace values beyond the ## endpoints with that number. If @var{extrap} is missing, assume NA. ## ## If the string argument "pp" is specified, then @var{xi} should not be ## supplied and @code{interp1} returns the piecewise polynomial that ## can later be used with @code{ppval} to evaluate the interpolation. ## There is an equivalence, such that @code{ppval (interp1 (@var{x}, ## @var{y}, @var{method}, "pp"), @var{xi}) == interp1 (@var{x}, @var{y}, ## @var{xi}, @var{method}, "extrap")}. ## ## Duplicate points in @var{x} specify a discontinuous interpolant. There ## should be at most 2 consecutive points with the same value. ## The discontinuous interpolant is right-continuous if @var{x} is increasing, ## left-continuous if it is decreasing. ## Discontinuities are (currently) only allowed for "nearest" and "linear" ## methods; in all other cases, @var{x} must be strictly monotonic. ## ## An example of the use of @code{interp1} is ## ## @example ## @group ## xf = [0:0.05:10]; ## yf = sin (2*pi*xf/5); ## xp = [0:10]; ## yp = sin (2*pi*xp/5); ## lin = interp1 (xp, yp, xf); ## spl = interp1 (xp, yp, xf, "spline"); ## cub = interp1 (xp, yp, xf, "cubic"); ## near = interp1 (xp, yp, xf, "nearest"); ## plot (xf, yf, "r", xf, lin, "g", xf, spl, "b", ## xf, cub, "c", xf, near, "m", xp, yp, "r*"); ## legend ("original", "linear", "spline", "cubic", "nearest"); ## @end group ## @end example ## ## @seealso{interpft} ## @end deftypefn ## Author: Paul Kienzle ## Date: 2000-03-25 ## added 'nearest' as suggested by Kai Habel ## 2000-07-17 Paul Kienzle ## added '*' methods and matrix y ## check for proper table lengths ## 2002-01-23 Paul Kienzle ## fixed extrapolation function yi = interp1 (x, y, varargin) if (nargin < 2 || nargin > 6) print_usage (); endif method = "linear"; extrap = NA; xi = []; ispp = false; firstnumeric = true; if (nargin > 2) for i = 1:length (varargin) arg = varargin{i}; if (ischar (arg)) arg = tolower (arg); if (strcmp ("extrap", arg)) extrap = "extrap"; elseif (strcmp ("pp", arg)) ispp = true; else method = arg; endif else if (firstnumeric) xi = arg; firstnumeric = false; else extrap = arg; endif endif endfor endif if (isempty (xi) && firstnumeric && ! ispp) xi = y; y = x; x = 1:numel(y); endif ## reshape matrices for convenience x = x(:); nx = rows (x); szx = size (xi); if (isvector (y)) y = y(:); endif szy = size (y); y = y(:,:); [ny, nc] = size (y); xi = xi(:); ## determine sizes if (nx < 2 || ny < 2) error ("interp1: table too short"); endif ## check whether x is sorted; sort if not. if (! issorted (x, "either")) [x, p] = sort (x); y = y(p,:); endif starmethod = method(1) == "*"; if (starmethod) dx = x(2) - x(1); else jumps = x(1:nx-1) == x(2:nx); have_jumps = any (jumps); if (have_jumps) if (any (strcmp (method, {"nearest", "linear"}))) if (any (jumps(1:nx-2) & jumps(2:nx-1))) warning ("interp1: extra points in discontinuities"); endif else error ("interp1: discontinuities not supported for method %s", method); endif endif endif ## Proceed with interpolating by all methods. switch (method) case "nearest" pp = mkpp ([x(1); (x(1:nx-1)+x(2:nx))/2; x(nx)], shiftdim (y, 1), szy(2:end)); pp.orient = "first"; if (ispp) yi = pp; else yi = ppval (pp, reshape (xi, szx)); endif case "*nearest" pp = mkpp ([x(1), x(1)+[0.5:(nx-1)]*dx, x(nx)], shiftdim (y, 1), szy(2:end)); pp.orient = "first"; if (ispp) yi = pp; else yi = ppval(pp, reshape (xi, szx)); endif case "linear" dy = diff (y); dx = diff (x); dx = repmat (dx, [1 size(dy)(2:end)]); coefs = [(dy./dx).'(:), y(1:nx-1, :).'(:)]; xx = x; if (have_jumps) ## Omit zero-size intervals. coefs(jumps, :) = []; xx(jumps) = []; endif pp = mkpp (xx, coefs, szy(2:end)); pp.orient = "first"; if (ispp) yi = pp; else yi = ppval(pp, reshape (xi, szx)); endif case "*linear" dy = diff (y); coefs = [(dy/dx).'(:), y(1:nx-1, :).'(:)]; pp = mkpp (x, coefs, szy(2:end)); pp.orient = "first"; if (ispp) yi = pp; else yi = ppval(pp, reshape (xi, szx)); endif case {"pchip", "*pchip", "cubic", "*cubic"} if (nx == 2 || starmethod) x = linspace (x(1), x(nx), ny); endif if (ispp) y = shiftdim (reshape (y, szy), 1); yi = pchip (x, y); else y = shiftdim (y, 1); yi = pchip (x, y, reshape (xi, szx)); endif case {"spline", "*spline"} if (nx == 2 || starmethod) x = linspace(x(1), x(nx), ny); endif if (ispp) y = shiftdim (reshape (y, szy), 1); yi = spline (x, y); else y = shiftdim (y, 1); yi = spline (x, y, reshape (xi, szx)); endif otherwise error ("interp1: invalid method '%s'", method); endswitch if (! ispp) if (! ischar (extrap)) ## determine which values are out of range and set them to extrap, ## unless extrap == "extrap". minx = min (x(1), x(nx)); maxx = max (x(1), x(nx)); outliers = xi < minx | ! (xi <= maxx); # this catches even NaNs if (size_equal (outliers, yi)) yi(outliers) = extrap; yi = reshape (yi, szx); elseif (!isvector (yi)) if (strcmp (method, "pchip") || strcmp (method, "*pchip") ||strcmp (method, "cubic") || strcmp (method, "*cubic") ||strcmp (method, "spline") || strcmp (method, "*spline")) yi(:, outliers) = extrap; yi = shiftdim(yi, 1); else yi(outliers, :) = extrap; endif else yi(outliers.') = extrap; endif endif else yi.orient = "first"; endif endfunction %!demo %! clf; %! xf = 0:0.05:10; yf = sin (2*pi*xf/5); %! xp = 0:10; yp = sin (2*pi*xp/5); %! lin = interp1 (xp,yp,xf, "linear"); %! spl = interp1 (xp,yp,xf, "spline"); %! cub = interp1 (xp,yp,xf, "pchip"); %! near= interp1 (xp,yp,xf, "nearest"); %! plot (xf,yf,"r",xf,near,"g",xf,lin,"b",xf,cub,"c",xf,spl,"m",xp,yp,"r*"); %! legend ("original", "nearest", "linear", "pchip", "spline"); %! %-------------------------------------------------------- %! % confirm that interpolated function matches the original %!demo %! clf; %! xf = 0:0.05:10; yf = sin (2*pi*xf/5); %! xp = 0:10; yp = sin (2*pi*xp/5); %! lin = interp1 (xp,yp,xf, "*linear"); %! spl = interp1 (xp,yp,xf, "*spline"); %! cub = interp1 (xp,yp,xf, "*cubic"); %! near= interp1 (xp,yp,xf, "*nearest"); %! plot (xf,yf,"r",xf,near,"g",xf,lin,"b",xf,cub,"c",xf,spl,"m",xp,yp,"r*"); %! legend ("*original", "*nearest", "*linear", "*cubic", "*spline"); %! %-------------------------------------------------------- %! % confirm that interpolated function matches the original %!demo %! clf; %! t = 0 : 0.3 : pi; dt = t(2)-t(1); %! n = length (t); k = 100; dti = dt*n/k; %! ti = t(1) + [0 : k-1]*dti; %! y = sin (4*t + 0.3) .* cos (3*t - 0.1); %! ddyc = diff (diff (interp1 (t,y,ti, "cubic")) ./dti)./dti; %! ddys = diff (diff (interp1 (t,y,ti, "spline"))./dti)./dti; %! ddyp = diff (diff (interp1 (t,y,ti, "pchip")) ./dti)./dti; %! plot (ti(2:end-1),ddyc,'g+', ti(2:end-1),ddys,'b*', ti(2:end-1),ddyp,'c^'); %! legend ("cubic", "spline", "pchip"); %! title ("Second derivative of interpolated 'sin (4*t + 0.3) .* cos (3*t - 0.1)'"); %!demo %! clf; %! xf = 0:0.05:10; yf = sin (2*pi*xf/5) - (xf >= 5); %! xp = [0:.5:4.5,4.99,5:.5:10]; yp = sin (2*pi*xp/5) - (xp >= 5); %! lin = interp1 (xp,yp,xf, "linear"); %! near= interp1 (xp,yp,xf, "nearest"); %! plot (xf,yf,"r", xf,near,"g", xf,lin,"b", xp,yp,"r*"); %! legend ("original", "nearest", "linear"); %! %-------------------------------------------------------- %! % confirm that interpolated function matches the original ##FIXME: add test for n-d arguments here ## For each type of interpolated test, confirm that the interpolated ## value at the knots match the values at the knots. Points away ## from the knots are requested, but only "nearest" and "linear" ## confirm they are the correct values. %!shared xp, yp, xi, style %! xp = 0:2:10; %! yp = sin (2*pi*xp/5); %! xi = [-1, 0, 2.2, 4, 6.6, 10, 11]; ## The following BLOCK/ENDBLOCK section is repeated for each style ## nearest, linear, cubic, spline, pchip ## The test for ppval of cubic has looser tolerance, but otherwise ## the tests are identical. ## Note that the block checks style and *style; if you add more tests ## be sure to add them to both sections of each block. One test, ## style vs. *style, occurs only in the first section. ## There is an ENDBLOCKTEST after the final block %!test style = "nearest"; ## BLOCK %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) %!assert (interp1 (xp,[yp',yp'],xi,style), %! interp1 (xp,[yp',yp'],xi,["*",style]),100*eps) %!test style = ["*",style]; %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) ## ENDBLOCK %!test style = "linear"; ## BLOCK %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) %!assert (interp1 (xp,[yp',yp'],xi,style), %! interp1 (xp,[yp',yp'],xi,["*",style]),100*eps) %!test style = ['*',style]; %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) ## ENDBLOCK %!test style = "cubic"; ## BLOCK %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),100*eps) %!error interp1 (1,1,1, style) %!assert (interp1 (xp,[yp',yp'],xi,style), %! interp1 (xp,[yp',yp'],xi,["*",style]),100*eps) %!test style = ["*",style]; %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),100*eps) %!error interp1 (1,1,1, style) ## ENDBLOCK %!test style = "pchip"; ## BLOCK %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) %!assert (interp1 (xp,[yp',yp'],xi,style), %! interp1 (xp,[yp',yp'],xi,["*",style]),100*eps) %!test style = ["*",style]; %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) ## ENDBLOCK %!test style = "spline"; ## BLOCK %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) %!assert (interp1 (xp,[yp',yp'],xi,style), %! interp1 (xp,[yp',yp'],xi,["*",style]),100*eps) %!test style = ["*",style]; %!assert (interp1 (xp, yp, [min(xp)-1, max(xp)+1],style), [NA, NA]) %!assert (interp1 (xp,yp,xp,style), yp, 100*eps) %!assert (interp1 (xp,yp,xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp',style), yp', 100*eps) %!assert (interp1 (xp',yp',xp,style), yp, 100*eps) %!assert (isempty (interp1 (xp',yp',[],style))) %!assert (isempty (interp1 (xp,yp,[],style))) %!assert (interp1 (xp,[yp',yp'],xi(:),style),... %! [interp1(xp,yp,xi(:),style),interp1(xp,yp,xi(:),style)]) %!assert (interp1 (xp,yp,xi,style),... %! interp1 (fliplr (xp),fliplr (yp),xi,style),100*eps) %!assert (ppval (interp1 (xp,yp,style,"pp"),xi), %! interp1 (xp,yp,xi,style,"extrap"),10*eps) %!error interp1 (1,1,1, style) ## ENDBLOCK ## ENDBLOCKTEST %!# test linear extrapolation %!assert (interp1 ([1:5],[3:2:11],[0,6],"linear","extrap"), [1, 13], eps) %!assert (interp1 (xp, yp, [-1, max(xp)+1],"linear",5), [5, 5]) %!assert (interp1 (1:2,1:2,1.4,"nearest"), 1) %!assert (interp1 (1:2,1:2,1.4,"linear"), 1.4) %!assert (interp1 (1:4,1:4,1.4,"cubic"), 1.4) %!assert (interp1 (1:2,1:2,1.1, "spline"), 1.1) %!assert (interp1 (1:3,1:3,1.4,"spline"), 1.4) %!assert (interp1 (1:2:4,1:2:4,1.4,"*nearest"), 1) %!assert (interp1 (1:2:4,1:2:4,[0,1,1.4,3,4],"*linear"), [NA,1,1.4,3,NA]) %!assert (interp1 (1:2:8,1:2:8,1.4,"*cubic"), 1.4) %!assert (interp1 (1:2,1:2,1.3, "*spline"), 1.3) %!assert (interp1 (1:2:6,1:2:6,1.4,"*spline"), 1.4) %!assert (interp1 ([3,2,1],[3,2,2],2.5), 2.5) %!assert (interp1 ([1,2,2,3,4],[0,1,4,2,1],[-1,1.5,2,2.5,3.5], "linear", "extrap"), [-2,0.5,4,3,1.5]) %!assert (interp1 ([4,4,3,2,0],[0,1,4,2,1],[1.5,4,4.5], "linear"), [1.75,1,NA]) %!assert (interp1 (0:4, 2.5), 1.5) %!error interp1 () %!error interp1 (1,1,1, "linear") %!error interp1 (1,1,1, "*nearest") %!error interp1 (1,1,1, "*linear") %!error interp1 (1:2,1:2,1, "bogus")