Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Find the solution of the recurrence relation an=3an-1-3an-2+an-3+1ifa0=2,a1=4anda2=8

Short Answer

Expert verified

The solution is

an=α1+α2n+α3n2+16n3=2+4n3+n22+n36

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data

We have given,

an=3an-1-3an-2+an-3+1a0=2a1=4a2=8

02

Definition

The equation is said to be linear homogeneous difference equation if and only if R(n)=0and it will be of order n.

The equation is said to be linear non-homogeneous difference equation if R(n)0

03

SOLUTION HOMOGENEOUS RECURRENCE RELATION

Given:

an=3an-1-3an-2+an-3+1a0=2a1=4a2=8

Let,

an=r3,an-1=r2,an-2=ran-3=1(Let any other terms be zero)

r3=3r2-3r+1Characteristicequationr3-3r2+3r-1=0(r-1)3=3±(-3)2-4(1)(-2)2(a-b)3=a3-3a2b+3ab2+b3r-1=0Zeroproductpropertyr=0withmultiplicity3

The solution of the recurrence relation is of the form an=α1r1n+α2nr1n++αknk-1r1nwith r1aroot with multiplicitykof the characteristic equation.

an(h)=α1·1n+α2·n·1n+α3·n2·1n=α1+α2n+α3n2F(n)=1=1·1n

If F(n)=btnt+bt-1nt-1++b1n+b0snand sisaroot of the characteristic equation with multiplicity mthennmptnt+pt-1nt-1++p1the particular solution.

an(p)=p0·n3·1n=p0n3

The particular solution needs to satisfy the recurrence relation:

an=3an-1-3an-2+an-3+1p0n3=3p0(n-1)3-3p0(n-2)3+p0(n-3)3+1(a-b)3=a3-3a2b+ab2-b3

p0n3=3p0n3-3n2+3n-1-3p0n3-6n2+12n-8+p0n3-9n2+27n-27+1

Combine like terms

0=-6p0+1-1=-6p016=p0

Thus, the particular solution then becomes:

an(p)=p0n3=16n3

04

SOLUTION NON-HOMOGENEOUS RECURRENCE RELATION

The solution of the non-homogeneous recurrence relation is the sum of the solution of the homogeneous recurrence relation and the lution:

an=an(h)+an(h)=α1+α2n+α3n2+16n3

Use initial conditions:

2=a0=α14=a1=α1+α2+α3+168=a2=α1+2α3+4α3+43

Use α1=2in the other equations

4=2+α2+α3+168=2+2α3+4α3+43

Subtract136from each side of the first equation

Subtract 103from each side of the second equation

116=α2+α3143=2α3+4α3

Multiply the first equation by 2

113=2α2+2α3143=2α3+4α3

Subtract the two equations

1=2α312=α3

Determine α2

α2=116-α3=116-12=43

Hence, the solution is

an=α1+α2n+α3n2+16n3=2+4n3+n22+n36

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

For each of these generating functions, provide a closed formula for the sequence it determines.

a) \({(3x - 4)^3}\)

b) \({\left( {{x^3} + 1} \right)^3}\)

c) \(1/(1 - 5x)\)

d) \({x^3}/(1 + 3x)\)

e) \({x^2} + 3x + 7 + \left( {1/\left( {1 - {x^2}} \right)} \right)\)

f) \(\left( {{x^4}/\left( {1 - {x^4}} \right)} \right) - {x^3} - {x^2} - x - 1\)

g) \({x^2}/{(1 - x)^2}\)

h) \(2{e^{2x}}\)

Find the coefficient of \({x^{10}}\) in the power series of each of these functions.

a) \(1/(1 - 2x)\)

b) \(1/{(1 + x)^2}\)

c) \(1/{(1 - x)^3}\)

d) \(1/{(1 + 2x)^4}\)

e) \({x^4}/{(1 - 3x)^3}\)

Find a closed form for the generating function for each of these sequences. (For each sequence, use the most obvious choice of a sequence that follows the pattern of the initial terms listed.)

a) \(0,2,2,2,2,2,2,0,0,0,0,0, \ldots \)

b) \(0,0,0,1,1,1,1,1,1, \ldots \)

c) \(0,1,0,0,1,0,0,1,0,0,1, \ldots \)

d) \(2,4,8,16,32,64,128,256, \ldots \)

e) \(\left( {\begin{array}{*{20}{l}}7\\0\end{array}} \right),\left( {\begin{array}{*{20}{l}}7\\1\end{array}} \right),\left( {\begin{array}{*{20}{l}}7\\2\end{array}} \right), \ldots ,\left( {\begin{array}{*{20}{l}}7\\7\end{array}} \right),0,0,0,0,0, \ldots \)

f) \(2, - 2,2, - 2,2, - 2,2, - 2, \ldots \)

g) \(1,1,0,1,1,1,1,1,1,1, \ldots \)

h) \(0,0,0,1,2,3,4, \ldots \)

Apply the algorithm described in the Example 12for finding the closest pair of points, using the Euclidean distance between points, to find the closest pair of the points(1,3),(1,7),(2,4),(2,9),(3,1),(3,5),(4,3)and (4,7).

How many comparisons are needed to locate the maximum and minimum elements in a sequence with 128 elements using the algorithm in Example 2?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free