Efficient Wavefield Simulators Based on Krylov Model-Order Reduction - - PowerPoint PPT Presentation

efficient wavefield simulators based on krylov model
SMART_READER_LITE
LIVE PREVIEW

Efficient Wavefield Simulators Based on Krylov Model-Order Reduction - - PowerPoint PPT Presentation

Introduction Basic equations Lanczos algorithms PML Efficient Wavefield Simulators Based on Krylov Model-Order Reduction Techniques From Resonators to Open Domains Rob Remis Delft University of Technology November 3, 2017 ICERM Brown


slide-1
SLIDE 1

Introduction Basic equations Lanczos algorithms PML

Efficient Wavefield Simulators Based on Krylov Model-Order Reduction Techniques

From Resonators to Open Domains

Rob Remis Delft University of Technology

November 3, 2017 – ICERM Brown University 1

slide-2
SLIDE 2

Introduction Basic equations Lanczos algorithms PML

Thanks

A special thanks to Mikhail Zaslavsky, Schlumberger-Doll Research J¨

  • rn Zimmerling, Delft University of Technology

and Vladimir Druskin, Schlumberger-Doll Research

2

slide-3
SLIDE 3

Introduction Basic equations Lanczos algorithms PML

Happy birthday

Happy birthday Vladimir!

3

slide-4
SLIDE 4

Introduction Basic equations Lanczos algorithms PML

Introduction

Back in the day (late 80s, early 90s)

SLDM: Spectral Lanczos Decomposition Method Fast convergence for parabolic (diffusion) equations Applicable to lossless (hyperbolic) wave equation as well Not many advantages compared with explicit time-stepping (FDTD)

4

slide-5
SLIDE 5

Introduction Basic equations Lanczos algorithms PML

Main research question

What happens if we include losses? Lossy wavefield systems Perfectly Matched Layers (PML, after 1994)

5

slide-6
SLIDE 6

Introduction Basic equations Lanczos algorithms PML

Basic equations

First-order lossless wavefield system (D + M∂t) F = −w(t)Q Plus initial conditions Dirichlet boundary conditions (no PML) included Lossy wavefield system (D + S + M∂t) F = −w(t)Q

6

slide-7
SLIDE 7

Introduction Basic equations Lanczos algorithms PML

Maxwell’s equations

Field vector F = [Ex, Ey, Ez, Hx, Hy, Hz]T Source vector Q = [Jsp

x , Jsp y , Jsp z , K sp x , K sp y , K sp z ]T

7

slide-8
SLIDE 8

Introduction Basic equations Lanczos algorithms PML

Maxwell’s equations

Medium matrices M = ε µ

  • and

S = σ

  • 8
slide-9
SLIDE 9

Introduction Basic equations Lanczos algorithms PML

Maxwell’s equations

Differentiation matrix D = −∇× ∇×

  • Signature matrix

δ− = diag(1, 1, 1, −1, −1, −1)

9

slide-10
SLIDE 10

Introduction Basic equations Lanczos algorithms PML

Basic equations

Spatial discretization (D + S + M∂t) f = −w(t)q Order of this system can be very large especially in 3D Discretized counterpart of δ− is denoted by d−

10

slide-11
SLIDE 11

Introduction Basic equations Lanczos algorithms PML

Basic equations

Medium matrices (isotropic media)

S diagonal and semipositive definite M diagonal and positive definite

Differentiation matrix

W step size matrix = diagonal and positive definite Symmetry property DTW = −WD

11

slide-12
SLIDE 12

Introduction Basic equations Lanczos algorithms PML

Basic equations

System matrix for lossless media: A = M−1D System matrix for lossy media: A = M−1(D + S) Evolution operator = exp(−At)

12

slide-13
SLIDE 13

Introduction Basic equations Lanczos algorithms PML

Basic equations

Lossless media: A is skew-symmetric w.r.t. WM Evolution operator is orthogonal w.r.t. WM Inner product and norm x, y = yHWMx x = x, x1/2 Stored field energy in the computational domain 1 2f 2 Initial-value problem: norm of f is preserved

13

slide-14
SLIDE 14

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

Lossless media: construct SLDM field approximations via Lanczos algorithm for skew-symmetric matrices FDTD can be written in a similar form as Lanczos algorithm recurrence relation for FDTD = recurrence relation for Fibonacci polynomials

14

slide-15
SLIDE 15

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

Lanczos recurrence coefficients: βi Comparison with FDTD: 1/βi = time step of Lanczos Automatic time step adaptation – no Courant condition

15

slide-16
SLIDE 16

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

Lossy media: system matrix A = M−1(D + S) is no longer skew-symmetric Introduce dp = 1 2(I + d−) and dm = 1 2(I − d−)

16

slide-17
SLIDE 17

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

Special case: S = ξdp σ(x) = ξε(x) for all x belonging to computational domain Exploit shift invariance of Lanczos decomposition Basis for lossless media can be used to describe wave propagation for lossy media (in this special case)

17

slide-18
SLIDE 18

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

Not possible for general lossy media Matrix D is symmetric with respect to Wd− DTWd− = Wd−D System matrix A is symmetric w.r.t. WMd−

18

slide-19
SLIDE 19

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

System matrix A is symmetric w.r.t. bilinear form x, y = yHWMd−x Free-field Lagrangian 1 2f , f

19

slide-20
SLIDE 20

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

Write f = f (q) to indicate that the field is generated by a source q Reciprocity:

Source vector: q = dpq, receiver vector r = dpr f (q), r = q, f (r) Source vector: q = dpq, receiver vector r = dmr f (q), r = −q, f (r)

20

slide-21
SLIDE 21

Introduction Basic equations Lanczos algorithms PML

Lanczos algorithms

SLDM field approximations for lossy media can be constructed via modified Lanczos algorithm Modified Lanczos algorithm = Lanczos algorithm for symmetric matrices with inner product replaced by bilinear form Modified Lanczos algorithm can also be obtained from two-sided Lanczos algorithm Can the modified Lanczos algorithm breakdown in exact arithmetic?

21

slide-22
SLIDE 22

Introduction Basic equations Lanczos algorithms PML

PML

No outward wave propagation has been included up to this point Implementation via Perfectly Matched Layers (PML) Coordinate stretching (Laplace domain) ∂k ← → χ−1

k ∂k

k = x, y, z Stretching function χk(k, s) = αk(k) + βk(k) s

22

slide-23
SLIDE 23

Introduction Basic equations Lanczos algorithms PML

PML

Stretched first-order system

  • D(s) + S + sM

ˆ F = − ˆ w(s)Q Direct spatial discretization

  • D(s) + S + sM

ˆ f = − ˆ w(s)q Leads to nonlinear eigenproblems for spatial dimensions > 1

23

slide-24
SLIDE 24

Introduction Basic equations Lanczos algorithms PML

PML

Linearization of the PML Spatial finite-difference discretization using complex PML step sizes (Dcs + S + sM) fcs = −w(s)q System matrix Acs = M−1(Dcs + S)

  • V. Druskin and R. F. Remis, “A Krylov stability-corrected coordinate stretching method to simulate wave

propagation in unbounded domains,” SIAM J. Sci. Comput., Vol. 35, 2013, pp. B376 – B400.

  • V. Druskin, S. G¨

uttel, and L. Knizhnerman, “Near-optimal perfectly matched layers for indefinite Helmholtz problems,” SIAM Rev. 58-1 (2016), pp. 90 – 116. 24

slide-25
SLIDE 25

Introduction Basic equations Lanczos algorithms PML

PML

What about the spectrum of the system matrix?

Re(λ) Im(λ) Lossless resonator

25

slide-26
SLIDE 26

Introduction Basic equations Lanczos algorithms PML

PML

Eigenvalues move into the complex plane

Re(λ) Im(λ) Complex scaling

26

slide-27
SLIDE 27

Introduction Basic equations Lanczos algorithms PML

PML

Stable part of the spectrum

Re(λ) Im(λ) Stable part

27

slide-28
SLIDE 28

Introduction Basic equations Lanczos algorithms PML

PML

Stability correction

Re(λ) Im(λ) Stable part

28

slide-29
SLIDE 29

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

Time-domain stability-corrected wave function f (t) = −w(t) ∗ 2η(t)Re

  • η(Acs) exp(−Acst)q
  • Complex Heaviside unit step function

η(z) =

  • 1

Re(z) > 0 Re(z) < 0

29

slide-30
SLIDE 30

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

Frequency-domain stability-corrected wave function ˆ f (s) = − ˆ w(s)

  • r(Acs, s) + r( ¯

Acs, s)

  • q

with r(z, s) = η(z) z + s Note that ˆ f (¯ s) = ¯ ˆ f (s) and the stability-corrected wave function is a nonentire function of the system matrix Acs

30

slide-31
SLIDE 31

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

Symmetry relations are preserved With a step size matrix W that has complex entries These entries correspond to PML locations

31

slide-32
SLIDE 32

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

Stability-corrected wave function cannot be computed by FDTD SLDM field approximations via modified Lanczos algorithm Reduced-order model fm(t) = −w(t) ∗ 2M−1qη(t)Re [Vmη(Hm) exp(−Hmt)e1]

32

slide-33
SLIDE 33

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

m = 300

0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 x 10

−13

−1 −0.8 −0.6 −0.4 −0.2 0.2 0.4 0.6 0.8 1 x 10

8

Time [s] Electric Field Strength [V/m]

33

slide-34
SLIDE 34

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

m = 400

0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 x 10

−13

−8 −6 −4 −2 2 4 6 8 x 10

7

Time [s] Electric Field Strength [V/m]

34

slide-35
SLIDE 35

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

m = 500

0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 x 10

−13

−8 −6 −4 −2 2 4 6 8 x 10

7

Time [s] Electric Field Strength [V/m]

35

slide-36
SLIDE 36

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

Photonic crystal

36

slide-37
SLIDE 37

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

m = 1000 vs. 8200 FDTD iterations

0.5 1 1.5 2 2.5 3 3.5 4 x 10

−13

−5 −4 −3 −2 −1 1 2 3 4 5 x 10

8

Time [s] Electric Field Strength [V/m]

37

slide-38
SLIDE 38

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

m = 2000 vs. 8200 FDTD iterations

0.5 1 1.5 2 2.5 3 3.5 4 x 10

−13

−5 −4 −3 −2 −1 1 2 3 4 5 x 10

8

Time [s] Electric Field Strength [V/m]

38

slide-39
SLIDE 39

Introduction Basic equations Lanczos algorithms PML

Stability-Corrected Wave Function

m = 3000 vs. 8200 FDTD iterations

0.5 1 1.5 2 2.5 3 3.5 4 x 10

−13

−5 −4 −3 −2 −1 1 2 3 4 5 x 10

8

Time [s] Electric Field Strength [V/m]

39

slide-40
SLIDE 40

Introduction Basic equations Lanczos algorithms PML

Extensions

Approach has been extended for dispersive media in

  • J. Zimmerling, L. Wei, H. Urbach, and R. Remis, A Lanczos

model-order reduction technique to efficiently simulate electromagnetic wave propagation in dispersive media, Journal

  • f Computational Physics, Vol. 315, pp. 348 – 362, 2016.

Extended Krylov subspace implementations are discussed in

  • V. Druskin, R. Remis, and M. Zaslavsky, Journal of

Computational Physics, Vol. 272, pp. 608 – 618, 2014.

40

slide-41
SLIDE 41

Introduction Basic equations Lanczos algorithms PML

Current and future work

Rational Krylov field approximations

No stability-correction required

Phase-preconditioned rational Krylov methods

Large travel times

More on this in the coming week!

41

slide-42
SLIDE 42

Introduction Basic equations Lanczos algorithms PML

Thank you for your attention!

42