Fundamental concordances between balanced truncation and activity-based model reduction

H. K. Fathy; J. L. Stein

Fundamental concordances between balanced truncation and activity-based model reduction

H. K. Fathy, J. L. Stein

Materials Research Institute (MRI)

Research output: Contribution to conference › Paper › peer-review

7 Scopus citations

Abstract

This paper examines two model reduction algorithms: balanced truncation and the activity-based model order reduction algorithm, MORA. The former truncates linear system states based on their Hankel singular values. The latter applies to both linear and nonlinear systems and uses activity as the criterion for component elimination. Although their underlying principles are different, MORA and balanced truncation are shown to produce equivalent reduced models in two special cases. These concordances between balanced truncation and MORA both theoretically justify MORA and highlight the ways in which it generalizes balanced truncation. The concordances are demonstrated using two simple examples.

Original language	English (US)
Pages	109-116
Number of pages	8
State	Published - 2005
Event	International Conference on Integrated Modeling and Analysis in Applied Control and Automation, IMAACA 2005, Held at the International Mediterranean Modeling Multiconference, I3M 2005 - Marseille, France Duration: Oct 20 2005 → Oct 22 2005

Other

Other	International Conference on Integrated Modeling and Analysis in Applied Control and Automation, IMAACA 2005, Held at the International Mediterranean Modeling Multiconference, I3M 2005
Country/Territory	France
City	Marseille
Period	10/20/05 → 10/22/05

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Control and Systems Engineering

Cite this

@conference{bb3e26d2749d40f1896c380f3d75ad9a,

title = "Fundamental concordances between balanced truncation and activity-based model reduction",

abstract = "This paper examines two model reduction algorithms: balanced truncation and the activity-based model order reduction algorithm, MORA. The former truncates linear system states based on their Hankel singular values. The latter applies to both linear and nonlinear systems and uses activity as the criterion for component elimination. Although their underlying principles are different, MORA and balanced truncation are shown to produce equivalent reduced models in two special cases. These concordances between balanced truncation and MORA both theoretically justify MORA and highlight the ways in which it generalizes balanced truncation. The concordances are demonstrated using two simple examples.",

author = "Fathy, {H. K.} and Stein, {J. L.}",

year = "2005",

language = "English (US)",

pages = "109--116",

note = "International Conference on Integrated Modeling and Analysis in Applied Control and Automation, IMAACA 2005, Held at the International Mediterranean Modeling Multiconference, I3M 2005 ; Conference date: 20-10-2005 Through 22-10-2005",

}

Fathy, HK & Stein, JL 2005, 'Fundamental concordances between balanced truncation and activity-based model reduction', Paper presented at International Conference on Integrated Modeling and Analysis in Applied Control and Automation, IMAACA 2005, Held at the International Mediterranean Modeling Multiconference, I3M 2005, Marseille, France, 10/20/05 - 10/22/05 pp. 109-116.

Fundamental concordances between balanced truncation and activity-based model reduction. / Fathy, H. K.; Stein, J. L.
2005. 109-116 Paper presented at International Conference on Integrated Modeling and Analysis in Applied Control and Automation, IMAACA 2005, Held at the International Mediterranean Modeling Multiconference, I3M 2005, Marseille, France.

Research output: Contribution to conference › Paper › peer-review

TY - CONF

T1 - Fundamental concordances between balanced truncation and activity-based model reduction

AU - Fathy, H. K.

AU - Stein, J. L.

PY - 2005

Y1 - 2005

N2 - This paper examines two model reduction algorithms: balanced truncation and the activity-based model order reduction algorithm, MORA. The former truncates linear system states based on their Hankel singular values. The latter applies to both linear and nonlinear systems and uses activity as the criterion for component elimination. Although their underlying principles are different, MORA and balanced truncation are shown to produce equivalent reduced models in two special cases. These concordances between balanced truncation and MORA both theoretically justify MORA and highlight the ways in which it generalizes balanced truncation. The concordances are demonstrated using two simple examples.

AB - This paper examines two model reduction algorithms: balanced truncation and the activity-based model order reduction algorithm, MORA. The former truncates linear system states based on their Hankel singular values. The latter applies to both linear and nonlinear systems and uses activity as the criterion for component elimination. Although their underlying principles are different, MORA and balanced truncation are shown to produce equivalent reduced models in two special cases. These concordances between balanced truncation and MORA both theoretically justify MORA and highlight the ways in which it generalizes balanced truncation. The concordances are demonstrated using two simple examples.

UR - http://www.scopus.com/inward/record.url?scp=34249811883&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249811883&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:34249811883

SP - 109

EP - 116

T2 - International Conference on Integrated Modeling and Analysis in Applied Control and Automation, IMAACA 2005, Held at the International Mediterranean Modeling Multiconference, I3M 2005

Y2 - 20 October 2005 through 22 October 2005

ER -

Fundamental concordances between balanced truncation and activity-based model reduction

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this