Results 131 to 140 of about 8,394 (167)
Some of the next articles are maybe not open access.

Decentralized Pole Assignment and Product Grassmannians

SIAM Journal on Control and Optimization, 1994
The pole assignment problems of linear systems of decentralized static output feedback are considered. The author introduces a compactification of the decentralized feedback space, a product of Grassmannians. The problem statements are given in the introduction. The degree of product Grassmannians under Plucker-Segre embeddings is computed in chapter 2.
openaire   +2 more sources

The bidiagonal realization pole assignment problems : a tool for solving and pole assignment problems

International Journal of Control, 1980
Abstract An alternative realization for single-input, single-output stationary systems is presented which displays several advantages compared with the classical canonical realization of transfer functions. The flowgraph representation of the proposed realization brings out a basic structure which involves the series connection of first-order, strictly
openaire   +1 more source

Robust Pole Assignment

1991
Pole assignment is a well-known method for controller design. If the plant parameter vector is characterized by some uncertainty and if there is some flexibility in the desired closed-Ioop pole vector, the problem of finding a robust controller arises. The solution of this problem is not a simple one of solving linear algebraic equations as in the case
openaire   +1 more source

Consistent systems and pole assignment: I

Differential Equations, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Pole Assignment and Stabilization

2010
It is wellknown from normal linear systems theory that pole assignment and stabilization are two very basic closely related design problems in linear systems theory. In this chapter, we investigate these two problems for descriptor linear systems.
openaire   +1 more source

The structural aspects of pole assignment

International Journal of Control, 1981
The ability to assign the poles of a multivariable system, even under an imposed set of constraints ‘e.g. decentralized control’ is shown to reside completely in structural properties made explicit in the system digraph. A graph-theoretic approach to both the analysis and synthesis of multivariate control systems is then possible.
Evans, F. J.   +3 more
openaire   +2 more sources

The general problem of pole assignment‡

International Journal of Control, 1978
Abstract Let G be a strictly proper, rational m × l matrix, with controllability indices λ1≥λ2≥…≥λ l and observability indices μ1≥μ2≥…≥μm. Also let ϕ1 ϕ2…, ϕ l be monic polynomials, where ϕi divides ϕi−1, i = 2, 3,…,l. Does there exist a proper rational feedback matrix K which makes the invariant polynomials of the resulting closed-loop system equal to
H. H. ROSENBROCK, G. E. HAYTON
openaire   +1 more source

A Schur method for pole assignment

IEEE Transactions on Automatic Control, 1981
In this paper a new numerical algorithm for pole assignment of linear time-invariant systems is presented. The proposed algorithm uses reliable numerical techniques based on the Schur form of the state matrix and on the use of orthogonal transformations.
openaire   +1 more source

On computational algorithms for pole assignment

IEEE Transactions on Automatic Control, 1986
A number of computationally reliable direct methods for pole assignment by feedback have recently been developed. These direct procedures do not necessarily produce robust solutions to the problem, however, in the sense that the assigned poles are insensitive to perturbations in the closed-loop system.
openaire   +2 more sources

Pole assignment by dynamic feedback

International Journal of Control, 1981
It is shown that by dynamic feedback the closed loop transfer matrix of a linear system can be made equal to a proper rational matrix of the form v(s)T'−1(s)T−(s)T k (s) Here V(s) is the numerator polynomial matrix of the open loop transfer matrix, T'(s) is a polynomial matrix which can be chosen arbitrarily up to some degree constraints, T'2(s) is a ...
openaire   +1 more source

Home - About - Disclaimer - Privacy