AbstractA generalized version of the exact model matching problem (GEMMP) is considered for linear multivariable systems over an arbitrary commutative ring K with identity. Reduced forms of this problem are introduced, and a characterization of all solutions and minimal order solutions is given, both with and without the properness constraint on the solutions, in terms of linear equations over K and K-modules. An approach to the characterization of all stable solutions is presented which, under a certain Bezout condition and a freeness condition, provides a parametrization of all stable solutions. The results provide an explicit parametrization of all solutions and all stable solutions in case K is a field, without the Bezout condition. Thi...
A commutative ring with identity is called a full quotient ring if every element of R is either a un...
The authors of Berg et al. [J. Algebra 348 (2011) 446-461] provide an algorithm for finding a comple...
The object of this work is to offer algorithm how can be solved systems of linear equations Ax=b ove...
AbstractA generalized version of the exact model matching problem (GEMMP) is considered for linear m...
AbstractA generalized rank (McCoy rank) of a matrix with entries in a commutative ring R with identi...
AbstractWe give the complete solution of a large class of problems in linear system theory, the so-c...
AbstractNew results are given on the pole-shifting problem for commutative rings, and these are then...
AbstractThis paper studies “fixed zeros” of solutions to the model matching problem for systems over...
pp. 122-130If is a finite system over a commutative von Neumann regular ring R, the problem of sear...
AbstractIn this paper, solution existence conditions for the model matching problem are studied for ...
AbstractWe establish sufficient conditions for assignability of reachable linear systems over commut...
AbstractIn 1952, W.E. Roth showed that matrix equations of the forms AX−YB = C and AX−XB = C over fi...
AbstractThis paper is concerned with the pole assignability property in commutative rings. Specifica...
AbstractThe determinants of solutions X to any of the 2×2 matrix equations: (1) XAX>−1=At, t denotin...
Models of algebraic systems of a first-order language are called elementarily equivalent (we write )...
A commutative ring with identity is called a full quotient ring if every element of R is either a un...
The authors of Berg et al. [J. Algebra 348 (2011) 446-461] provide an algorithm for finding a comple...
The object of this work is to offer algorithm how can be solved systems of linear equations Ax=b ove...
AbstractA generalized version of the exact model matching problem (GEMMP) is considered for linear m...
AbstractA generalized rank (McCoy rank) of a matrix with entries in a commutative ring R with identi...
AbstractWe give the complete solution of a large class of problems in linear system theory, the so-c...
AbstractNew results are given on the pole-shifting problem for commutative rings, and these are then...
AbstractThis paper studies “fixed zeros” of solutions to the model matching problem for systems over...
pp. 122-130If is a finite system over a commutative von Neumann regular ring R, the problem of sear...
AbstractIn this paper, solution existence conditions for the model matching problem are studied for ...
AbstractWe establish sufficient conditions for assignability of reachable linear systems over commut...
AbstractIn 1952, W.E. Roth showed that matrix equations of the forms AX−YB = C and AX−XB = C over fi...
AbstractThis paper is concerned with the pole assignability property in commutative rings. Specifica...
AbstractThe determinants of solutions X to any of the 2×2 matrix equations: (1) XAX>−1=At, t denotin...
Models of algebraic systems of a first-order language are called elementarily equivalent (we write )...
A commutative ring with identity is called a full quotient ring if every element of R is either a un...
The authors of Berg et al. [J. Algebra 348 (2011) 446-461] provide an algorithm for finding a comple...
The object of this work is to offer algorithm how can be solved systems of linear equations Ax=b ove...