State Analysis of Time-Varying Singular Bilinear Systems by RK-Butcher Algorithms

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

Fourth NASA Goddard Conference on Mass Storage Systems and Technologies

This report contains copies of all those technical papers received in time for publication just prior to the Fourth Goddard Conference on Mass Storage and Technologies, held March 28-30, 1995, at the University of Maryland, University College Conference Center, in College Park, Maryland. This series of conferences continues to serve as a unique medium for the exchange of information on topics relating to the ingestion and management of substantial amounts of data and the attendant problems involved. This year's discussion topics include new storage technology, stability of recorded media, performance studies, storage system solutions, the National Information infrastructure (Infobahn), the future for storage technology, and lessons learned from various projects. There also will be an update on the IEEE Mass Storage System Reference Model Version 5, on which the final vote was taken in July 1994