Abstract—A new block algorithm for computing a full rank solution of the Sylvester-observer equation arising in state estimation is proposed. The major Computational Kernels of this algorithm are (i) solutions of ordinary Sylvester equations, in which case each one of the matrices is of much smaller order than that of the system matrix and furthermore, this small matrix can be chosen arbitraril...

Developing theory, algorithms, and software tools for analyzing matrix pencils whose matrices have various structures are contemporary research problems. Such matrices are often coming from discretizations of systems of differential-algebraic equations. Therefore preserving the structures in the simulations as well as during the analyses of the mathematical models typically means respecting the...

We consider an analytic perturbation of the Sylvester matrix equation. Mainly we are interested in the singular case, that is, when the null space of the unperturbed Sylvester operator is not trivial, but the perturbed equation has a unique solution. In this case, the solution of the perturbed equation can be given in terms of a Laurent series. Here we provide a necessary and su cient condition...

Preconditioning is the most common approach for accelerating an iterative method and consists in solving an auxilliary problem structurally close to the original one. In most situations, the art of preconditioning consists in building in a efficient way a matrix or a sequence of matrices. This explicit approach is not however always possible and there are situations in which preconditioned vers...

A matrix is called a multiple resultant matrix associated to two matrix polynomials when it becomes singular if and only if the two matrix polynomials have at least one common eigenvalue. In this paper a new multiple resultant matrix is introduced. It concerns the Fisher information matrix (FIM) of a stationary vector autoregressive and moving average time series process (VARMA). The two matrix...

The linear system of equations Ax = b where A = [aij ] in Cn.n is a crispsingular matrix and the right-hand side is a fuzzy vector is called a singularfuzzy linear system of equations. In this paper, solving singular fuzzy linearsystems of equations using generalized inverses such as Drazin inverse andpseudo-inverse are investigated.

In this paper, we present a general family of iterative methods to solve linear equations, which includes the well-known Jacobi and Gauss–Seidel iterations as its special cases. The methods are extended to solve coupled Sylvester matrix equations. In our approach, we regard the unknown matrices to be solved as the system parameters to be identified, and propose a least-squares iterative algorit...

In this paper, we consider large-scale linear discrete ill-posed problems where the right-hand side contains noise. Regularization techniques such as Tikhonov regularization are needed to control the effect of the noise on the solution. In many applications such as in image restoration the coefficient matrix is given as a Kronecker product of two matrices and then Tikhonov regularization proble...

This paper considers the solution to a class of the second-order Sylvester matrix equation EVF2 −AVF −CV = BW . Under the controllability of the matrix triple (E,A,B), a complete, general, and explicit parametric solution to the second-order Sylvester matrix equation, with the matrix F in a diagonal form, is proposed. The results provide great convenience to the analysis of the solution to the ...