A fast algorithm for computing Bell polynomials based on index break-downs using prime factorization
share
Establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some new properties and inverse relations of Bell polynomials, composition identities involving nested Bell polynomials and explicit expressions for convolution roots of general sequences are obtained. Based on these results, a new method is proposed for calculation of partial Bell polynomials based on prime factorization. It is shown that this method is more efficient than the conventional recurrence procedure for computing Bell polynomials in most cases, requiring far less arithmetic operations. A detailed analysis of the computation complexity is provided, followed by some numerical evaluations.
READ FULL TEXT