Anonymous
×
Create a new article
Write your page title here:
We currently have 106 articles on MOR Wiki. Type your article name above or click on one of the titles below and start writing!




Benchmark Model Templates

This page specifies templates for the types of models used as benchmark systems. In particular, the naming schemes established here are used in the corresponding data sets for all benchmarks. For example, A always serves as the name of the component matrix applied to the state x(t) in a linear time-invariant system. For all models we assume an input u:m, with components uj,j=1,,m, a state x:n, and an output y:q. For all parametric models, we assume each component has parameters; in cases where a component has fewer than parameters, the extras are treated as 0. Some benchmarks (e.g., Bone Model) have a constant forcing term, in which case, it is assumed that u(t) is identically 1.

Linear Time-Invariant First-Order System (LTI-FOS)

Ex˙(t)=Ax(t)+Bu(t),y(t)=Cx(t)+Du(t),

with

En×n, An×n, Bn×m, Cq×n, Dq×m.

Linear Time-Varying First-Order System (LTV-FOS)

E(t)x˙(t)=A(t)x(t)+B(t)u(t),y(t)=C(t)x(t)+D(t)u(t),

with

E:n×n, A:n×n, B:n×m, C:q×n, D:q×m.

Quadratic-Bilinear System (QBS)

Ex˙(t)=Ax(t)+Hx(t)x(t)+j=1mNjx(t)uj(t)+Bu(t),y(t)=Cx(t)+Du(t),

with

En×n, An×n, Hn×n2, Njn×n, Bn×m, Cq×n, Dq×m.

Nonlinear Time-Invariant First-Order System (NLTI-FOS)

Ex˙(t)=Ax(t)+f(x(t),u(t))+Bu(t),y(t)=Cx(t)+Du(t),

with

En×n, An×n, Bn×m, Cq×n, Dq×m, f:n×mn.

Affine Parametric LTI-FOS (AP-LTI-FOS)

(E+i=1piEEi)x˙(t)=(A+i=1piAAi)x(t)+(B+i=1piBBi)u(t),y(t)=(C+i=1piCCi)x(t),

with

E,Ein×n; A,Ain×n; B,Bin×m; and C,Ciq×n, for all i=1,,.

Second-Order System

Mx¨(t)+Ex˙(t)+Kx(t)=Bu(t),y(t)=Cpx(t)+Cvx˙(t)+Du(t),

with

Mn×n, En×n, Kn×n, Bn×m, Cp,Cvq×n, Dq×m.

When Cv=0, we denote C=Cp.

Nonlinear Second-Order System

Mx¨(t)+Ex˙(t)+Kx(t)=Bu(t)+Ff(x(t),u(t)),y(t)=Cpx(t)+Cvx˙(t)+Du(t),

with

Mn×n, En×n, Kn×n, Bn×m, Fn×n, Cp,Cvq×n, Dq×m, f:n×mn.

When Cv=0, we denote C=Cp.

Affine Parametric Second-Order System

(M+i=1piMMi)x¨(t)+(E+i=1piEEi)x˙(t)+(K+i=1piKKi)x(t)=(B+i=1piBBi)u(t),y(t)=(C+i=1piCCi)x(t),

with

M,Min×n; E,Ein×n; K,Kin×n; B,Bin×m; and C,Ciq×n, for all i=1,,.