The aim of this paper is to analyze the undamped second order descriptor systems to show the possibility of transform an undamped second order descriptor system to a pure first order descriptor system ,on different ways, while stating some of its benefits. Meanwhile we will introduce pure first order systems and undamped second order systems and indicate that under some assumptions every undamp...

the aim of this paper is to analyze the undamped second order descriptor systems to show the possibility of transform an undamped second order descriptor system to a pure first order descriptor system ,on different ways, while stating some of its benefits. meanwhile we will introduce pure first order systems and undamped second order systems and indicate that under some assumptions every undamp...

a common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the weierstrass canonical form. the weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. the present ...

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

Linear descriptor systems are governed by dynamical equations subject to algebraic constraints. In the one-dimensional case, where only depend on a single index, usually time, Weierstrass canonical form splits up state vector in two parts, causal part, running forward and non-causal backward. this paper linear time-invariant autonomous two-dimensions discussed condition existence of non-trivial...