Two new simple, complete, analytical, and restriction-free solutions with complete and
explicit freedom of the matrix equation AV+ BW= VF are proposed. Here (AB) is known and …

We propose an Arnoldi-based numerical method for solving a Sylvester-type equation
arising in the construction of the Luenberger observer. Given an N× N matrix A and an N× m …

A new approach for forcing the state of a linear discrete-time system to zero in a minimum
number of steps is discussed. The problem is formulated as the solution to a steady-state …

This paper presents a general algorithm for low-order multifunctional observer design with
arbitrary eigenvalues. The feature of this algorithm is that it can generate a functional …

In this note, a complete, analytical, and restriction-free solution with complete and explicit
freedom of the matrix equation TA-FT= LC is proposed. Here (A, C) is given and is …

This course looks at numerical issues of algorithms for signals, systems and control. In doing
that a clear choice is made to focus on numerical linear algebra techniques for linear time …

In this paper we give a numerical method to construct a rank m correction BF (where the n×
m matrix B is known and the m× n matrix F is to be found) to an× n matrix A, in order to put all …

Canonical forms of state-space models of multivariable systems have often been proposed
for solving certain analysis and design problems encountered in linear system theory. In this …

In this paper, an explicit solution to right coprime factorization of transfer function based on
Krylov matrix and Pseudo-Controllability Indices is investigated. The proposed approach …

In this paper, explicit parametric solutions to the generalized Sylvester matrix equation AX‐
XF= BY and the regulator matrix equation AX‐XF= BY+ R are proposed without any …