Solution of Linear Difference Equation in Interval Environment and Its Application

2021 ◽  
pp. 11-33
Author(s):  
Mostafijur Rahaman ◽  
Sankar Prasad Mondal ◽  
Shariful Alam
Author(s):  
Mostafijur Rahaman ◽  
Sankar Prasad Mondal ◽  
Ebrahem A. Algehyne ◽  
Amiya Biswas ◽  
Shariful Alam

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Stevo Stević ◽  
Bratislav Iričanin ◽  
Witold Kosmala ◽  
Zdeněk Šmarda

Abstract It is known that every solution to the second-order difference equation $x_{n}=x_{n-1}+x_{n-2}=0$ x n = x n − 1 + x n − 2 = 0 , $n\ge 2$ n ≥ 2 , can be written in the following form $x_{n}=x_{0}f_{n-1}+x_{1}f_{n}$ x n = x 0 f n − 1 + x 1 f n , where $f_{n}$ f n is the Fibonacci sequence. Here we find all the homogeneous linear difference equations with constant coefficients of any order whose general solution have a representation of a related form. We also present an interesting elementary procedure for finding a representation of general solution to any homogeneous linear difference equation with constant coefficients in terms of the coefficients of the equation, initial values, and an extension of the Fibonacci sequence. This is done for the case when all the roots of the characteristic polynomial associated with the equation are mutually different, and then it is shown that such obtained representation also holds in other cases. It is also shown that during application of the procedure the extension of the Fibonacci sequence appears naturally.


2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
S. Hristova ◽  
A. Golev ◽  
K. Stefanova

The object of investigation of the paper is a special type of difference equations containing the maximum value of the unknown function over a past time interval. These equations are adequate models of real processes which present state depends significantly on their maximal value over a past time interval. An algorithm based on the quasilinearization method is suggested to solve approximately the initial value problem for the given difference equation. Every successive approximation of the unknown solution is the unique solution of an appropriately constructed initial value problem for a linear difference equation with “maxima,” and a formula for its explicit form is given. Also, each approximation is a lower/upper solution of the given mixed problem. It is proved the quadratic convergence of the successive approximations. The suggested algorithm is realized as a computer program, and it is applied to an example, illustrating the advantages of the suggested scheme.


1974 ◽  
Vol 17 (1) ◽  
pp. 77-83
Author(s):  
Edward Moore

Vasil’eva, [2], demonstrates a close connection between the explicit formulae for solutions to the linear difference equation with constant coefficients(1.1)where z is an n-vector, A an n×n constant matrix, τ>0, and a corresponding differential equation with constant coefficients(1.2)(1.2) is obtained from (1.1) by replacing the difference z(t—τ) by the first two terms of its Taylor Series expansion, combined with a suitable rearrangement of the terms.


Sign in / Sign up

Export Citation Format

Share Document