摘要
指母函数是求解不尽相异元素r可重排列问题的有效方法,当求出对应问题的指母函数后,指母函数中各xr项的系数的规范化就成了问题求解的关键.若采用一般的系数规范化算法必须做求n!的运算,当n值增大时,不仅计算量大而且会出现很大的误差,为此提出一种分母消化系数规范化算法,该算法避免了求n!的运算,能快速实现复杂排列指母函数中各xr项系数的规范化,并用C++语言实现了算法的程序设计,程序运行结果验证了算法的正确性和普适性.
Solving R-reusable permutation of inexactly distinct elements with exponential generating functions is quite effectual. After obtaining the exponential generating function for that issue, the normalization of coefficients of every x＇ in the exponential generating function becomes the key question. Computational Complexity of general method is very high and it will be easy to generate bigger error because of computing the value of hi. Therefore this paper has put forward a kind of normalization algorithm of coefficient based on denominator digestion. It doesn＇t compute the value of n! and can quickly implement normalization of every x＇ in the exponential generating function. The algorithm is programmed by C＋＋. The result of the program illustrates correctness and applicability of the algorithm.
出处
《小型微型计算机系统》
CSCD
北大核心
2008年第12期2301-2304,共4页
Journal of Chinese Computer Systems
基金
天津市自然科学基金(07JCYBJC14800)资助
关键词
指母函数
不尽相异元素
r可重排列
分母消化
系数规范化
exponential generating function
inexactly distinct elements
r-reusable permutation
denominator digestion
normalization of coefficient
