Abstract

The computation of availability or reliability in a Markovian approach involves the solution of O.D.E.: dp dt = L(t)p , where the transition matrix is time dependent, at least when some aggregation of the states is introduced to reduce the size of the problem. Methods of solution like uniformization are in this case unapplicable and we investigate here four explicit and six implicit R.K. methods from the point of view of stability, amount of numerical work and accuracy. The test problem chosen allows an analytical solution, a uniformization method (when L( t) is constant) and a fortiori all R.K. methods. The implicit trapezoidal rule used with a variable step scheme appears to be the best compromise between accuracy and computational work.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.