Search results for "Matrix"
showing 10 items of 3205 documents
Statistical validation of rival models for observable stochastic process and its identification
2011
In this paper, for statistical validation of rival (analytical or simulation) models collected for modeling observable process in stochastic system (say, transportation or service system), a uniformly most powerful invariant (UMPI) test is developed from the generalized maximum likelihood ratio (GMLR). This test can be considered as a result of a new approach to solving the Behrens-Fisher problem when covariance matrices of multivariate normal populations (compared with respect to their means) are different and unknown. The test makes use of an invariant statistic whose distribution, under the null hypothesis, does not depend on the unknown (nuisance) parameters. The sample size and thresho…
Robust control for autonomous spacecraft evacuation with model uncertainty and upper bound of performance with constraints
2014
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/589381 This paper studies the problem of guaranteed cost control for spacecraft evacuation. The relative dynamic model is established based on Clohessy-Wiltshire (C-W) equations. The paper has taken parameter uncertainty, output tracking, disturbance attenuation, and fuel cost into consideration. The paper introduces a new Lyapunov approach, so the controller design problem can be transferred into a convex optimization problem subject to linear matrix inequality (LMI) constraints. By using the controller, the spacecraft evacuation can be …
Passivity-based output feedback control of Markovian jump systems with discrete and distributed time-varying delays
2013
In this article, we present a new method in designing mode-dependent passivity-based output feedback controllers for Markovian jump systems with time-varying delays. Both discrete and distributed delays are considered in the model. A Lyapunov–Krasovskii function is constructed to establish new required sufficient conditions for ensuring exponentially mean-square stability and the passivity criteria, simultaneously. The method produces linear matrix inequality formulation that allows obtaining controller gains based on a convex optimisation method. Finally, a numerical example is given to illustrate the effectiveness of our approach.
A passivity approach to control of Markovian jump systems with mixed time-varying delays
2013
This paper investigated the problem of control design for a class of stochastic systems with Markovian jump parameters and time-varying delays. For the model under consideration, a passivity-based approach is introduced for designing mode-dependent output feedback controllers with mixed discrete and distributed delays. A Lypunov-Krasovskii function (LKF) is defined to establish new required sufficient conditions for ensuring exponentially mean-square stability and the passivity criteria, simultaneously. Moreover, controller gains are calculated based on a convex optimization method by solving a Linear Matrix Inequality (LMI). Finally, simulation results are provided to illustrate the effect…
Delay-Range-Dependent Linear Matrix Inequality Approach to Quantized H∞ Control of Linear Systems with Network-Induced Delays and Norm-Bounded Uncert…
2010
This paper deals with a convex optimization approach to the problem of robust network-based H∞ control for linear systems connected over a common digital communication network with static quantizers. Both the polytopic and the norm-bounded uncertainties are taken into consideration separately. First, the effect of both the output quantization levels and the network conditions under static quantizers is investigated. Second, by introducing a descriptor technique, using a Lyapunov—Krasovskii functional and a suitable change of variables, new required sufficient conditions are established in terms of delay-range-dependent linear matrix inequalities for the existence of the desired network-bas…
Monotonic solution of flow and transport problems in heterogeneous media using Delaunay unstructured triangular meshes
2013
Transport problems occurring in porous media and including convection, diffusion and chemical reactions, can be well represented by systems of Partial Differential Equations. In this paper, a numerical procedure is proposed for the fast and robust solution of flow and transport problems in 2D heterogeneous saturated media. The governing equations are spatially discretized with unstructured triangular meshes that must satisfy the Delaunay condition. The solution of the flow problem is split from the solution of the transport problem and it is obtained with an approach similar to the Mixed Hybrid Finite Elements method, that always guarantees the M-property of the resulting linear system. The…
A fast 3D dual boundary element method based on hierarchical matrices
2008
AbstractIn this paper a fast solver for three-dimensional BEM and DBEM is developed. The technique is based on the use of hierarchical matrices for the representation of the collocation matrix and uses a preconditioned GMRES for the solution of the algebraic system of equations. The preconditioner is built exploiting the hierarchical arithmetic and taking full advantage of the hierarchical format. Special algorithms are developed to deal with crack problems within the context of DBEM. The structure of DBEM matrices has been efficiently exploited and it has been demonstrated that, since the cracks form only small parts of the whole structure, the use of hierarchical matrices can be particula…
Reducing the bandwidth of a sparse matrix with tabu search
2001
The bandwidth of a matrix { } ij a A = is defined as the maximum absolute difference between i and j for which 0 ≠ ij a . The problem of reducing the bandwidth of a matrix consists of finding a permutation of the rows and columns that keeps the nonzero elements in a band that is as close as possible to the main diagonal of the matrix. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the nonzero elements of the corresponding symmetrical matrix. Many bandwidth reduction algorithms have been developed since the 1960s and applied to structural engineering, fluid dynamics and network analysis. For the most part, these procedures do not incorpo…
GRASP and path relinking for the matrix bandwidth minimization
2004
In this article we develop a greedy randomized adaptive search procedure (GRASP) for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix, which keeps the nonzero elements in a band that is as close as possible to the main diagonal. The proposed method may be coupled with a Path Relinking strategy to search for improved outcomes. Empirical results indicate that the proposed GRASP implementation compares favourably to classical heuristics. GRASP with Path Relinking is also found to be competitive with a recently published tabu search algorithm that is considered one of the best currently available for band…
Robust control of uncertain multi-inventory systems via linear matrix inequality
2008
We consider a continuous time linear multi inventory system with unknown demands bounded within ellipsoids and controls bounded within ellipsoids or polytopes. We address the problem of "-stabilizing the inventory since this implies some reduction of the inventory costs. The main results are certain conditions under which "-stabilizability is possible through a saturated linear state feedback control. All the results are based on a Linear Matrix Inequalities (LMIs) approach and on some recent techniques for the modeling and analysis of polytopic systems with saturations.