The exact models of many systems are often too complex for simulation and control design. It is therefore desirable to simplify the mathematical description of the modelled systems. In this paper we consider the classical approach to model reduction, based on the minimization of the L 2 norm of the output error, i.e. of the difference between impulse responses of the original and the reduced-order model. Such index is a particularly meaningful from the technical point of view but is computationally demanding from algorithmic point of view. Corresponding optimization problem is an ill-conditioned one. Objective functional to be minimized is characterized by existence of many local minima. Additionally, it is often "flat" in a neighbourhood of a local minimum. This means, that gradient algorithms fail to give a satisfactory solution. In the paper, after analyzing properties of the mathematical programming problem to be solved, a family of non-gradient algorithms is presented.

L 2 model reduction - Nongradient approach

Ferrante A.
Membro del Collaboration Group
;
Viaro U.
Membro del Collaboration Group
2004-01-01

Abstract

The exact models of many systems are often too complex for simulation and control design. It is therefore desirable to simplify the mathematical description of the modelled systems. In this paper we consider the classical approach to model reduction, based on the minimization of the L 2 norm of the output error, i.e. of the difference between impulse responses of the original and the reduced-order model. Such index is a particularly meaningful from the technical point of view but is computationally demanding from algorithmic point of view. Corresponding optimization problem is an ill-conditioned one. Objective functional to be minimized is characterized by existence of many local minima. Additionally, it is often "flat" in a neighbourhood of a local minimum. This means, that gradient algorithms fail to give a satisfactory solution. In the paper, after analyzing properties of the mathematical programming problem to be solved, a family of non-gradient algorithms is presented.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11390/1194217
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact