25
Model Reduction for Complex Hyperbolic Networks Christian Himpe ([email protected]) Mario Ohlberger ([email protected]) WWU Münster Institute for Computational and Applied Mathematics ECC’14 27.06.14

Model Reduction for Complex Hyperbolic Networks

  • Upload
    gramian

  • View
    150

  • Download
    1

Embed Size (px)

DESCRIPTION

held at ECC'14 - june 2014

Citation preview

Page 1: Model Reduction for Complex Hyperbolic Networks

Model Reductionfor Complex Hyperbolic Networks

Christian Himpe ([email protected])Mario Ohlberger ([email protected])

WWU MünsterInstitute for Computational and Applied Mathematics

ECC’1427.06.14

Page 2: Model Reduction for Complex Hyperbolic Networks

Hyperbolic Networks

Internet

source: clker.com

Social Networks

source: clker.com

Brain

source: clker.com

Causality Networks

Page 3: Model Reduction for Complex Hyperbolic Networks

Hyperbolic Network Attributes

Network grows over timesEach time step a new node is bornA newborn node connects preferably to older nodes

Side note on ambiguity:This is different from a control system with hyperbolic-tangentstate transformation!Also called “Hyperbolic Network”, but a different beast.

Page 4: Model Reduction for Complex Hyperbolic Networks

Hyperbolic Network Generation [Krioukov et al’12]

Each time step draw a node from uniform distribution on the circle:

xi = U(S1) = (U([0, 2π]), ri = 2 lniv)

The new node xi connects to all existing nodes for which:

rj + 2 ln(π − |π − |αi − αj ||) < 2, ∀j < i , j = 0 . . . i − 1

Page 5: Model Reduction for Complex Hyperbolic Networks

Space-Time Visualization

1

2

3

4

5

6

7

8

9

10

Time

Time

Page 6: Model Reduction for Complex Hyperbolic Networks

Relation to Linear Control Systems

Linear Dynamical System:

x(t) = A(t)x(t)

Time-Varying Parametrized Linear Control System:

x(t) = A(θ(t))x(t) + Bu(t)y(t) = Cx(t)

Page 7: Model Reduction for Complex Hyperbolic Networks

(Sample) Adjacency Matrix

-1

-0.5

0

0.5

1

-1 -0.5 0 0.5 1

Page 8: Model Reduction for Complex Hyperbolic Networks

(Projection-Based) Model Reduction

Large-Scale Control System:

State: dim(x)� 1

Input: dim(u)� dim(x)

Output: dim(y)� dim(x)

Projections U,V :

A = VAU, B = VB, C = CU, x0 = Vx0

Reduced Order Model:

˙x = Ax + Bu

y = C x

dim(x)� dim(x)

‖y − y‖ � 1

Page 9: Model Reduction for Complex Hyperbolic Networks

Gramian-Based State Reduction [Moore’81]

Controllability:

Controllability Gramian:

WC :=

∫ ∞0

eAtBBT eAT tdt

⇒ AWC + WCAT = −BBT

Observability:

Observability Gramian:

WO :=

∫ ∞0

eAT tCTCeAtdt

⇒WOAT + AWO = −CTC

→ Balanced Truncation

Page 10: Model Reduction for Complex Hyperbolic Networks

Cross Gramian [Fernando & Nicholson’83]

Cross Gramian:

WX :=

∫ ∞0

eAtBCeAtdt

1.⇒ AWX + WXA = −BC2.⇒W 2

X = WCWO

→ Approximate Balancing

System must be:1 square: #Inputs = #Outputs2 symmetric: CeAB = (CeAB)T

Page 11: Model Reduction for Complex Hyperbolic Networks

Non-Symmetric Cross Gramian [Sorensen & Antoulas’02]

Embedding into a Symmetric System:

J ∈ RN×N , AJ = JAT

x = Ax +(JCT B

)u′

y ′ =(

CBT J−1

)x

Trivial Symmetrizer:

A = AT ⇒ J = 1

x = Ax +(CT B

)u′

y ′ =(

CBT

)

Page 12: Model Reduction for Complex Hyperbolic Networks

Parameter Identification [Geffen’08, H.’14]

Parameter Augmented System:(xθ

)=

(A 00 0

)(xθ

)+

(B0

)u

y =(C 0

)(xθ

)(

x(0)θ(0)

)=

(x0θ0

)Joint Gramian (Cross Gramian of Parameter Augmented System):

WJ =

(WX WM0 0

)Cross-Identifiability Gramian (Schur Complement of Symmetric Part ofJoint Gramian):

WI := −12WM(WX + W T

X )−1W TM

Page 13: Model Reduction for Complex Hyperbolic Networks

Combined Reduction [H.’14]

Parameter Reduction:

WISVD= UDV T

→ U =

(U1U2

)Reduced Parameters:

θ = U1θ

State Reduction:

WXSVD= UDV T

→ U =

(U1U2

)State-Reduced System:

A = UT1 AU1

B = UT1 B

C = CU1

x0 = UT1 x0

Page 14: Model Reduction for Complex Hyperbolic Networks

Empirical Gramians

System Gramians:

WC =

∫ ∞0

(eAtB) (eAtB)Tdt

WO =

∫ ∞0

(eAT tCT ) (eAT tCT )Tdt

WX =

∫ ∞0

(eAtB) (eAT tCT )Tdt

Integrands are just impulse responses!

→ Compute gramians empirically.

(Empirical gramians can also be computed for nonlinear systems!)

Page 15: Model Reduction for Complex Hyperbolic Networks

Empirical Gramians [Lall et al’99]

Empirical Controllability Gramian

WC =

∫ ∞0

(eAtB) (eAtB)Tdt

W ′C (uδ) =

∫ ∞0

xuδ(t) xT

uδ(t)dt

W ′′C =

1|Uδ|

∑u∈Uδ

W ′C (u)

Empirical Observability Gramian

WO =

∫ ∞0

(eAT tCT ) (eAT tCT )Tdt

W ′O,(i,j)(x0) =

∫ ∞0

yTx0◦ei

(t) yx0◦ej (t)dt

W ′′O =

1|X0|

∑x∈X0

W ′O(x)

Page 16: Model Reduction for Complex Hyperbolic Networks

Empirical Cross Gramian [Streif et al’06, Streif’09, H.’14]

Empirical Cross Gramian

WX =

∫ ∞0

(eAtB) (eAT tCT )Tdt

W ′X ,(i ,j)(uδ, x0) =

∫ ∞0

eTi xuδ(t) f T

u yei◦x0(t)dt

W ′′X =

1|Uδ × X0|

∑u∈Uδ,x∈X0

W ′x(u, x)

Page 17: Model Reduction for Complex Hyperbolic Networks

Uncertainty Quantification

Uncertainty Quantification and Empirical Gramians

The perturbation sets for the empirical gramians are very flexible

Uncertainties can be incorporated into perturbation sets ( Uδ, X0 )

Thus uncertainties can be included with regards to:

InputsInitial StatesParameters (!)

Page 18: Model Reduction for Complex Hyperbolic Networks

Numerical Experiments

Sample Network:64 Nodes8 Inputs and Outputs2016 ParametersA = AT

Symmetric Parametrized Linear Time-Varying Control System:

x = A(θ(t))x +(CT B

)u′

y ′ =(

CBT

)x

Page 19: Model Reduction for Complex Hyperbolic Networks

System Matrix

Page 20: Model Reduction for Complex Hyperbolic Networks

emgr - Empirical Gramian Framework

Gramians:Empirical Controllability GramianEmpirical Observability GramianEmpirical Cross GramianEmpirical Linear Cross GramianEmpirical Sensitivity GramianEmpirical Identifiability GramianEmpirical Joint Gramian

Features:Uniform InterfaceCompatible with MATLAB & OCTAVE (& FREEMAT)Vectorized & ParallelizableOpen-Source licensed

More info at: http://gramian.de

Page 21: Model Reduction for Complex Hyperbolic Networks

Numerical Results (Singular Values)

10 20 30 40 50 6010

−15

10−10

10−5

100

Singular Value

Sta

te

Figure: Cross Gramian SingularValues

10 20 30 40 50 60 70 80 90 10010

−18

10−16

10−14

10−12

10−10

10−8

10−6

10−4

10−2

100

Singular ValueP

ara

me

ter

Figure: First 100 Cross-IdentifiabilityGramian Singular Values

Page 22: Model Reduction for Complex Hyperbolic Networks

Numerical Results (Impulse Response)

Time

Sta

tes

10 20 30 40 50 60 70 80 90 100

1

2

3

4

5

6

7

8

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

1.1

1.2

1.3

Figure: Full-Order Model ImpulseResponse

TimeS

tate

s

10 20 30 40 50 60 70 80 90 100

1

2

3

4

5

6

7

8

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

1.1

1.2

1.3

Figure: Reduced Order ModelImpulse Response

Page 23: Model Reduction for Complex Hyperbolic Networks

Numerical Results (Comparison)

Time

Rela

tive E

rror

10 20 30 40 50 60 70 80 90 100

1

2

3

4

5

6

7

8

2

4

6

8

10

12

14

x 10−4

Original Time [s]: 0.0216Offline Time [s]: 128.2395Online Time [s]: 0.0143

Relative L2-Error: 0.00034Memory Reduction: 85%

Page 24: Model Reduction for Complex Hyperbolic Networks

Related Work

We are using Empirical Gramians also for:Combined Reduction for Connectivity Analysis of fMRI/fNIRS,EEG/MEG dataParameter Identification for EEG/MEG modelsModel Order Reduction for Dynamic Causal Modeling

Approach:C. Himpe and M. Ohlberger, "Cross-Gramian Based CombinedState and Parameter Reduction for Large-Scale ControlSystem", Mathematical Problems in Engineering (Accepted),2014.

Page 25: Model Reduction for Complex Hyperbolic Networks

tl;dl

Empirical Cross Gramian

Empirical Joint Gramian (Cross-Identifiability Gramian)

Non-Symmetric Parametrized Time-Varying Linear Control System

Preprint: http://arxiv.org/pdf/1310.0761

Source Code: http://j.mp/ecc14_code

emgr 2.2: http://gramian.de

Thanks!