Abstract
In this article, the Runge–Kutta (RK)–Butcher algorithm is used to study the observer design of singular systems (transistor circuits) for time-invariant and time-varying cases. The obtained discrete solutions using the RK–Butcher algorithms are compared with STWS-I, STWS-II methods and with the exact solutions of the transistor circuit problems and are found to be very accurate. Stability analysis for the RK–Butcher algorithm is presented. Error graphs for time-invariant and time-varying cases are presented in a graphical form to show the efficiency of this method. This RK–Butcher algorithm can be easily implemented in a digital computer and the solution can be obtained for any length of time for this observer design of transistor circuit problem.
On leave from NIT, Tiruchirappalli, India.
Acknowledgements
One of the authors Dr. K. Murugesan would like to thank Professor Jong Yeoul Park, and his team of researchers in the Department of Mathematics, Pusan National University, Pusan 609-735, Republic of Korea, and also, he would like to thank the Korean Science and Engineering Foundation (KOSEF), Republic of Korea, for the financial assistance provided to him under the Brain Pool Program.
Notes
On leave from NIT, Tiruchirappalli, India.