Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
Example 3. Let fr (1) =12k+1, ke No. (3.10) Then Dft =R and system (2.49) becomes 2k+1 + 'n-2 (ax + by) *, ne No. (3.11) 2k+1 Yn-2 2k+1 2k+1 Xn+1 = > Yn+1 = Here we can also assume that parameters a, b and initial values x-2, x-1, xo, y–2, y–1, yo are complex numbers, since function (3.10) is "1 – 1" on Df = C. Function (3.10) is an involution: f'(1) =1, tE Dp- We see that (2.59) and (2.60) hold. Using (3.10) in (2.59) and (2.60), we obtain the general solution to system (3.11): ( Jn+1+Jn+1 fx (xo) + Int1-Ja+1 fi (y0)+n+2+/a+2 fx (x=1) Xn = 2 2 )د ه )- + Jn- J Jn 1)+b: 2 2 2 Jn+1+Jn+12k+1 In+1 - Jn+1,2k+ 2k+1 2 2 2 چر ہ Jn+2-Jn+2 2k+1+ + Jn+J Jn-J +b" 24+1 Y-2 (3.12) 2 2 2 for n >-2, Jn+2-Jn+2 f Yn = f" (- )د )(ه ) a + (Jnt! In+1+Jht1 fx (xo) + 2 fR (yo)+ 2 2 Jn :-2)+b- 2 2 ( Jnt1 -Jn+12k+1 2k+1 %3D 2 2 2 ,)پی و ر + Ja+2+Jn+2 ,2k+! +b Jn-J Jn+J, +b- (3.13) 2 2 for n >-2.

Example 3. Let fr (1) =12k+1, ke No. (3.10) Then Dft =R and system (2.49) becomes 2k+1 + 'n-2 (ax + by) *, ne No. (3.11) 2k+1 Yn-2 2k+1 2k+1 Xn+1 = > Yn+1 = Here we can also assume that parameters a, b and initial values x-2, x-1, xo, y–2, y–1, yo are complex numbers, since function (3.10) is "1 – 1" on Df = C. Function (3.10) is an involution: f'(1) =1, tE Dp- We see that (2.59) and (2.60) hold. Using (3.10) in (2.59) and (2.60), we obtain the general solution to system (3.11): ( Jn+1+Jn+1 fx (xo) + Int1-Ja+1 fi (y0)+n+2+/a+2 fx (x=1) Xn = 2 2 )د ه )- + Jn- J Jn 1)+b: 2 2 2 Jn+1+Jn+12k+1 In+1 - Jn+1,2k+ 2k+1 2 2 2 چر ہ Jn+2-Jn+2 2k+1+ + Jn+J Jn-J +b" 24+1 Y-2 (3.12) 2 2 2 for n >-2, Jn+2-Jn+2 f Yn = f" (- )د )(ه ) a + (Jnt! In+1+Jht1 fx (xo) + 2 fR (yo)+ 2 2 Jn :-2)+b- 2 2 ( Jnt1 -Jn+12k+1 2k+1 %3D 2 2 2 ,)پی و ر + Ja+2+Jn+2 ,2k+! +b Jn-J Jn+J, +b- (3.13) 2 2 for n >-2.

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question

Show me the determine blue and all information here

2.7. Case 7: Pn= Yn, 9n = Xn, rn =Xn, Sn = Yn In this case, system (1.8) is expressed as Xn+1 =f"(af (Ya-1)+bf (xn-2)), Yn+l =f (af (xn-1)+bf(Ya-2)), (2.49) for n E No. Since f is "1 – 1", from (2.49) S(Kn+1) = af (yn-1)+bf (xn-2), f(Yn+1) = af (xa-1)+bf (Yn-2), (2.50) for n E No. By using the change of variables f(xn)= Un, and f(Yn) = vn, n2-2, (2.51) system (2.50) is transformed to the following one Hatl = av-1+ bun-2, Va+l = au,-1+bv-2, nE No. (2.52) By summing the equations in (2.52) we get Ma+1+ Va+l =a(Mm-1+Vn=1)+b(un-2+Vn-2), nɛ No, (2.53) whereas by subtracting the second one from the first, we have Ma+1- Va+l =-a(un-1 – Vn-1)+b(Un-2- Va-2), ne No. (2.54) From (2.5), we can write the solution of equation (2.53) as H,+va = (40+ vo) n+1+(u-1+v-1)Ja+2+b(u_2+v-2) Jn for n>-2. On the other hand, by taking a=0, b=-a, c=bin (1.4) and S,=J+ for all n> -2, which is called generalized Padovan sequence, in (1.5), from (2.54), we also have that (2.55) Hn - V = (40 – vo) + (4-1 – v-1)+2+b(u-2- v-2)S., (2.56) for n2-2. By summing the equations (2.55) and (2.56) we get Ja+itati uot Vo+ Ja+2-J+2 2 J.-y-2, n2-2. 2 u-2+b- (2.57) By subtracting equation (2.56) from equation (2.55), we have uo+ 2 vo+ 2 2 Ja+2+S+2, y+b -2+bv-2, n2 -2. (2.58) 2 2 From (2.51), (2.57) and (2.58) and after some calculation, we obtain 2 2 n2-2, (2.59) and ( Jutl-Jntl f(x0)+ Ja+1+Jatl f(yo) Yn =f- 2 2 Jn+2-J+2 + f(x-1)+ 2 Jn+2+J+2 2 n2-2. (2.60) 2 2 Example 3. Let fi (t) = 12k+1, ke No. (3.10) Then Df =R and system (2.49) becomes + bx) , Yn+1 = (axt +by1) T 2k+1 2k+1 Xn+l = • nE No. (3.11) Here we can also assume that parameters a, b and initial values x-2, x-1, X0, y–2, y-1, yo are complex numbers, since function (3.10) is "“1 – 1" on Df = C. Function (3.10) is an involution: We see that (2.59) and (2.60) hold. Using (3.10) in (2.59) and (2.60), we obtain the general solution to system (3.11): ( Jn+l+ Jn+l fx (xo) + Jn+1-Jn+l fx (yo) + Jn+2+J+2 fR (x-1) Xn = fk 2 + 2 پر ر2(- ,)پیوو و ر 1n، (In+1+Jn+12k+1, In+l - Jh+12k+1_ In+2+Jn+2 2k+1 2 Jn+2- Jn+2,2k+1 Jn+J „2k+1 2 Jn- J +b Y-2 2k+1 (3.12) 2 2 for n> -2, ( Jn+1– Ju+1 fr (xo) + Jn+2- Jntl+Jn+! f (yo) + Yn = f'( 2 (oشه )و ). ا Jn+ +b 2 2 ( Jn+1-Jn+1,2k+1 Jn+l +J+1.2k+1 , In+2 - Jn- 2 2 2+J. Jn-J. Jn+J. +b +b- (3.13) 2 for n> -2.
Transcribed Image Text:2.7. Case 7: Pn= Yn, 9n = Xn, rn =Xn, Sn = Yn In this case, system (1.8) is expressed as Xn+1 =f"(af (Ya-1)+bf (xn-2)), Yn+l =f (af (xn-1)+bf(Ya-2)), (2.49) for n E No. Since f is "1 – 1", from (2.49) S(Kn+1) = af (yn-1)+bf (xn-2), f(Yn+1) = af (xa-1)+bf (Yn-2), (2.50) for n E No. By using the change of variables f(xn)= Un, and f(Yn) = vn, n2-2, (2.51) system (2.50) is transformed to the following one Hatl = av-1+ bun-2, Va+l = au,-1+bv-2, nE No. (2.52) By summing the equations in (2.52) we get Ma+1+ Va+l =a(Mm-1+Vn=1)+b(un-2+Vn-2), nɛ No, (2.53) whereas by subtracting the second one from the first, we have Ma+1- Va+l =-a(un-1 – Vn-1)+b(Un-2- Va-2), ne No. (2.54) From (2.5), we can write the solution of equation (2.53) as H,+va = (40+ vo) n+1+(u-1+v-1)Ja+2+b(u_2+v-2) Jn for n>-2. On the other hand, by taking a=0, b=-a, c=bin (1.4) and S,=J+ for all n> -2, which is called generalized Padovan sequence, in (1.5), from (2.54), we also have that (2.55) Hn - V = (40 – vo) + (4-1 – v-1)+2+b(u-2- v-2)S., (2.56) for n2-2. By summing the equations (2.55) and (2.56) we get Ja+itati uot Vo+ Ja+2-J+2 2 J.-y-2, n2-2. 2 u-2+b- (2.57) By subtracting equation (2.56) from equation (2.55), we have uo+ 2 vo+ 2 2 Ja+2+S+2, y+b -2+bv-2, n2 -2. (2.58) 2 2 From (2.51), (2.57) and (2.58) and after some calculation, we obtain 2 2 n2-2, (2.59) and ( Jutl-Jntl f(x0)+ Ja+1+Jatl f(yo) Yn =f- 2 2 Jn+2-J+2 + f(x-1)+ 2 Jn+2+J+2 2 n2-2. (2.60) 2 2 Example 3. Let fi (t) = 12k+1, ke No. (3.10) Then Df =R and system (2.49) becomes + bx) , Yn+1 = (axt +by1) T 2k+1 2k+1 Xn+l = • nE No. (3.11) Here we can also assume that parameters a, b and initial values x-2, x-1, X0, y–2, y-1, yo are complex numbers, since function (3.10) is "“1 – 1" on Df = C. Function (3.10) is an involution: We see that (2.59) and (2.60) hold. Using (3.10) in (2.59) and (2.60), we obtain the general solution to system (3.11): ( Jn+l+ Jn+l fx (xo) + Jn+1-Jn+l fx (yo) + Jn+2+J+2 fR (x-1) Xn = fk 2 + 2 پر ر2(- ,)پیوو و ر 1n، (In+1+Jn+12k+1, In+l - Jh+12k+1_ In+2+Jn+2 2k+1 2 Jn+2- Jn+2,2k+1 Jn+J „2k+1 2 Jn- J +b Y-2 2k+1 (3.12) 2 2 for n> -2, ( Jn+1– Ju+1 fr (xo) + Jn+2- Jntl+Jn+! f (yo) + Yn = f'( 2 (oشه )و ). ا Jn+ +b 2 2 ( Jn+1-Jn+1,2k+1 Jn+l +J+1.2k+1 , In+2 - Jn- 2 2 2+J. Jn-J. Jn+J. +b +b- (3.13) 2 for n> -2.
constant coefficients Xn+1 = axn+bxn-1+cxn-2, nE No, (1.4) which has actually the general solution X = xoSn+x-1 (Sn+1 - aSn) +cx_2Sn-1, nE No, (1.5) where (S.) of equation (1L4) satisfving the initial values S 2=S-=0, So= L. The equation axn-IXn-k Xn+1 = nE No, (1.1) bxn-p±cxn-q' where the initial conditions are arbitrary positive real numbers, k, 1, p, q are non- negative integers and a, b, c are positive constants, is one of the difference equations whose solutions are associated with number sequences. Positive solutions of concrete Motivated by this line of investigations, here we show that the systems of differ- ence equations Xn+l =f'(af (Pn-1)+bf(qn-2)), Yntl =f"(af (ra-1)+bf (Sn-2)), (1.8) for n E No, where the sequences Pn, qn, Tn and Sn are some of the sequences x, and Yn, f: Df R is a "1– 1" continuous function on its domain Dr C R, the initial values x-j, y-j, je {0,1,2} are arbitrary real numbers and the parameters and a, b 2.6. Case 6: Pn = Yn, qn = yn, rn = Xn, Sn = Xn In this case, we obtain the system Xn+1 =5"(af (Yn-1)+bf (Yn-2)), Yn+1 = '(af (xn-1)+bf (xn-2)), (2.29) for n e No. Since f is "1– 1", from (2.29) f (Xn+1) = af (Yn-1)+bf (yn-2), f(yn+l) = af (Xn-1) +bf (xn-2), (2.30) for n E No. By using the change of variables f (xn) = = Un, and f(yn) = Vn, n>-2, (2.31) system (2.30) is transformed to the following one Un+l = avn-1+bvn-2, Vn+1 = aun-1+ bun-2, nE No. (2.32) By summing the equations in (2.32) we get Un+l +Vn+l = a (un-1+ Vn-1) +b(un-2+Vn-2), nE No, (2.33) whereas by subtracting the second one from the first, we have Un+l - Vn+l = -a(un-1 - Vn-1) -6(un-2- Vn-2), ne No. (2.34) | In this section, we consider the eight special cases of systems (1.8), where the sequences Pn, qn, ľn, Sn are some of the sequences xn and yn, for n>-2, and initial values x-j, y-j, j e {0,1,2}, are arbitrary real numbers. 2.1 Case 1: Pn =xn, qn = Xn, ľn = yn, Sn == yn In this case, system (1.8) is expressed as Xn+1 =f (af (xn-1)+bf (xn-2)), Yn+1 =f(af (Vn-1)+bf (Yn-2)), (2.1) for n E No. Since f is "1– 1", from (2.1) f (Xn+1) = af (x,-1)+bf (xn-2), f (Yn+1) = af (yn-1)+bf (yn–2), (2.2) for n E No. By using the change of variables f (xn) = Un, and f(yn) = = Vn, n> -2, (2.3) system (2.2) is transformed to the following one Un+1 = au,-1+bun-2, Vn+1 = avn-1+bvn-2, (2.4) for n E No. By taking a = 0, b= a, c = b in (1.4) and S = Jn+1, for all n > -2, which is called generalized Padovan sequence, in (1.5), the solutions to equations in (2.4) are given by Un = ugJn+1+u-1Jn+2+ bu_2Jn, (2.5) Vn = voJn+1+v_1Jn+2+bv_2Jn, (2.6) for n E No. From (2.3), (2.5) and (2.6), it follows that the general solution to system (2.2) is given by Xn = f(f (x0) Jn+1+f (x-1) Jn+2+bf (x-2)Jn), n> -2, Yn =f(f (vo) Jn+1+f(y-1)Ja+2+bf (y-2) J.), n> -2. (2.7) (2.8) 2.2. Case 2: Pn = Xn, qn = Xn, ľn = Xn, Sn Xn In this case, system (1.8) becomes Xp+1 =f"(af (x,-1)+bf (xp-2)), Yn+1=f"(af (xn-1)+bf (xn-2)), (2.9) for n e No. It should be first note that from the equations in (2.9) it immediately follows that x, = yn, for all n E N. From (2.7), the general solution to system (2.9) is %3D X, = Ya = f'(f (xo) Jn+1+f (x=1) Jn+2+bf (x_2)Jn), n E N. (2.10)
Transcribed Image Text:constant coefficients Xn+1 = axn+bxn-1+cxn-2, nE No, (1.4) which has actually the general solution X = xoSn+x-1 (Sn+1 - aSn) +cx_2Sn-1, nE No, (1.5) where (S.) of equation (1L4) satisfving the initial values S 2=S-=0, So= L. The equation axn-IXn-k Xn+1 = nE No, (1.1) bxn-p±cxn-q' where the initial conditions are arbitrary positive real numbers, k, 1, p, q are non- negative integers and a, b, c are positive constants, is one of the difference equations whose solutions are associated with number sequences. Positive solutions of concrete Motivated by this line of investigations, here we show that the systems of differ- ence equations Xn+l =f'(af (Pn-1)+bf(qn-2)), Yntl =f"(af (ra-1)+bf (Sn-2)), (1.8) for n E No, where the sequences Pn, qn, Tn and Sn are some of the sequences x, and Yn, f: Df R is a "1– 1" continuous function on its domain Dr C R, the initial values x-j, y-j, je {0,1,2} are arbitrary real numbers and the parameters and a, b 2.6. Case 6: Pn = Yn, qn = yn, rn = Xn, Sn = Xn In this case, we obtain the system Xn+1 =5"(af (Yn-1)+bf (Yn-2)), Yn+1 = '(af (xn-1)+bf (xn-2)), (2.29) for n e No. Since f is "1– 1", from (2.29) f (Xn+1) = af (Yn-1)+bf (yn-2), f(yn+l) = af (Xn-1) +bf (xn-2), (2.30) for n E No. By using the change of variables f (xn) = = Un, and f(yn) = Vn, n>-2, (2.31) system (2.30) is transformed to the following one Un+l = avn-1+bvn-2, Vn+1 = aun-1+ bun-2, nE No. (2.32) By summing the equations in (2.32) we get Un+l +Vn+l = a (un-1+ Vn-1) +b(un-2+Vn-2), nE No, (2.33) whereas by subtracting the second one from the first, we have Un+l - Vn+l = -a(un-1 - Vn-1) -6(un-2- Vn-2), ne No. (2.34) | In this section, we consider the eight special cases of systems (1.8), where the sequences Pn, qn, ľn, Sn are some of the sequences xn and yn, for n>-2, and initial values x-j, y-j, j e {0,1,2}, are arbitrary real numbers. 2.1 Case 1: Pn =xn, qn = Xn, ľn = yn, Sn == yn In this case, system (1.8) is expressed as Xn+1 =f (af (xn-1)+bf (xn-2)), Yn+1 =f(af (Vn-1)+bf (Yn-2)), (2.1) for n E No. Since f is "1– 1", from (2.1) f (Xn+1) = af (x,-1)+bf (xn-2), f (Yn+1) = af (yn-1)+bf (yn–2), (2.2) for n E No. By using the change of variables f (xn) = Un, and f(yn) = = Vn, n> -2, (2.3) system (2.2) is transformed to the following one Un+1 = au,-1+bun-2, Vn+1 = avn-1+bvn-2, (2.4) for n E No. By taking a = 0, b= a, c = b in (1.4) and S = Jn+1, for all n > -2, which is called generalized Padovan sequence, in (1.5), the solutions to equations in (2.4) are given by Un = ugJn+1+u-1Jn+2+ bu_2Jn, (2.5) Vn = voJn+1+v_1Jn+2+bv_2Jn, (2.6) for n E No. From (2.3), (2.5) and (2.6), it follows that the general solution to system (2.2) is given by Xn = f(f (x0) Jn+1+f (x-1) Jn+2+bf (x-2)Jn), n> -2, Yn =f(f (vo) Jn+1+f(y-1)Ja+2+bf (y-2) J.), n> -2. (2.7) (2.8) 2.2. Case 2: Pn = Xn, qn = Xn, ľn = Xn, Sn Xn In this case, system (1.8) becomes Xp+1 =f"(af (x,-1)+bf (xp-2)), Yn+1=f"(af (xn-1)+bf (xn-2)), (2.9) for n e No. It should be first note that from the equations in (2.9) it immediately follows that x, = yn, for all n E N. From (2.7), the general solution to system (2.9) is %3D X, = Ya = f'(f (xo) Jn+1+f (x=1) Jn+2+bf (x_2)Jn), n E N. (2.10)
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,
SEE MORE TEXTBOOKS