Abstract
Very simple methods are presented for computing equilibrium distributions of finite-state Markov processes in continuous time and in discrete time, namely Markov chains. These use the APL domino function which takes a least-squares approach which is efficient with systems of up to 50 states and probably more. This approach can also be used to solve for mean interval occupancies. It is not suggested that the least-squares solution be implemented in traditional languages like Fortran simply for the purpose of finding equilibrium distributions, for which the state reduction method is simpler. However, if APL is available the methods described provide accurate and extremely simple solutions for discrete or continuous-time models. More importantly, the APL domino function leads to a powerful and simple computation of mean interval occupancies and, hence, availabilities.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
