The paper establishes explicit representations of the errors and residuals of approximate
solutions of triangular linear systems by Jordan elimination and of general linear algebraic
systems by Gauss-Jordan elimination as functions of the data perturbations and the rounding
errors in arithmetic floating-point operations. From these representations strict optimal
componentwise error and residual bounds are derived. Further, stability estimates for the
solutions are discussed. The error bounds for the solutions of triangular linear systems are
compared to the optimal error bounds for the solutions by back substitution and by Gaussian
elimination with back substitution, respectively. The results confirm in a very detailed form
that the errors of the solutions by Jordan elimination and by Gauss-Jordan elimination cannot
be essentially greater than the possible maximal errors of the solutions by back substitution
and by Gaussian elimination, respectively. Finally, the theoretical results are illustrated by
two numerical examples.
The purpose of this paper is to give some results theorems , propositions and corollaries concerning new algebraic systems flower , garden and farm with accustomed algebraic systems groupoid , group and ring.
The goal of this work is demonstrating, through the gradient observation of a of type linear ( -systems), the possibility for reducing the effect of any disturbances (pollution, radiation, infection, etc.) asymptotically, by a suitable choice of related actuators of these systems. Thus, a class of ( -system) was developed based on finite time ( -system). Furthermore, definitions and some properties of this concept -system and asymptotically gradient controllable system ( -controllable) were stated and studied. More precisely, asymptotically gradient efficient actuators ensuring the weak asymptotically gradient compensation system ( -system) of known or unknown disturbances are examined. Consequently, under convenient hypo
... Show MoreIn this paper, we applied the concept of the error analysis using the linearization method and new condition numbers constituting optimal bounds in appraisals of the possible errors. Evaluations of finite continued fractions, computations of determinates of tridiagonal systems, of determinates of second order and a "fast" complex multiplication. As in Horner's scheme, present rounding error analysis of product and summation algorithms. The error estimates are tested by numerical examples. The executed program for calculation is "MATLAB 7" from the website "Mathworks.com
In this paper, a self-tuning adaptive neural controller strategy for unknown nonlinear system is presented. The system considered is described by an unknown NARMA-L2 model and a feedforward neural network is used to learn the model with two stages. The first stage is learned off-line with two configuration serial-parallel model & parallel model to ensure that model output is equal to actual output of the system & to find the jacobain of the system. Which appears to be of critical importance parameter as it is used for the feedback controller and the second stage is learned on-line to modify the weights of the model in order to control the variable parameters that will occur to the system. A back propagation neural network is appl
... Show MoreThis paper presents a newly developed method with new algorithms to find the numerical solution of nth-order state-space equations (SSE) of linear continuous-time control system by using block method. The algorithms have been written in Matlab language. The state-space equation is the modern representation to the analysis of continuous-time system. It was treated numerically to the single-input-single-output (SISO) systems as well as multiple-input-multiple-output (MIMO) systems by using fourth-order-six-steps block method. We show that it is possible to find the output values of the state-space method using block method. Comparison between the numerical and exact results has been given for some numerical examples for solving different type
... Show MoreIn this paper, a new approach was suggested to the method of Gauss Seidel through the controlling of equations installation before the beginning of the method in the traditional way. New structure of equations occur after the diagnosis of the variable that causes the fluctuation and the slow extract of the results, then eradicating this variable. This procedure leads to a higher accuracy and less number of steps than the old method. By using the this proposed method, there will be a possibility of solving many of divergent values equations which cannot be solved by the old style.
In this research, Haar wavelets method has been utilized to approximate a numerical solution for Linear state space systems. The solution technique is used Haar wavelet functions and Haar wavelet operational matrix with the operation to transform the state space system into a system of linear algebraic equations which can be resolved by MATLAB over an interval from 0 to . The exactness of the state variables can be enhanced by increasing the Haar wavelet resolution. The method has been applied for different examples and the simulation results have been illustrated in graphics and compared with the exact solution.
In this paper, we present some numerical methods for solving systems of linear FredholmVolterra integral equations of the second kind. These methods namely are the Repeated Trapezoidal Method (RTM) and the Repeated Simpson's 1/3 Method (RSM). Also some numerical examples are presented to show the efficiency and the accuracy of the presented work.
This research reports an error analysis of close-range measurements from a Stonex X300 laser scanner in order to address range uncertainty behavior based on indoor experiments under fixed environmental conditions. The analysis includes procedures for estimating the precision and accuracy of the observational errors estimated from the Stonex X300 observations and conducted at intervals of 5 m within a range of 5 to 30 m. The laser 3D point cloud data of the individual scans is analyzed following a roughness analysis prior to the implementation of a Levenberg–Marquardt iterative closest points (LM-ICP) registration. This leads to identifying the level of roughness that was encountered due to the range-finder’s limitations in close
... Show MoreThe article emphasizes that 3D stochastic positive linear system with delays is asymptotically stable and depends on the sum of the system matrices and at the same time independent on the values and numbers of the delays. Moreover, the asymptotic stability test of this system with delays can be abridged to the check of its corresponding 2D stochastic positive linear systems without delays. Many theorems were applied to prove that asymptotic stability for 3D stochastic positive linear systems with delays are equivalent to 2D stochastic positive linear systems without delays. The efficiency of the given methods is illustrated on some numerical examples. HIGHLIGHTS Various theorems were applied to prove the asymptoti
... Show More