Am 21.01.2016 um 16:10 schrieb Allin Cottrell:
Your example shows that recursion is a _lot_ faster in julia; so now
we
want a case where recursion is actually needed.
One more thought on this: What about the "omit --auto" command? I guess
this could be viewed as something that is done recursively, like this in
pseudo code:
function <reduced-equation> omit_one_by_one(<estimated-equation>)
if min(<signif>) < threshold
eliminate(coeff_where_min(<signif>))
omit_one_by_one(<equ_reduced_by_one>)
else
return <estimated-equation>
endif
end function
If somebody is already proficient enough in Julia (or some other
JIT-compiled language), I think it would be interesting to compare the
speed to gretl's performance there.
thanks,
sven