2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) 2011
DOI: 10.1109/iccad.2011.6105380
|View full text |Cite
|
Sign up to set email alerts
|

Model order reduction of fully parameterized systems by recursive least square optimization

Abstract: Abstract-This paper presents a method for the model order reduction of fully parameterized linear dynamic systems. In a fully parameterized system, not only the state matrices, but also can the input/output matrices be parameterized. This algorithm is based on neither conventional moment-matching nor balancedtruncation ideas; instead, it uses "optimal (block) vectors" to construct the projection matrix such that the system errors in the whole parameter space could be minimized. This minimization problem is for… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(15 citation statements)
references
References 25 publications
0
15
0
Order By: Relevance
“…• SG and ST are intrusive solvers as they both directly compute the gPC coefficients by simulating a larger-size coupled DAE only once. With gPC approximations, they both start from the residual function (10). SG sets up a larger-size coupled deterministic model by Galerkin testing, whereas ST uses a collocation testing technique.…”
Section: Classification and Summarymentioning
confidence: 99%
“…• SG and ST are intrusive solvers as they both directly compute the gPC coefficients by simulating a larger-size coupled DAE only once. With gPC approximations, they both start from the residual function (10). SG sets up a larger-size coupled deterministic model by Galerkin testing, whereas ST uses a collocation testing technique.…”
Section: Classification and Summarymentioning
confidence: 99%
“…In fact, the exponential growth of the ROM size with respect to the parameter number and expansion order is an open question in parameterized MOR community. Although a recent optimization-based work [45] whose resulting ROM size is independent of the number of parameter has been proposed, no solution has been proposed for the time-delay cases. For the non-smooth parameter dependence, the optimization-based idea [45] can be used for systems without delay effects, and its ROM size is also independent of the number of parameters.…”
Section: Computational Complexity With Parameter Growthmentioning
confidence: 99%
“…Taylor expansion is not used in approximating the parameterized system matrices. This implies that passivity is preserved for the parameterized RLC interconnect model [54].…”
Section: Optimization Based Pmor Methodsmentioning
confidence: 96%
“…Consider a multi-parameter linear time invariant (LTI) fully parameterized dynamic system as given by the following relations [54] ( The objective of this method is to find a fully parameterized reduced order model of order q where q << n, which approximates the characteristics of the original system with a high degree of accuracy. The reduced order model can be given by the following set of equations [54] ( )( ) = ( ) ( ) + ( ) ( )…”
Section: Formulation Of Fully Parameterized Responsementioning
confidence: 99%
See 1 more Smart Citation