Mercurial > octave-nkf
view test/recursion.tst @ 20485:b3f56ed8d1f9
poissinv.m: Overhaul function for accuracy and performance (bug #34363).
* poissinv.m: Eliminate while(1) loop which may never terminate. Subsitute for
loop with limit of 20. If solution has not converged, use Mike Gile's
analytic_approx routine to finish calculating a solution. Introduce special
case for scalar lambda which speeds up calculation 6X.
author | Lachlan Andrew <lachlanbis@gmail.com> |
---|---|
date | Tue, 18 Aug 2015 11:35:23 -0700 |
parents | 4197fc428c7d |
children |
line wrap: on
line source
## Copyright (C) 2006-2015 John W. Eaton ## ## 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/>. %!function y = f (x) %! if (x == 1) %! y = x; %! return; %! else %! y = x * f (x-1); %! endif %!endfunction %! %!assert (f (5), 120) %!function y = f (x) %! if (x == 1) %! y = x; %! return; %! else %! y = f (x-1) * x; %! endif %!endfunction %! %!assert (f (5), 120) %%FIXME: Need test for maximum recursion depth