当前位置:网站首页>[combinatorics] recursive equation (constant coefficient linear homogeneous recursive equation | constant coefficient, linear, homogeneous concept description | constant coefficient linear homogeneous
[combinatorics] recursive equation (constant coefficient linear homogeneous recursive equation | constant coefficient, linear, homogeneous concept description | constant coefficient linear homogeneous
2022-07-03 16:48:00 【Programmer community】
List of articles
- One 、 Linear homogeneous recurrence equation with constant coefficients
- Two 、 Constant coefficient 、 linear 、 Homogeneous Concept description
- 3、 ... and 、 The formula solution of linear homogeneous recurrence equation with constant coefficients
- Four 、 Outline of the formula solution of linear homogeneous recurrence equation with constant coefficients
One 、 Linear homogeneous recurrence equation with constant coefficients
Linear homogeneous recurrence equation with constant coefficients :
{
H
(
n
)
−
a
1
H
(
n
−
1
)
−
a
2
H
(
n
−
2
)
−
⋯
−
a
k
H
(
n
−
k
)
=
0
H
(
0
)
=
b
0
,
H
(
1
)
=
b
1
,
H
(
2
)
=
b
2
,
⋯
,
H
(
k
)
=
b
k
\begin{cases} H(n) - a_1H(n-1) - a_2H(n-2) - \cdots - a_kH(n-k) = 0 \\\\ H(0) = b_0 , H(1) = b_1 , H(2) = b_2 , \cdots , H(k) = b_k \end{cases}
⎩⎪⎨⎪⎧H(n)−a1H(n−1)−a2H(n−2)−⋯−akH(n−k)=0H(0)=b0,H(1)=b1,H(2)=b2,⋯,H(k)=bk
Constant coefficient It refers to the sequence of numbers Before item coefficient
a
1
,
a
2
,
⋯
,
a
k
a_1 , a_2 , \cdots , a_k
a1,a2,⋯,ak It's all constant ,
a
k
≠
0
a_k \not=0
ak=0 ;
Homogeneous It refers to moving the sequence item to the left , The right term is equal to
0
0
0 ;
The above is called
k
k
k rank Linear homogeneous recurrence equation with constant coefficients ;
b
0
,
b
1
,
b
2
,
⋯
,
b
k
b_0 , b_1, b_2 , \cdots , b_k
b0,b1,b2,⋯,bk yes Recursive equation
k
k
k An initial value ;
Two 、 Constant coefficient 、 linear 、 Homogeneous Concept description
Constant coefficient 、 linear 、 Homogeneous Concept description :
1 . Constant coefficient concept : Constant coefficient refers to
T
(
n
)
,
T
(
n
−
1
)
T(n) , T(n-1)
T(n),T(n−1) these Coefficient before term , It's all constant , Such as
2
T
(
n
−
1
)
2 T(n-1)
2T(n−1) ,
T
(
n
−
1
)
T(n-1)
T(n−1) The coefficient before the term is constant
2
2
2 ;
The recurrence equation introduced in chestnut before , Such as
- Hanoi Tower recursive equation
T
(
n
)
=
2
T
(
n
−
1
)
+
1
T(n) =2 T(n-1) + 1
T(n)=2T(n−1)+1
- Insert sort recurrence equation
W
(
n
)
=
W
(
n
−
1
)
+
n
−
1
W(n) = W(n-1) + n-1
W(n)=W(n−1)+n−1
All are Constant coefficient linear recurrence equation , Not homogeneous ;
2 . Linear concept : The first
n
n
n Items are the previous items
n
−
1
n-1
n−1 Of A linear combination , There is no exponential relationship , So it becomes linear ;
3 . Homogeneous concept : stay
T
(
n
)
T(n)
T(n) There are no other elements besides the item , Only items , Above
T
(
n
)
=
2
T
(
n
−
1
)
+
1
T(n) =2 T(n-1) + 1
T(n)=2T(n−1)+1 There is a constant beyond the term
1
1
1 , The recursive equation is not homogeneous ; If change to
T
(
n
)
=
2
T
(
n
−
1
)
T(n) =2 T(n-1)
T(n)=2T(n−1) , The recursive equation is homogeneous ;
3、 ... and 、 The formula solution of linear homogeneous recurrence equation with constant coefficients
1 . Characteristic root 、 general solution 、 Special solution
Characteristic root : According to the original Recurrence equation , Find out Characteristic root ;
general solution : utilize Characteristic root , Write general solution ;
Special solution : according to general solution , Substitute into the initial value of the recursive equation , Get... For these initial values Special solution , That is, the solution of the sequence ,
2 . The relationship between general solution and special solution :
Recurrence equation and initial value : The dependence of recurrence equation , Recursive equations express more than one sequence , The recurrence equation is Express an infinite sequence of numbers with the same dependencies , Different initial values of recurrence equations , Corresponding to different series , Recurrence equation and The initial value can only determine a sequence ;
Recurrence equation 、 Understand the relationship : general solution It's actually a recursive equation Corresponding Infinite series The common solution of , and A sequence cannot be uniquely determined ;
Special solution 、 Sequence relation : Some undetermined coefficients of the general solution , It should be determined by the initial value , The general solution is substituted into the initial value , Got Special solution , To uniquely determine a given sequence ;
Four 、 Outline of the formula solution of linear homogeneous recurrence equation with constant coefficients
Outline of the solution of recurrence equation formula :
- Characteristic equation and characteristic root
- The relation between the solution of recurrence equation and characteristic root
- Linear properties of solutions
- General solution structure without multiple roots
- There is a general solution structure under double roots
边栏推荐
- 关于学习Qt编程的好书精品推荐
- Informatics Olympiad all in one YBT 1175: divide by 13 | openjudge noi 1.13 27: divide by 13
- 深入理解 SQL 中的 Grouping Sets 语句
- 美团一面:为什么线程崩溃崩溃不会导致 JVM 崩溃
- 8 cool visual charts to quickly write the visual analysis report that the boss likes to see
- IDEA-配置插件
- QT串口ui设计和解决显示中文乱码
- How programming apes grow rapidly
- 于文文、胡夏等明星带你玩转派对 皮皮APP点燃你的夏日
- 比亚迪、长城混动市场再“聚首”
猜你喜欢
![[combinatorics] non descending path problem (number of non descending paths with constraints)](/img/89/bd1a2ddd9632ab5d4b4bee9336be51.jpg)
[combinatorics] non descending path problem (number of non descending paths with constraints)

Mysql database DDL and DML

What is the pledge pool and how to pledge?

Mysql 单表字段重复数据取最新一条sql语句

What is the difference between 14Cr1MoR container plate and 14Cr1MoR (H)? Chemical composition and performance analysis of 14Cr1MoR

QT serial port UI design and solution to display Chinese garbled code

Learn from me about the enterprise flutter project: simplified framework demo reference

CC2530 common registers for port interrupts
![[combinatorics] polynomial theorem (polynomial theorem | polynomial theorem proof | polynomial theorem inference 1 item number is the number of non negative integer solutions | polynomial theorem infe](/img/9d/6118b699c0d90810638f9b08d4f80a.jpg)
[combinatorics] polynomial theorem (polynomial theorem | polynomial theorem proof | polynomial theorem inference 1 item number is the number of non negative integer solutions | polynomial theorem infe

斑马识别成狗,AI犯错的原因被斯坦福找到了
随机推荐
Nifi from introduction to practice (nanny level tutorial) - flow
Hands on in-depth learning notes (XIV) 3.7 Simple implementation of softmax regression
【LeetCode】94. Middle order traversal of binary tree
[combinatorics] polynomial theorem (polynomial coefficients | full arrangement of multiple sets | number of schemes corresponding to the ball sub model | polynomial coefficient correlation identity)
Is it safe to open a stock account by mobile registration? Does it need money to open an account
RF Analyze Demo搭建 Step by Step
MySQL user management
Extraction of the same pointcut
CC2530 common registers for ADC single channel conversion
JSON 与 BSON 区别
mysql用户管理
[solved] access denied for user 'root' @ 'localhost' (using password: yes)
网络安全web渗透技术
PHP production website active push (website)
QT串口ui设计和解决显示中文乱码
What material is sa537cl2? Analysis of mechanical properties of American standard container plate
一台服务器最大并发 tcp 连接数多少?65535?
香港理工大学|数据高效的强化学习和网络流量动态的自适应最优周界控制
Data driving of appium framework for mobile terminal automated testing
【剑指 Offer】58 - I. 翻转单词顺序