/usr/share/octave/packages/interval-2.1.0/@infsupdec/polyval.m is in octave-interval 2.1.0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 | ## Copyright 2015-2016 Oliver Heimlich
##
## 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 3 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, see <http://www.gnu.org/licenses/>.
## -*- texinfo -*-
## @documentencoding UTF-8
## @defmethod {@@infsupdec} polyval (@var{P}, @var{X})
##
## Evaluate polynomial @var{P} with argument @var{X}.
##
## Horner's scheme is used to evaluate a first approximation. The result is
## improved with iterative refinement.
##
## Accuracy: The result is a tight enclosure for polynomials of degree 1 or
## less. For polynomials of higher degree the result is a valid enclosure.
## For @var{X} being no singleton interval, the algorithm suffers from the
## dependency problem.
##
## @example
## @group
## output_precision (16, 'local')
## polyval (infsupdec ([3 4 2 1]), 42) # 3x^3 + 4x^2 + 2x^1 + 1 | x = 42
## @result{} [229405]_com
## polyval (infsupdec ([3 4 2 1]), "42?") # ... | x = 41.5 .. 42.5
## @result{} [221393.125, 237607.875]_com
## @end group
## @end example
## @seealso{@@infsup/fzero}
## @end defmethod
## Author: Oliver Heimlich
## Keywords: interval
## Created: 2015-05-30
function result = polyval (p, x)
if (nargin ~= 2)
print_usage ();
return
endif
if (not (isa (x, "infsupdec")))
x = infsupdec (x);
endif
if (not (isa (p, "infsupdec")))
p = infsupdec (p);
endif
result = newdec (polyval (p.infsup, x.infsup));
result.dec = min (result.dec, min (min (p.dec), x.dec));
endfunction
%!assert (isequal (polyval (infsupdec (3, "trv"), 0), infsupdec (3, "trv")));
|