Title:

Iterative-interpolation algorithms for L2 model reduction

Subtitle:

Raport Badawczy = Research Report ; RB/86/2009

Creator:

Krajewski, Wiesław (informatyka) ; Viaro, Umberto

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2009

Description:

543-554 pages ; 21 cm ; Bibliography p. 553-554

Abstract:

This paper is concerned with the construction of reduced–order models for high–order linear systems in such a way that the L2 norm of the impulse–response error is minimized. Two convergent algorithms that draw on previous procedures presented by the same authors, are suggested: one refers to s–domain representations, the other to time–domain state–space representations. The algorithms are based on an iterative scheme that, at any step, satisfies certain interpolation constraints deriving from the optimality conditions. To make the algorithms suitable to the reduction of very large–scale systems, resort is made to Krylov subspaces and Arnoldi’s method. The performance of the reduction algorithms is tested on two benchmark examples.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2009-86

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open