Computing Exact Solution for Forward Linear Discrete Time Variant Systems | ||||
| Alfarama Journal of Basic & Applied Sciences | ||||
| Articles in Press, Accepted Manuscript, Available Online from 22 February 2024 | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/ajbas.2024.252552.1201 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
Mohammed Shehata  1; A M Ezz-Eldin1; A A Khalil2
| ||||
| 1Department of Basic Science, Bilbeis Higher Institute for Engineering, Ministry of Higher Education, Egypt | ||||
| 2Department of Mathematics, Faculty of Science, Sohag University, Egypt | ||||
| Abstract | ||||
| Discrete or digital systems that are only known at discrete moments are very important in various fields of physics and engineering such as robot and digital optimal control. Now everything around us depends on digital systems for its operation and function. Maple programming contains important packages such as the linear algebra package. Using this algebra package and some commands in Maple, we will build a simple procedure to compute the exact solution of linear discrete systems with time-varying coefficients and containing forward operators and forward difference operators. First, we will find the closed form of a discrete linear system of first order, and then generalized to higher orders. Then we build the algorithm and turn it into a maple procedure. Finally, to illustrate our procedure, we will give some examples with different types of operators. By entering the system parameters into each example, we will obtain the exact solution graph. | ||||
| Keywords | ||||
| Discrete system; time-varying systems; difference equations; digital system; Maple programing | ||||
|
Statistics Article View: 70 |
||||
