All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 169

Showing per page

Characterization of generic properties of linear structured systems for efficient computations

Christian Commault, Jean-Michel Dion, Jacob W. van der Woude (2002)

Kybernetika

In this paper we investigate some of the computational aspects of generic properties of linear structured systems. In such systems only the zero/nonzero pattern of the system matrices is assumed to be known. For structured systems a number of characterizations of so-called generic properties have been obtained in the literature. The characterizations often have been presented by means of the graph associated to a linear structured system and are then expressed in terms of the maximal or minimal...

Computation of realizations composed of dynamic and static parts of improper transfer matrices

Tadeusz Kaczorek (2007)

International Journal of Applied Mathematics and Computer Science

The problem of computing minimal realizations of a singular system decomposed into a standard dynamical system and a static system of a given improper transfer matrix is formulated and solved. A new notion of the minimal dynamical-static realization is introduced. It is shown that there always exists a minimal dynamical-static realization of a given improper transfer matrix. A procedure for the computation of a minimal dynamical-static realization for a given improper transfer matrix is proposed...

Computing generalized inverse systems using matrix pencil methods

Andras Varga (2001)

International Journal of Applied Mathematics and Computer Science

We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state-space representation. We put particular emphasis on two classes of inverses: the weak generalized inverse and the Moore-Penrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computational ingredient to determine generalized inverses is the orthogonal reduction of the system matrix pencil...

Derivation of effective transfer function models by input, output variables selection

Nicos Karcanias, Konstantinos G. Vafiadis (2002)

Kybernetika

Transfer function models used for early stages of design are large dimension models containing all possible physical inputs, outputs. Such models may be badly conditioned and possibly degenerate. The problem considered here is the selection of maximal cardinality subsets of the physical input, output sets, such as the resulting model is nondegenerate and satisfies additional properties such as controllability and observability and avoids the existence of high order infinite zeros. This problem is...

Design of predictive LQ controller

Miroslav Fikar, Sebastian Engell, Petr Dostál (1999)

Kybernetika

A single variable controller is developed in the predictive control framework based upon minimisation of the LQ criterion with infinite output and control horizons. The infinite version of the predictive cost function results in better stability properties of the controller and still enables to incorporate constraints into the control design. The constrained controller consists of two parts: time-invariant nominal LQ controller and time-variant part given by Youla–Kučera parametrisation of all stabilising...

Detection and accommodation of second order distributed parameter systems with abrupt changes in input term: Existence and approximation

Michael A. Demetriou, Azmy S. Ackleh, Simeon Reich (2000)

Kybernetika

The purpose of this note is to investigate the existence of solutions to a class of second order distributed parameter systems with sudden changes in the input term. The class of distributed parameter systems under study is often encountered in flexible structures and structure-fluid interaction systems that use smart actuators. A failure in the actuator is modeled as either an abrupt or an incipient change of the actuator map whose magnitude is a function of the measurable output. A Galerkin-based...

Discrete-time symmetric polynomial equations with complex coefficients

Didier Henrion, Jan Ježek, Michael Šebek (2002)

Kybernetika

Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.

Discretization schemes for Lyapunov-Krasovskii functionals in time-delay systems

Keqin Gu (2001)

Kybernetika

This article gives an overview of discretized Lyapunov functional methods for time-delay systems. Quadratic Lyapunov–Krasovskii functionals are discretized by choosing the kernel to be piecewise linear. As a result, the stability conditions may be written in the form of linear matrix inequalities. Conservatism may be reduced by choosing a finer mesh. Simplification techniques, including elimination of variables and using integral inequalities are also discussed. Systems with multiple delays and...

Effective dual-mode fuzzy DMC algorithms with on-line quadratic optimization and guaranteed stability

Piotr M. Marusak, Piotr Tatjewski (2009)

International Journal of Applied Mathematics and Computer Science

Dual-mode fuzzy dynamic matrix control (fuzzy DMC-FDMC) algorithms with guaranteed nominal stability for constrained nonlinear plants are presented. The algorithms join the advantages of fuzzy Takagi-Sugeno modeling and the predictive dual-mode approach in a computationally efficient version. Thus, they can bring an improvement in control quality compared with predictive controllers based on linear models and, at the same time, control performance similar to that obtained using more demanding algorithms...

Currently displaying 41 – 60 of 169