in Combinatory edited by
843 views
1 vote
1 vote
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2
is this the case of repetitive roots?
in Combinatory edited by
by
843 views

4 Comments

simply, $(\alpha - (-2))^{2}(\alpha -2)^{2} = 0$
1
1
sorry
i meant the solution of the recurrence relation with co-efficient and root
0
0

@aditi19

how one can find out the solution without knowing recurrence relation,  base conditions and whether it is homogeneous or non-homogeneous ?? 

0
0
i'm asking for the equation with co-efficients and root
for example

if the roots are 2 and 3 then the equation will be A*2^n+B*3^n

 and it the roots are 2 and 2 then the equation will be A*2^n+B*n*2^n
0
0

2 Answers

1 vote
1 vote
Yes, this is a case of repetitive roots because the roots r1=-2 and r3=-2 are repeated, and the roots r2=2 and r4=2 are also repeated. When a characteristic equation has repetitive roots, the solution to the corresponding homogeneous linear recurrence relation has an additional term that includes a polynomial factor of the corresponding root.

To find the solution of the recurrence relation with these roots, we can write it in the form:

a(n) = c1 * (-2)^n + c2 * n * (-2)^n + c3 * 2^n + c4 * n * 2^n

where c1, c2, c3, and c4 are constants that depend on the initial conditions of the recurrence relation.

To find the values of the constants, we need to use the initial conditions. Let's assume that the initial values of the sequence are a0, a1, a2, and a3. Then, we have:

a0 = c1 + c3 a1 = -2c1 - 2c2 + 2c3 + 2c4 a2 = 4c1 + 8c2 + 4c3 + 16c4 a3 = -8c1 - 24c2 + 8c3 + 48c4

Solving this system of linear equations for c1, c2, c3, and c4, we get:

c1 = (a0 + 2a1 + a2 - 2a3) / 16 c2 = (a3 - a2 - 4c1) / 16 c3 = (a0 - c1) c4 = (a1 - 2c1 - 2c2 - 2c3) / 4

Substituting these values into the equation for a(n), we get the solution to the recurrence relation:

a(n) = [(a0 + 2a1 + a2 - 2a3) / 16] * (-2)^n + [(a3 - a2 - 4[(a0 + 2a1 + a2 - 2a3) / 16]) / 16] * n * (-2)^n + (a0 - [(a0 + 2a1 + a2 - 2a3) / 16]) * 2^n + [(a1 - 2[(a0 + 2a1 + a2 - 2a3) / 16] - 2[(a3 - a2 - 4[(a0 + 2a1 + a2 - 2a3) / 16]) / 16] - (a0 - [(a0 + 2a1 + a2 - 2a3) / 16])) / 4] * n * 2^n

So, the solution to the recurrence relation with repetitive roots r1=-2, r2=2, r3=-2, r4=2 is:

a(n) = [(a0 + 2a1 + a2 - 2a3) / 16] * (-2)^n + [(a3 - a2 - 4[(a0 + 2a1 + a2 - 2a3) / 16]) / 16] * n * (-2)^n + (a0 - [(a0 + 2a1 + a2 - 2a3) / 16]) * 2^n + [(a1 - 2[(a0 + 2a1
0 votes
0 votes
if root 2 is repeated for 2 times then A.2^n+B.n.2^n
like that for root = -2

2 Comments

can u give the whole expression?
0
0
0
0

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true