%0 Journal Article
%T Solutions to the recurrence relation u n+1 = v n+1 + u n £¿ v n in terms of Bell polynomials
%A Withers
%A Christopher S.
%A Nadarajah
%A Saralees
%J Computational & Applied Mathematics
%D 2011
%I Scientific Electronic Library Online
%R 10.1590/S1807-03022011000300007
%X motivated by time series analysis, we consider the problem of solving the recurrence relation un+1 = vn+1 +un£¿vn for n ¡Ù 0 and un, given the sequence vn. a solution is given as a bell polynomial. when vn can be written as a weighted sum of nth powers, then the solution un also takes this form. mathematical subject classification: 33e99.
%K autoregressive processes
%K bell polynomials
%K convolution
%K maximum.
%U http://www.scielo.br/scielo.php?script=sci_abstract&pid=S1807-03022011000300007&lng=en&nrm=iso&tlng=en