Manifold Construction and Parameterization for Nonlinear - - PowerPoint PPT Presentation

manifold construction and parameterization for nonlinear
SMART_READER_LITE
LIVE PREVIEW

Manifold Construction and Parameterization for Nonlinear - - PowerPoint PPT Presentation

Manifold Construction and Parameterization for Nonlinear Manifold-Based Model Reduction Chenjie Gu and Jaijeet Roychowdhury {gcj,jr}@eecs.berkeley.edu University of California, Berkeley ASPDAC 2010 Slide 1 Outline Background Background


slide-1
SLIDE 1

Slide 1

ASPDAC 2010

Manifold Construction and Parameterization for Nonlinear Manifold-Based Model Reduction

Chenjie Gu and Jaijeet Roychowdhury {gcj,jr}@eecs.berkeley.edu

University of California, Berkeley

slide-2
SLIDE 2

Slide 2

ASPDAC 2010

Outline

  • Background

Background

  • Introduction to MOR and maniMOR
  • Manifold construction and parameterization
  • Manifold construction using integral curves

Manifold construction using integral curves

  • DC manifold and the normalized integral curve equation
  • Ideal and almost-ideal manifold
  • Algorithm
  • Experimental results

Experimental results

  • Conclusion

Conclusion

slide-3
SLIDE 3

Slide 3

ASPDAC 2010

Background

slide-4
SLIDE 4

Slide 4

ASPDAC 2010

Model Order Reduction

d~ x dt = f(~ x) + B~ u(t) ~ y = C~ x ~ u(t)

Original system (size n)

d~ z dt = fr(~ z) + Br~ u(t)

~ y = Cr~ z

~ u(t)

Reduced system (size q)

v : ~ x 7! ~ z; ~ x 2 Rn;~ z 2 Rq; q ¿ n

slide-5
SLIDE 5

Slide 5

ASPDAC 2010

Low-order Linear Subspace

d dt 2 4 x1 x2 x3 3 5 = 2 4 ¡10 1 1 1 ¡1 1 ¡1 3 5 2 4 x1 x2 x3 3 5 + 2 4 1 3 5 u(t)

Low-order linear subspace Defined by x = V z

slide-6
SLIDE 6

Slide 6

ASPDAC 2010

Low-order Nonlinear Manifold

d dt 2 4 x1 x2 x3 3 5 = 2 4 ¡10 1 1 1 ¡1 1 ¡1 3 5 2 4 x1 x2 x3 3 5 ¡ 2 4 x2

1

3 5+ 2 4 1 3 5 u(t)

Low-order nonlinear manifold ManiMOR: MOR Based on Nonlinear Projection on Nonlinear Manifolds

slide-7
SLIDE 7

Slide 7

ASPDAC 2010

Key Steps in ManiMOR

“Find” the nonlinear manifold Find” the nonlinear manifold

  • Capture important dynamics

“Parameterize” the manifold Parameterize” the manifold

  • Build up the coordinate system
slide-8
SLIDE 8

Slide 8

ASPDAC 2010

Manifold and Its Parameterization

8 < : x = cos(t) y = sin(t) z = t

slide-9
SLIDE 9

Slide 9

ASPDAC 2010

Manifold and Its Parameterization

M

U x Rq ~ U Ã

Tangent space TxM ½ Rn

z v

Parameterization of the manifold System of coordinates Manifold defined by pairs of fx; TxMg No explicit mapping may be derived. Instead, use piecewise linear approximation.

slide-10
SLIDE 10

Slide 10

ASPDAC 2010

Manifold and Its Parameterization

  • 1. Identify the manifold

that capture important dynamics

  • 2. Compute and store pairs of fx; TxMg=fz; TzMg
slide-11
SLIDE 11

Slide 11

ASPDAC 2010

DC Manifold

d~ x dt = f(~ x) + B~ u(t) = 0 DC operating points constitute a DC manifold. How to compute and parameterize the DC manifold?

slide-12
SLIDE 12

Slide 12

ASPDAC 2010

DC Manifold

Computation: Perform DC sweep analysis

f(~ x) + B~ u(t) = 0 A straight-forward solution:

Parameterization: Define coordinates using values of

z u

Problems:

Hard to choose step size in DC sweep analysis Not generalizable to higher dimensions

slide-13
SLIDE 13

Slide 13

ASPDAC 2010

Introduction to Integral Curve

v(x) Given a vector field , its integral curve is the curve such that

° ´ x(t)

dx dt = v(x)

slide-14
SLIDE 14

Slide 14

ASPDAC 2010

DC Manifold as an Integral Curve

Need to derive the relationship between and f(~ x) + B~ u(t) = 0 @f @x dx du + B = 0 dx du = ¡[G(x)]¡1B dx du

Initial condition: x(u = 0) = xDCju=0

Any numerical integration / transient analysis code can be applied.

Solutions are DC operating points.

The first Krylov basis.

slide-15
SLIDE 15

Slide 15

ASPDAC 2010

Parameterization using Euclidean Distance

(x1; y1) (x2; y2) (x3; y3) u0 u0 + h u0 + 2h Parameterization using values of u Parameterization using Euclidean Distance (x1; y1) (x2; y2) (x3; y3) u0 u0 + h u0 + 2h

Sample points equally spaced on the DC manifold

slide-16
SLIDE 16

Slide 16

ASPDAC 2010

Parameterization using Euclidean Distance

slide-17
SLIDE 17

Slide 17

ASPDAC 2010

Normalized Integral Curve Equation

dx du = ¡[G(x)]¡1B

Local Euclidean distance is

jjdxjj2 = jduj ¯ ¯ ¯ ¯ ¯ ¯ ¯ ¯ dx du ¯ ¯ ¯ ¯ ¯ ¯ ¯ ¯

2

= jj[G(x)]¡1Bjj2 = 1

Generally not satisfied

dx du = [G(x)]¡1B jj[G(x)]¡1Bjj2

Normalize RHS

Normalized Integral Curve Equation

Does it define the same integral curve?

slide-18
SLIDE 18

Slide 18

ASPDAC 2010

Validation

slide-19
SLIDE 19

Slide 19

ASPDAC 2010

Normalized Integral Curve Equation

Suppose ; and satisfy

d dtx(t) = g(x(t)) d d¿ ^ x(¿) = ¾0(¿)g(^ x(¿))

Then and span the same state space.

t = ¾(¿)

Theorem:

x(t) ^ x(¿)

and , respectively.

x(t) ^ x(¿)

Sketch of proof: Since , we have .

dt = ¾0(¿)d¿ t = ¾(¿) ^ x(¿) ´ x(t) = ^ x(¾(t))

Define , then

d d¿ ^ x(¿) = d^ x(¿) dt dt d¿ = ¾0(¿)g(x(t)) = ¾0(¿)g(^ x(¿))

slide-20
SLIDE 20

Slide 20

ASPDAC 2010

Normalized Integral Curve Equation

dx du = ¡[G(x)]¡1B dx du = [G(x)]¡1B jj[G(x)]¡1Bjj2 x(u)

Solution: Solution: ^

x(^ u)

Define u = ¾(^

u) = Z ^

u

1 jj[G(^ x(¹))]¡1Bjj2 d¹ From the theorem, and define the same integral curve. x(u) ^ x(^ u)

slide-21
SLIDE 21

Slide 21

ASPDAC 2010

Normalized Integral Curve Equation

dx du = [G(x)]¡1B jj[G(x)]¡1Bjj2

The first normalized Krylov basis.

Directly available from Krylov subspace methods. Generalizable to higher dimensions.

slide-22
SLIDE 22

Slide 22

ASPDAC 2010

Ideal Nonlinear Manifold

@x @z1 = v1(x); @x @z2 = v2(x); ¢ ¢ ¢ ; @x @zq = vq(x): V (x) = [v1(x); ¢ ¢ ¢ ; vq(x)]

is the projection matrix for the reduced linearized system (at ). x For example, Arnoldi algorithm generates a basis for

Kq([G(x)]¡1; B) = f[G(x)]¡1B; [G(x)]¡2B; ¢ ¢ ¢ ; [G(x)]¡qBg

However, this set of PDEs is over-determined.

slide-23
SLIDE 23

Slide 23

ASPDAC 2010

Almost-Ideal Manifold Construction

@x @z1 = v1(x) @x @z2 = v2(x) xDC @x @z3 = v3(x)

slide-24
SLIDE 24

Slide 24

ASPDAC 2010

Almost-Ideal Manifold Construction

slide-25
SLIDE 25

Slide 25

ASPDAC 2010

Experimental Results

slide-26
SLIDE 26

Slide 26

ASPDAC 2010

A Hand-Calculable Example

d dtx1 = ¡x1 + x2 ¡ u(t) d dtx2 = x2

1 ¡ x2

f(x) = · ¡x1 + x2 x2

1 ¡ x2

¸ ; B = · ¡1 ¸ G(x) = · ¡1 1 2x1 ¡1 ¸ ; [G(x)]¡1 = 1 2x1 ¡ 1 · 1 1 2x1 1 ¸

slide-27
SLIDE 27

Slide 27

ASPDAC 2010

DC and AC Manifold

DC manifold:

[G(x)]¡1 = 1 2x1 ¡ 1 · 1 1 2x1 1 ¸ ; B = · ¡1 ¸ w1(x) = [G(x)]¡1B = 1 2x1 ¡ 1 · 1 2x1 ¸ w2(x) = [G(x)]¡2B = 1 (2x1 ¡ 1)2 · ¡1 ¡ 2x1 ¡4x1 ¸ @x @z1 = v1(x) = w1(x) jjw1(x)jj2 @x @z1 = v2(x) = w2¡ < w2; v1 > v1 jjw2¡ < w2; v1 > v1jj2

AC manifold:

slide-28
SLIDE 28

Slide 28

ASPDAC 2010

DC and AC Manifold

slide-29
SLIDE 29

Slide 29

ASPDAC 2010

Application to MOR

d dt 2 4 x1 x2 x3 3 5 = 2 4 ¡10 1 1 1 ¡1 1 ¡1 3 5 2 4 x1 x2 x3 3 5 ¡ 2 4 x2

1

3 5 + 2 4 1 3 5 u(t)

Trajectory of the full system stays close to the manifold

slide-30
SLIDE 30

Slide 30

ASPDAC 2010

Simulation of the Reduced Order Model

Response to a step input Response to a sinusoidal input

slide-31
SLIDE 31

Slide 31

ASPDAC 2010

Conclusion

  • Presented a manifold construction and

Presented a manifold construction and parameterization procedure parameterization procedure

  • Based on computing integral curves
  • Preserves local distance
  • Captures important system responses
  • Such as DC and AC responses
  • Application to manifold-based MOR

Application to manifold-based MOR

  • Validated against several examples