A test based on continued fraction expansion for polynomials with complex coefficients decides whether the polynomial has all its roots in the left half-plane. The test ...

We investigated an interpolation algorithm for computing the Moore–Penrose inverse of a given polynomial matrix, based on the Leverrier–Faddeev method. Also, a method for ...

We propose an extension of the Grevile's partitioning method for computing the Moore–Penrose inverse, which is applicable to the set of rational matrices. Also, we develop ...

A polynomial P in n complex variables is said to have the "half-plane property" (or Hurwitz property) if it is nonvanishing whenever all the variables lie in the open right ...

This paper focuses on computational aspects of the realization of nonlinear multi-input multi-output systems. Instead of the algorithmic solutions, provided in earlier works, ...

Polynomial Control Systems (PCS), a Mathematica-based toolbox, expands the functionality of Wolfram Research's Control System Professional Suite (CSPS) in a variety of ways. ...

A new integrated software package called Polynomial Control Systems, that is fully compatible with Mathematica's Control System Professional, is described. The package, which ...

Adomian polynomials (AP’s) are expressed in terms of new objects called reduced polynomials (RP’s). These new objects, which carry two subscripts, are independent of the ...

There are proposed two types of finite algorithms for symbolic computation of outer inverses of a given polynomial or rational matrix, based on the extension of the ...

The complex polynomial method variant of the well-known complex variable boundary element method (CVBEM) is reexamined in its utility in solving Partial Differential ...