Design Optimization of Fluid Mechanical Systems using...

1
TEMPLATE DESIGN © 2008 www.PosterPresentations.com Design Optimization of Fluid Mechanical Systems using Reduced Order Models Matthew J. Zahr, David Amsallem, Charbel Farhat Stanford University A Reduced Order Model IS: a MODEL that is a low-dimensional approximation of some High-Dimensional Model (HDM) built on-top of a HDM A Reduced Order Model IS NOT: a simplification of the HDM a response surface Motivation/Introduction The incorporation of CFD-based optimization into the design of aircrafts would enable the automation of the iterative process that is currently driven by humans. This automation would enable the design of “better” aircrafts where the ordering of aircrafts is defined by some objective function. Unfortunately, full 3D CFD codes on industry-scale problems are too expensive to incorporate into an optimization loop, which may require thousands of iterations. This is where Reduced Order Models (ROMs) come into play. If we can construct a parametrically-robust ROM from only a few high-fidelity simulations and exploit this ROM throughout the design loop, there is potential for dramatic CPU savings. Model Order Reduction We are interested in the solution of the following system of ODEs which may come from the semi-discretization of a PDE or represent the governing equations of a discrete system. Full discretization (with a 1-step scheme) yields: This is Model I, the HDM. Now, we make the assumption that the solution lies in a low- dimensional affine subspace Substituting this into the discrete form, we reduced the number of unknowns resulting in an overdetermined system. To recover a square system of equations, we introduce the left bases and force the equations to be orthogonal to its columns, yielding This is Model II, the ROM. du dt = F (u, z ) R(u n+1 ,z ; u n )=0. u R N state variable z R p design variable u r R n y reduced coordinates. Ψ (i) Right Basis Construction u ¯ u + Φ (i) u r , i {1, 2,...,N v } Let be a collection of solution snapshots from the HDM under different design parameter configurations, for Cluster columns of into disjoint sets , e.g. kMeans. This also defines cluster centers: Reference the snapshots: Use Proper Orthogonal Decomposition on each to generate right bases . X R N ×n s z k k =1, 2,...,n. X N v X (1) ,..., X (N v ) X (i) Φ (i) X (i) X (i) ¯ ue T . Left Basis Choice Galerkin Approximation: “Optimal” for problems with SPD Jacobian Least-Square Petrov-Galerkin: “Optimal” for problems with non-SPD Jacobian Ψ (i) = Φ (i) Ψ (i) = R u (u, z )Φ (i) u (1) c ,...,u (N v ) c . Online Exploitation of ROM (LSPG) Suppose is the initial condition for the problem of interest, then the online ROM algorithm is: At step n, determine the cluster to which is closest. Call this cluster . Solve where using the iteration where This is the globally-convergent Gauss-Newton method applied to u 0 Collect Snapshots Cluster Snapshots Define Cluster Centers Discard Snapshots Run ROM simulation; Use “best” basis at each step i n u n Ψ (i) = R u (u, z )Φ (i) u n+1,k r = u n r + k1 i=1 p k Φ (i n ) T J T k J k Φ (i n ) p k = Φ (i n ) T J T k R k R k = Ru + Φ (i n ) u n+1,k r ,z ) J k = R u u + Φ (i n ) u n+1,k r ,z ). minimize y R p Ru + Φ (i) y,z ) 2 . = = = Pre-compute Linear System Schematic - LSPG To speed up the bottleneck in the ROM (the formation of the linear system), we approximate the residual and the action of the Jacobian on the reduced order basis as where This is Model III. The method is called Gauss-Newton Approximated Tensors (GNAT). Φ (i) R k Φ (i) r R r,k J k Φ (i) Φ (i) j J r,k R r,k R n R , J r,k R n J ×n Y Φ (i) r R N ×n R , Φ (i) j R N ×n J . Linear System Schematic - LSPG + Hyperreduction PDE-Constrained Optimization Hyperreduction Let denote the discretization of a steady PDE, where q is the state variable and z is the parameter or design variable. Also, let denote the quantity we would like to minimize. Then, the problem of interest is: Nested Analysis and Design (NAND) - Use to write and solve the unconstrained problem: Simultaneous Analysis and Design (SAND) - Solve the original nonlinear programming problem over state and design variables. R s (q,z )=0 L(q,z ) R s (q,z )=0 q = q (z ) minimize q,z L(q,z ) subject to : R s (q,z )=0. minimize z L(q (z ),z ) Applications Ψ (i) T Ru + Φ (i) u n+1 r ,z u + Φ (j ) u n r )=0. Ψ (i n ) T Ru + Φ (i n ) u n+1 r ,z u + Φ (i n1 ) u n r )=0 100 200 300 400 500 600 700 800 900 1000 1 2 3 4 Time (sec) Cluster Number Clustering of Snapshots Clusters before overlap Clusters after overlap 0 10 20 30 40 50 60 70 80 90 100 1 1.5 2 2.5 3 3.5 4 x U Cluster Centers NV =4,u (1) c NV =4,u (2) c NV =4,u (3) c NV =4,u (4) c 0 10 20 30 40 50 60 70 80 90 100 0.5 1 1.5 2 2.5 3 3.5 4 4.5 x U Comparison of Model I, II, and III for Burger’s Equation HDM ROM - NV = 4, ¯ u = u 0 ROM + GNAT - ¯ u = u 0 5 10 15 20 25 30 35 40 45 50 1% 10% 100% Time (sec) Average Relative L2 Error in State Comparison of Affine Offsets NV = 4, ¯ u = u 0 NV = 4, ¯ u = u n-1 NV = 4, ¯ u =0 NV = 4, ¯ u = u init ,j (Online Update) NV = 4, ¯ u = u init ,j (Exact) u t + u u x =0.02e 0.02x u(t, 0) = 5 u(0,x)=1 Burger’s Equation Potential Nozzle Flow References 1D Nozzle Problem with flow governed by potential equations Nozzle shape parametrized by cubic splines with 10 control points Parameter estimation NAND PDE-optimization framework HDM has 10,000 dof ROM uses 4 local bases of size 20, 14,10, and 4, respectively [1] David Amsallem, Matthew J. Zahr, and Charbel Farhat. Nonlinear model order reduction based on local reduced-order bases. International Journal for Numerical Methods in Engineering, 2012. [2] K. Carlberg, C. Farhat, and C. Bou-Mosleh. Ecient Nonlinear Model Reduction via a Least-Squares Petrov-Galerkin Projection and Compressive Tensor Approximations. International Journal for Numerical Methods in Engineering, in press, May 2010. [3] Michal Jerzy Rewienski. A Trajectory Piecewise-Linear Approach to Model Order Reduc- tion of Nonlinear Dynamical Systems. PhD thesis, Massachusetts Institute of Technology, 2003. [4] Kyle Washabaugh, David Amsallem, Matthew Zahr, and Charbel Farhat. Nonlinear model reduction for cfd problems using local reduced order bases. In 42nd AIAA Fluid Dynamics Conference and Exhibit, New Orleans, LA, June 25-28 2012. 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 0 0.5 1 1.5 2 2.5 Nozzle Optimization - Mach x Mach Optimal Solution Initial Guess Optimization Output 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Nozzle Optimization - Shape x Area Optimal Solution Initial Guess Optimization Output

Transcript of Design Optimization of Fluid Mechanical Systems using...

Page 1: Design Optimization of Fluid Mechanical Systems using ...math.lbl.gov/~mjzahr/content/posters/zahr2012csgf-poster.pdf · 2 2.5 3 3.5 x U Cluster Centers N V =4,u (1) c N V =4,u (2)

TEMPLATE DESIGN © 2008

www.PosterPresentations.com

Design Optimization of Fluid Mechanical Systems using Reduced Order ModelsMatthew J. Zahr, David Amsallem, Charbel Farhat

Stanford University

A Reduced Order Model IS:• a MODEL that is a low-dimensional approximation of some

High-Dimensional Model (HDM)• built on-top of a HDM

A Reduced Order Model IS NOT:• a simplification of the HDM• a response surface

Motivation/Introduction

The incorporation of CFD-based optimization into the design of aircrafts would enable the automation of the iterative process that is currently driven by humans. This automation would enable the design of “better” aircrafts where the ordering of aircrafts is defined by some objective function. Unfortunately, full 3D CFD codes on industry-scale problems are too expensive to incorporate into an optimization loop, which may require thousands of iterations. This is where Reduced Order Models (ROMs) come into play. If we can construct a parametrically-robust ROM from only a few high-fidelity simulations and exploit this ROM throughout the design loop, there is potential for dramatic CPU savings.

Model Order Reduction

We are interested in the solution of the following system of ODEs

which may come from the semi-discretization of a PDE or represent the governing equations of a discrete system. Full discretization (with a 1-step scheme) yields:

This is Model I, the HDM.

Now, we make the assumption that the solution lies in a low-dimensional affine subspace

Substituting this into the discrete form, we reduced the number of unknowns resulting in an overdetermined system. To recover a square system of equations, we introduce the left bases and force the equations to be orthogonal to its columns, yielding

This is Model II, the ROM.

du

dt= F (u, z)

R(un+1, z;un) = 0.

u ∈ RN − state variable

z ∈ Rp − design variable

ur ∈ Rny − reduced coordinates.

Ψ(i)

Right Basis Construction

u ≈ u+ Φ(i)ur, i ∈ {1, 2, . . . , Nv}

• Let be a collection of solution snapshots from the HDM under different design parameter configurations, for

• Cluster columns of into disjoint sets , e.g. kMeans. This also defines cluster centers:

• Reference the snapshots:• Use Proper Orthogonal Decomposition on each to

generate right bases .

X ∈ RN×ns

zkk = 1, 2, . . . , n.

X Nv X(1), . . . ,X(Nv)

X(i)

Φ(i)

X(i) ← X(i) − ueT .

Left Basis Choice

• Galerkin Approximation:

‣ “Optimal” for problems with SPD Jacobian

• Least-Square Petrov-Galerkin:

‣ “Optimal” for problems with non-SPD Jacobian

Ψ(i) = Φ(i)

Ψ(i) =∂R

∂u(u, z)Φ(i)

u(1)c , . . . , u(Nv)

c .

Online Exploitation of ROM (LSPG)

Suppose is the initial condition for the problem of interest, then the online ROM algorithm is:• At step n, determine the cluster to which is closest. Call

this cluster .• Solve

where

using the iteration

where

This is the globally-convergent Gauss-Newton method applied to

u0

Collect Snapshots Cluster Snapshots Define Cluster Centers

Discard Snapshots Run ROM simulation; Use “best” basis at each step

in

un

Ψ(i) =∂R

∂u(u, z)Φ(i)

�un+1,kr = un

r +�k−1

i=1 pk�Φ(in)

�TJTk JkΦ(in)pk = −

�Φ(in)

�TJTk Rk

�Rk = R(u+ Φ(in)un+1,k

r , z)

Jk = ∂R∂u (u+ Φ(in)un+1,k

r , z).

minimizey∈Rp

������R(u+ Φ(i)y, z)

������2.

=

=

=

Pre-compute

Linear System Schematic - LSPG

To speed up the bottleneck in the ROM (the formation of the linear system), we approximate the residual and the action of the Jacobian on the reduced order basis as

where

This is Model III. The method is called Gauss-Newton Approximated Tensors (GNAT).

Φ(i)

�Rk ≈ Φ(i)

r Rr,k

JkΦ(i) ≈ Φ(i)j Jr,k

Rr,k ∈ RnR , Jr,k ∈ RnJ×nY

Φ(i)r ∈ RN×nR , Φ(i)

j ∈ RN×nJ .

Linear System Schematic - LSPG + Hyperreduction

PDE-Constrained Optimization

HyperreductionLet

denote the discretization of a steady PDE, where q is the state variable and z is the parameter or design variable. Also, letdenote the quantity we would like to minimize. Then, the problem of interest is:

• Nested Analysis and Design (NAND)- Use to write and solve the

unconstrained problem:

• Simultaneous Analysis and Design (SAND)- Solve the original nonlinear programming problem over state

and design variables.

Rs(q, z) = 0

L(q, z)

Rs(q, z) = 0 q = q(z)

minimizeq,z

L(q, z)

subject to : Rs(q, z) = 0.

minimizez

L(q(z), z)

Applications

�Ψ(i)

�TR(u+ Φ(i)un+1

r , z; u+ Φ(j)unr ) = 0.

�Ψ(in)

�TR(u+ Φ(in)un+1

r , z; u+ Φ(in−1)unr ) = 0

100 200 300 400 500 600 700 800 900 1000

1

2

3

4

Time (sec)

Clu

ster

Num

ber

Clustering of Snapshots

Clusters before overlap

Clusters after overlap

0 10 20 30 40 50 60 70 80 90 1001

1.5

2

2.5

3

3.5

4

x

U

Cluster Centers

NV = 4, u(1)c

NV = 4, u(2)c

NV = 4, u(3)c

NV = 4, u(4)c

0 10 20 30 40 50 60 70 80 90 1000.5

1

1.5

2

2.5

3

3.5

4

4.5

x

U

Compari son of Model I , I I , and I I I for Burger’ s Equation

HDM

ROM - NV = 4, u = u0

ROM + GNAT - u = u0

5 10 15 20 25 30 35 40 45 501%

10%

100%

Time (sec)

Ave

rage

Rel

ativ

eL

2E

rror

inSt

ate

Compari son of A!ne O"sets

NV = 4, u = u0

NV = 4, u = un!1

NV = 4, u = 0

NV = 4, u = uini t,j (Onl ine Update)

NV = 4, u = uini t,j (Exact)

∂u

∂t+ u

∂u

∂x= 0.02e0.02x

u(t, 0) =√5

u(0, x) = 1

Burger’s Equation

Potential Nozzle Flow

References

• 1D Nozzle Problem with flow governed by potential equations• Nozzle shape parametrized by cubic splines with 10 control points• Parameter estimation• NAND PDE-optimization framework

• HDM has 10,000 dof• ROM uses 4 local bases of size

20, 14,10, and 4, respectively

Bibtex

Matthew J. Zahr

Stanford University

July 18, 2012

[1] [2] [?] [?]

References

[1] David Amsallem, Matthew J. Zahr, and Charbel Farhat. Nonlinear model order reduction

based on local reduced-order bases. International Journal for Numerical Methods in

Engineering, 2012.

[2] K. Carlberg, C. Farhat, and C. Bou-Mosleh. Efficient Nonlinear Model Reduction via

a Least-Squares Petrov-Galerkin Projection and Compressive Tensor Approximations.

International Journal for Numerical Methods in Engineering, in press, May 2010.

[3] Michal Jerzy Rewienski. A Trajectory Piecewise-Linear Approach to Model Order Reduc-

tion of Nonlinear Dynamical Systems. PhD thesis, Massachusetts Institute of Technology,

2003.

[4] Kyle Washabaugh, David Amsallem, Matthew Zahr, and Charbel Farhat. Nonlinear

model reduction for cfd problems using local reduced order bases. In 42nd AIAA Fluid

Dynamics Conference and Exhibit, New Orleans, LA, June 25-28 2012.

1

0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 20

0.5

1

1.5

2

2.5Nozzle Optimization - Mach

x

Mac

h

Optimal Solution

Ini tial Guess

Optimization Output

0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 20.3

0.4

0.5

0.6

0.7

0.8

0.9

1Nozzle Optimization - Shape

x

Are

a

Optimal Solution

Ini tial Guess

Optimization Output