Search

We use the representation of a continuous time Hattendorff differential equation and Matlab to compute 2σt(j), the solution of a backwards in time differential equation that describes the evolution of the variance of Lt(j), the loss at time t random variable for a multi-state Markovian process, given that the state at time t is j. We demonstrate this process by solving examples of several instances of a multi-state model which a practitioner can use as a guide to solve and analyze specific multi-state models. Numerical solutions to compute the variance 2σt(j) enable practitioners and academic researchers to test and simulate various state-space scenarios, with possible transitions to and from temporary disabilities, to permanent disabilities, to and from good health, and eventually to a deceased state. The solution method presented in this paper allows researchers and practitioners to easily compute the evolution of the variance of loss without having to resort to detailed programming.

The current study aims to design an integrated numerical computing-based scheme by applying the Levenberg–Marquardt backpropagation (LMB) neural network to solve the nonlinear susceptible (S), infected (I) and recovered (R) (SIR) system of differential equations, representing the spreading of infection along with its treatment. The solutions of both the categories of spreading infection and its treatment are presented by taking six different cases of SIR models using the designed LMB neural network. A reference dataset of the designed LMB neural network is established with the Adam numerical scheme for each case of the spreading infection and its treatment. The approximate outcomes of the SIR system based on the spreading infection and its treatment are presented in the training, authentication and testing procedures to adapt the neural network by reducing the mean square error (MSE) function using the LMB. Studies based on the proportional performance and inquiries based on correlation, error histograms, regression and MSE results establish the efficiency, correctness and effectiveness of the proposed LMB neural network scheme.

The designed fractional order Stuxnet, the virus model, is analyzed to investigate the spread of the virus in the regime of isolated industrial networks environment by bridging the air-gap between the traditional and the critical control network infrastructures. Removable storage devices are commonly used to exploit the vulnerability of individual nodes, as well as the associated networks, by transferring data and viruses in the isolated industrial control system. A mathematical model of an arbitrary order system is constructed and analyzed numerically to depict the control mechanism. A local and global stability analysis of the system is performed on the equilibrium points derived for the value of α = 1. To understand the depth of fractional model behavior, numerical simulations are carried out for the distinct order of the fractional derivative system, and the results show that fractional order models provide rich dynamics by means of fast transient and super-slow evolution of the model’s steady-state behavior, which are seldom perceived in integer-order counterparts.

Finding the roots of an equation is a fundamental problem in various fields, including numerical computing, social and physical sciences. Numerical techniques are used when an analytic solution is not available. There is not a single algorithm that works best for every function. We designed and implemented a new algorithm that is a dynamic blend of the bisection and regula falsi algorithms. The implementation results validate that the new algorithm outperforms both bisection and regula falsi algorithms. It is also observed that the new algorithm outperforms the secant algorithm and the Newton&ndash, Raphson algorithm because the new algorithm requires fewer computational iterations and is guaranteed to find a root. The theoretical and empirical evidence shows that the average computational complexity of the new algorithm is considerably less than that of the classical algorithms.