.png){kind=icon}
.png){kind=icon}
Return
Structural matrix minimization algorithm for implicit descriptions
.png){kind=icon}
PRE
AI
DOI：10.1016/S0005-1098(96)00215-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we propose a matrix minimization algorithm for linear, time-invariant, implicit (E,A,B,C) descriptions of the type: E(x)over dot-(t) = As(t) + Bu(t); y(t) = Cx(t). Given the initial matrices (E,A,B,C), we obtain an externally equivalent minimal realization (E-m, A(m), B-m, C-m,) after applying a matricial procedure based on maximal, row and column, compressions. (C) 1997 Elsevier Science Ltd.
Keywords:
linear systems
implicit systems
external equivalence
geometric approach
minimization
matrix methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.