			Home About us Contact

Singular Linear System (singular + linear_system)

Distribution by Scientific Domains

Engineering	80%

Selected Abstracts

Singular linear systems with delay: ,, stabilization

OPTIMAL CONTROL APPLICATIONS AND METHODS, Issue 4 2007
E. K. BoukasArticle first published online: 12 MAR 200
Abstract This paper deals with the class of continuous-time singular linear systems with time-delay in the state vector. The stabilization problem of this class of systems using a state feedback controller is tackled. New delay-dependent sufficient conditions on ,, stabilization are developed. A design algorithm for a memoryless state feedback controller which guarantees that the closed-loop dynamics will be regular, impulse-free and stable with ,-disturbance rejection is proposed. It is shown that the addressed problem can be solved if the corresponding developed linear matrix inequalities (LMIs) with some constraints are feasible. A numerical example is employed to show the usefulness of the proposed results. Copyright © 2007 John Wiley & Sons, Ltd. [source]

A higher-order PDE-based image registration approach

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 5 2006
Volker Grimm
Abstract This paper addresses the problem of image registration with higher-order partial differential equation (PDE) methods. From the study of existing affine-linear and non-linear methods, a new framework is proposed that unifies common image registration methods within a generic formulation. Currently image registration strategies are classified into either affine-linear or non-linear methods subject to the underlying transformations. The new approach combines both strategies to obtain proper approximations which are invariant under global geometrical distortion (shearing), anisotropic resolution (scale changes), as well as rotation and translation. To achieve this favourable property, a modified gradient flow approach is proposed which uses an operator with a kernel consisting of affine-linear transformations. An approximation with finite differences leads to a large singular linear system. The pseudo-inverse solution of this system can be computed efficiently by augmenting the singular system to a regular system. Numerical experiments show the improvements compared to unmodified gradient flow approaches. Copyright © 2005 John Wiley & Sons, Ltd. [source]

Additive preconditioning in matrix computations

PROCEEDINGS IN APPLIED MATHEMATICS & MECHANICS, Issue 1 2007
V. Y. Pan
We combine our novel SVD-free additive preconditioning with aggregation and other relevant techniques to facilitate the solution of a linear system of equations and other fundamental matrix computations. Our analysis and experiments show the power of our algorithms, guide us in selecting most effective policies of preconditioning and aggregation, and provide some new insights into these and related subjects. Compared to the popular SVD-based multiplicative preconditioners, our additive preconditioners are generated more readily and for a much larger class of matrices. Furthermore, they better preserve matrix structure and sparseness and have a wider range of applications (e.g., they facilitate the solution of a consistent singular linear system of equations and of the eigen-problem). (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) [source]

Optimal guaranteed cost for singular linear systems with random abrupt changes

OPTIMAL CONTROL APPLICATIONS AND METHODS, Issue 4 2010
El-Kébir Boukas
Abstract This paper considers the class of continuous-time singular linear Markovian jump systems with totally and partially known transition jump rates. The guaranteed cost control problem of this class of systems is tackled. New sufficient conditions for optimal guaranteed cost are developed. A design procedure for the guaranteed cost controller, which guarantees that the closed-loop dynamics will be piecewise regular, impulse-free and stochastically stable is proposed. It is shown that the addressed problem can be solved if the corresponding developed linear matrix inequalities (LMIs) with some constraints are feasible. A numerical example is employed to show the usefulness of the proposed results. Copyright © 2009 John Wiley & Sons, Ltd. [source]