The method of elimination of unknowns for systems of linear inequalities with graph structure

The method of elimination of unknowns in a system of linear inequalities is considered. This method is used to solve systems of linear inequalities whose structure is defined by some graph. The concepts of terminal and intermediate graphs are introduced. A new system of inequalities derived by eliminating a group of unknowns that correspond to these subgraphs is described. Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 66–74, September–October, 1999.     

Analysis of the properties of a linear system using the method of artificial basis matrices

Formulas relating elements of the method in adjacent basis matrices are used to solve a system of linear algebraic equations and to represent analytically the general solutions to the corresponding system of linear algebraic inequalities for a nondegenerate constraint matrix. Sponsored by the ICS NATO program of April 18 2006, in line with the Project “Optimal replacement of information technologies and stable development (in Kazakhstan, Ukraine, and the USA),” NATO Grant CLG 982209. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 119–127, July–August 2007.     

Optimum parameter for the SOR-like method for augmented systems

Recently, several proposals for the generalization of Young's SOR method to the saddle point problem or the augmented system has been presented. One of the most practical versions is the SOR-like method given by Golub et al., [(2001). SOR-like methods for augmented systems. BIT, 41, 71–85.], where the convergence and the determination of its optimum parameters were given. In this article, a full characterization of the spectral radius of the SOR-like iteration matrix is given, and an explicit expression for the optimum parameter is given in each case. The new results also lead to different results to that of Golub et al. Besides, it is shown that by the choices of the preconditioning matrix, the optimum SOR-like iteration matrix has no complex eigenvalues, therefore, it can be accelerated by semi-iterative methods.     

AOR type iterations for solving preconditioned linear systems

An AOR type iterative method for solving preconditioned linear systems, with the preconditioner (I+β S) where β is a real number, is presented. Convergence of the method applied to L-matrices is discussed. Our results contain and extend previous results.     

Finite-time estimation for linear time-delay systems via homogeneous method

This paper presents a finite-time observer for linear time-delay systems with commensurate delay. Unlike the existing observers in the literature which converge asymptotically, the proposed observer provides a finite-time estimation. This is realised by using the well-known homogeneous technique, and the results are also extended to investigate the estimation problem for linear time-delay systems with unknown inputs. Simulation results are presented in order to illustrate the feasibility of the proposed method.     

Robust stability analysis of linear systems with parametric uncertainty

This article is concerned with the problem of robust stability analysis of linear systems with uncertain parameters. By constructing an equivalent system with positive uncertain parameters and using the properties of these parameters, a new stability analysis condition is derived. Due to making use of the properties of uncertain parameters, the new proposed method has potential to give less conservative results than the existing approaches. A numerical example is given to illustrate the effectiveness of the proposed method.     

线性模糊微分系统的同伦摄动法

利用模糊结构元方法,将线性模糊微分系统转换成同解的线性确定微分系统。采用同伦摄动法给出线性确定微分系统的近似解,进而给出原模糊微分系统的近似解。给出了具体算例。     

On the generalisation of the basic iterative methods for the solution of linear systems

For the solution of the linear system Ax=b many iterative methods based on a splitting of A exist. Among them the Jacobi, the Gauss-Seidel and the Successive Overrelaxation (SOR) methods as well as their extrapolated counterparts are the most popular. This paper presents a new general method such that the aforementioned methods become special cases of it. Besides its four degrees of freedom, which make it a very flexible method, another of its main characteristics is that it is well-defined even when some elements on the diagonal of A are zero. The first results concerning the new method show that a proper exploitation of its basic properties will make it a very powerful technique.     

Shrinkage of arcs in solving systems of linear inequalities with graph structure

To solve systems of linear equalities with graph structure, it is necessary to execute operations of sequential shrinkage of terminal and intermediated arcs. The paper deals with an algorithm of shrinkage of these arcs for a graph specified as an adjancency matrix. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 167–170, March–April, 2000.     

Generalized tridiagonal preconditioners for solving linear systems

The paper presents a type of tridiagonal preconditioners for solving linear system Ax=b with nonsingular M-matrix A, and obtains some important convergent theorems about preconditioned Jacobi and Gauss–Seidel type iterative methods. The main results theoretically prove that the tridiagonal preconditioners cannot only accelerate the convergence of iterations, but also generalize some known results.     

Exponential stability analysis of linear systems with multiple successive delay components

A general class of linear systems with multiple successive delay components is considered in this article. The delays are assumed to vary in intervals, and delay-dependent exponential stability conditions are derived in terms of linear matrix inequalities. To reduce conservativeness, a new Lyapunov–Krasovskii functional is designed to contain more complete state information, so that a derivation procedure with time-varying delays treated as uncertain parameters can be adopted. Usage of slack variables and inequalities are refrained as much as possible when bounds on the Lyapunov derivative are sought. The stability criteria are tested by two popular numerical examples, with less conservative results obtained in all the checked cases. Besides, a practical application of the derived conditions is illustrated.     

A numerical sufficiency test for the asymptotic stability of linear time-varying systems

A numerical sufficiency test for the asymptotic stability of linear time-varying Hurwitz systems is proposed. The algorithmic procedure constructs a bounding tube in which the state is guaranteed to stay. The continuous-time system is evaluated at discrete time instants, for which successive quadratic Lyapunov functions are generated. The tube is constructed based on: (i) a conservative estimate of the state evolution, from a discrete time instant to the next, obtained from the corresponding Lyapunov function, and (ii) re-evaluation of the tube diameter at each discrete time instant to account for variations in the plant matrix. The numerical test is illustrated in simulation via both a stable and an unstable system.     

The preconditioning of explicit group-2 point linear systems with 5 and 9 block diagonals

The following paper presents the evaluation of the performance of the preconditioned conjugate gradient

through the use of the incomplete matrix decomposition for the explicit group-2 matrices with different

numbers of nonzero block diagonals.     

Improved results for linear discrete-time systems with an interval time-varying input delay

This paper addresses the problem of delay-dependent stability analysis and controller synthesis for a discrete-time system with an interval time-varying input delay. By dividing delay interval into multiple parts and constructing a novel piecewise Lyapunov–Krasovskii functional, an improved delay-partitioning-dependent stability criterion and a stabilisation criterion are obtained in terms of matrix inequalities. Compared with some existing results, since a tighter bounding inequality is employed to deal with the integral items, our results depend on less number of linear matrix inequality scalar decision variables while obtaining same or better allowable upper delay bound. Numerical examples show the effectiveness of the proposed method.     

Dynamic observer-based control for fractional-order uncertain linear systems

This paper addresses the problem of dynamic observer-based control for fractional-order linear uncertain systems. By constructing a new linearising change of variables, the conditions for designing the observer and controller gains are obtained in terms of solutions to a set of linear matrix inequalities (LMIs) even in the presence of uncertainties in system, input and output matrices simultaneously. Meanwhile, owing to having additional degrees of freedom in the designed observer structure, the proposed methods have no equality constraint, which is needed by using Luenberger-type observer. Numerical examples are given to illustrate the benefits and the effectiveness of the proposed method.     

Regular linear systems with feedback

We consider a rather general class of infinite-dimensional linear systems, called regular linear systems, for which convenient representations are known to exist both in time and in the frequency domain. We introduce and study the concept of admissible feedback operator for such a system and of well-posedness radius. We show that the closed-loop system obtained from a regular linear system with an admissible feedback operator is again regular and we describe the relationship between the generating operators of the open-loop and closed-loop systems.Part of the results reported here were obtained while the author was visiting FUNDP Namur, under the Belgian Program on Inter-University Poles of Attraction initiated by the Belgian state, Prime Minister's Office, Science Policy Programming. The scientific responsibility is assumed by the author.     

A parallel partition method for solving banded systems of linear equations

The partition method of Wang for tridiagonal equations is generalized to the arbitrary band case. A stability criterion is given. The algorithm is compared to Gaussian elimination and cyclic reduction.     

Conjugate residual squared method and its improvement for non-symmetric linear systems

In this paper, conjugate residual squared (CRS) method for solving linear systems with non-symmetric coefficient matrices is proposed. Moreover, based on the ideas by Gu et al. [An improved bi-conjugate residual algorithm suitable for distributed parallel computing, Appl. Math. Comput. 186 (2007), pp. 1243–1253], we present an improved conjugate residual squared (ICRS) method, which is designed for distributed parallel environments. The improved method reduces two global synchronization points to one by changing the computation sequence in the CRS method and all inner products per iteration are independent, and communication time required for inner product can be overlapped with useful computation. Theoretical analysis shows that the ICRS method has better parallelism and scalability than the CRS method. Finally, some numerical experiments clearly show that the ICRS method can achieve better parallel performance with a higher scalability than the CRS method, and also the improvement percentage of communication is up to 47.33%, which meets our theoretical analysis.