Publisher review:Bell Polynomials of the Second Kind - Recursive algorithm for computing Bell polynomials of the second kind Given a list of input values (x_{1},x_{2},...,x_{N}), the script returns a matrix of Bell polynomials B_{n,k} for n=0,...,N and k=0,...,K.Syntax:OutMatrix = IncompleteBellPoly(Nin,Kin,DataList)where B_{n,k} = OutMatrix(n 1,k 1)n=0,...,Nink=0,...,Kin (Kin1B_{0,k} = 0; for k=>1The coefficients can be stored in a lower triangular matrix. The elements of the kth column are the Taylor coefficients of the kth derivative of g(t)/k!.In application, the polynomials arise in multiple contexts in combinatorics. They also can be found in Riordan's formulation of di Bruno's formula for computing an arbitrary order derivative of the composition of two functionsfrac{d^{n}}{dt^{n}} g(f(t)) = sum_{k=0}^{n} g^{k}(f(t)) B_{n,k}(f^{1}(t),f^{2}(t),...,f^{n-k 1}(t))Script Check:If DataList=1 for all entries, B_{n,k} = S(n,k) = Stirling number of the second kind for (n,k)Failure Return:OutMatrix is undefined if the code fails. An error statement is issued and the function exits. Requirements: ยท MATLAB Release: R2006b
Bell Polynomials of the Second Kind is a Matlab script for Mathematics scripts design by Moysey Brio.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Operating system:Windows / Linux / Mac OS / BSD / Solaris