State Analysis of Time-Varying Singular Bilinear Systems by RK-Butcher Algorithms
-
Published:2008-03-01
Issue:1
Volume:3
Page:103
-
ISSN:1841-9836
-
Container-title:International Journal of Computers Communications & Control
-
language:
-
Short-container-title:INT J COMPUT COMMUN
Author:
Murugesh V.,Batri K.
Abstract
The Runge-Kutta (RK)-Butcher algorithm is used to study the timevarying singular bilinear systems with the exact solutions. The results (discrete solutions) obtained using the Haar wavelets, Single-Term Walsh series (STWS) and RK-Butcher algorithms are compared with the exact solutions of the time-varying singular bilinear systems. It is found that the solution obtained using the RK-Butcher algorithm is closer to the exact solutions of the time-varying singular bilinear systems. The RK-Butcher algorithm can easily be implemented using a digital computer and the solution can be obtained for any length of time, which is an added advantage of this algorithm.
Publisher
Agora University of Oradea
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献