请输入您要查询的字词:

 

单词 LinearRecurrence
释义

linear recurrence


A sequenceMathworldPlanetmath x0,x1,, is said to satisfy a general linear recurrence if there are constants an,i and fn such that

xn=i=1nan,ixn-i+fn

The sequence {fn} is called the non-homogeneous partof the recurrence.

If fn=0 for all n then the recurrence is said to be homogeneousPlanetmathPlanetmath.

In this case if x and x are two solutions to the recurrence,and A and B are constants, then Ax+Bx are also solutions.

If an,i=ai for all i then the recurrence is calleda linear recurrence with constant coefficients. Such a recurrencewith an,i=0 for all i>k and ak0 is said to be offinite order and the smallest such integer k is called theorder of the recurrence. If no such k exists, the recurrence issaid to be of infinite order.

For example, the Fibonacci sequenceMathworldPlanetmath is a linear recurrence with constant coefficients and order 2.

Now suppose that x={xn} satisfies a homogeneous linear recurrence offinite order k. The polynomialPlanetmathPlanetmathFx=uk-a1uk-1--ak is called the companion polynomialof x.If we assume that the coefficients ai come from a field K we canwrite

Fx=(u-u1)e1(u-ut)et

where u1,,ut are the distinct roots of Fx in somesplitting fieldMathworldPlanetmath of Fx containing K and e1,,et arepositive integers.A theorem about such recurrence relations is that

xn=i=1tgi(n)uin

for some polynomials gi in K[X] where deg(gi)<ei.

Now suppose further that all K= and

let U be the largest value of the |ui|.

It follows that if U>1 then

|xn|CUn

for some constant C.

(to be continued)

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 22:51:03