A new two-step iterative method for optimal reduction of linear SISO systems (Q1366510): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0016-0032(96)00049-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973534195 / rank | |||
Normal rank |
Latest revision as of 10:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new two-step iterative method for optimal reduction of linear SISO systems |
scientific article |
Statements
A new two-step iterative method for optimal reduction of linear SISO systems (English)
0 references
27 January 1998
0 references
This paper discusses the model reduction problem of SISO systems. A strictly proper rational transfer function \(G_n\) of degree \(n\) is approximated by a strictly proper rational transfer function \(G_m\) of lower degree \(m<n\). The approximation criterion is to minimise \(\int_0^\infty e(t)^2dt\) where \(e(t)\) is the response of the system with transfer function \(G_n-G_m\) to an input with Laplace transform \(R(s)=s^{-l}\) where \(l=0\) or 1. The classical free parameters of the problem (the coefficients of the numerator and denominator of \(G_m\)) are replaced by the Routh stability parameters of the denominator and the coefficients of the numerator. Then stability of the approximant is guaranteed if these Routh parameters are subject to a simple positivity constraint. The solution of this constrained optimization problem is based on a gradient method. Explicit expressions for this gradient are derived. The iteration alternates between an update of the Routh parameters and an update of the numerator coefficients.
0 references
model reduction
0 references
linear systems
0 references
stability of the approximant
0 references
Routh parameters
0 references
constrained optimization
0 references
gradient method
0 references
0 references
0 references
0 references
0 references
0 references