We prove that the optimal lumping quotient of a finite Markov chain can be constructd in O(m lg n) time, where n is the number of states and m is the number of transitions. The proof relies on the use of splay trees [18] to sort transition weights.

An algorithm and essential subroutines programs are presented which implement two stage finite element Galerkin method for integrating the complete two dimensional horizontal flow model. In this method high accuracy is obtained by combining the Galerkin product with a high-order difference approximation to derivatives in the nonlinear advection operator. Program includes the use of a weighted s...

English) The present thesis focuses on distributed systems operating under probabilistic influences like faults. How well can such systems provide their service under the effects of faults? How well can they recover from faults? The present thesis introduces with limiting window availability a suitable measure to answer such questions, and presents a method for its computation. For the computat...

Adhesive bonding community shows a continued interest in using bridging mechanisms to toughen the interface of secondary bonded joints, especially case laminated composites. Due snap-back instability that occurs during fracture, confusions may exist when identifying toughening effect experimentally. The true be overestimated by lumping all energy contributions (kinetic included) an overall effe...

this paper proposes a discrete-time repetitive optimal control of electrically driven robotic manipulators using an uncertainty estimator. the proposed control method can be used for performing repetitive motion, which covers many industrial applications of robotic manipulators. this kind of control law is in the class of torque-based control in which the joint torques are generated by permanen...