master thesis literature study presentation

62
Introduction Conjugate Gradient Method Deflation Domain Decomposition Research Master Thesis Literature Study Presentation Konrad Kaliszka Delft University of Technology The Faculty of Electrical Engineering, Mathematics and Computer Science January 29, 2010 Konrad Kaliszka Master Thesis Literature Study Presentation

Upload: others

Post on 04-Feb-2022

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Master ThesisLiterature Study Presentation

Konrad Kaliszka

Delft University of TechnologyThe Faculty of Electrical Engineering, Mathematics and

Computer ScienceJanuary 29, 2010

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 2: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

PlaxisFinite Element Method

Plaxis

Plaxis B.V. is a company specialized in finite element softwareintended for 2D and 3D analysis of deformation, stability and

groundwater flow in geotechnical engineering.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 3: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

PlaxisFinite Element Method

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 4: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

PlaxisFinite Element Method

Finite Element Method

The Finite Element Method (FEM) is a numerical technique forfinding approximate solutions of partial differential equations

(PDE).

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 5: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

PlaxisFinite Element Method

Example

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 6: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Conjugate Gradient Method

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 7: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Main problem

Solve:

Ax = b, (1)

where A ∈ Rn×n is SPD.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 8: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Basic Iterative Methods

Let us take

xi+1 = xi + M−1(b − Axi ) (2)

Which generates a sequence with the following property

xi ∈ x0 + spanM−1r0, M−1A(M−1r0), ..., (M

−1A)i−1(M−1r0).(3)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 9: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Conjugate Gradient Method

I Set M = I .

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 10: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Conjugate Gradient Method

I Set M = I .

I ||x − xi ||A = miny∈K i (A;r0) ||x − y ||A, for all i .

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 11: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

I Set M = I .

I ||x − xi ||A = miny∈K i (A;r0) ||x − y ||A, for all i .

Solution of the problem leads to the Conjugate Gradient Method.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 12: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Conjugate Gradient Algorithm

Choose x0, set i = 0, r0 = b − Ax0.

WHILE rk 6 =0 DO

i := i + 1

IF i = 0 DO

p1 = r0

ELSE

βi =rTi−1ri−1

rTi−2ri−2

pi = ri−1 + βi pi−1

ENDIF

αi =rTi−1ri−1

pTi

Api

xi = xi−1 + αi pi

ri = ri−1 − αi Api

END WHILE (4)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 13: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

TheoremLet A and x be the coefficient matrix and the solution of (1), andlet (xi , i = 0, 1, 2...) be the sequence generated by the CG method.Then, elements of the sequence satisfy the following inequality:

||x − xi ||A ≤ 2

(√κ(A)− 1√κ(A) + 1

)i

||x − x0||A, (5)

where κ(A) is the condition number of A in the 2 - norm.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 14: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Speed up?Yes, with preconditioning.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 15: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Transform the system (1) into

A∗x∗ = b∗, (6)

where A∗ = P−1AP−T , x∗ = P−T x and b∗ = P−1b, where P is anon-singular matrix. The SPD matrix M defined by M = PPT is

called the preconditioner.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 16: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Preconditioned Conjugate Gradient Algorithm

Choose x0, set i = 0, r0 = b − Ax0.

WHILE ri 6 =0 DO

zi = M−1ri

i := i + 1

IF i = 0 DO

p1 = z0

ELSE

βi =rTi−1zi−1

rTi−2zi−2

pi = zi−1 + βi pi−1

ENDIF

αi =rTi−1zi−1

pTi

Api

xi = xi−1 + αi pi

ri = ri−1 − αi Api

END WHILE (7)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 17: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

There are several possibilities for the preconditioner.Examples

I Jacobi, M - diag(A).

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 18: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

There are several possibilities for the preconditioner.Examples

I Jacobi, M - diag(A).

I SSOR, M = 12−ω ( 1

ωD + L)( 1ωD)−1( 1

ωD + L)T

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 19: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

There are several possibilities for the preconditioner.Examples

I Jacobi, M - diag(A).

I SSOR, M = 12−ω ( 1

ωD + L)( 1ωD)−1( 1

ωD + L)T

I Incomplete Cholesky

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 20: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

There are several possibilities for the preconditioner.Examples

I Jacobi, M - diag(A).

I SSOR, M = 12−ω ( 1

ωD + L)( 1ωD)−1( 1

ωD + L)T

I Incomplete Cholesky

I Many, many more.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 21: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

Second Simple Problem

Figure: Second Simple Problem Representation

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 22: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

0 100 200 300 400 500 600 700−10

−8

−6

−4

−2

0

2

4

Iteration step

log 10

(i−th

res

idue

)

CGCG with JacobiOfficial Approach with PreSSOR

Figure: Plot of log10 of i-th residue

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 23: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main Problem and Basic Iterative MethodsConjugate Gradient MethodConvergence of CGPrecondtioned Conjugate Gradient MethodNumerical Ilustration

0 50 100 150 20010

−4

10−3

10−2

10−1

100

101

Figure: Plot of log10 of eigenvalues

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 24: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

DEFLATION

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 25: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

How to get rid of unfavorableeigenvalues that deteriorate the

convergence of PCG?

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 26: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

Split

x = (I − PT )x + PT x , (8)

where,

P = I − AQ,

Q = ZE−1ZT

E = ZTAZ

and Z ∈ Rn×m. (9)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 27: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

After some transformation we get an equivalent, ”deflated” system:

PAx = Pb, (10)

which can be solved with CG or PCG.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 28: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

Deflated Preconditioned Conjugate Gradient Algorithm

Choose x0, set i = 0, r0 = P(b − Ax0).

WHILE rk 6 =0 DO

i := i + 1

IF i = 1 DO

y0 = M−1 r0

p1 = y0

ELSE

yi−1 = M−1 ri−1

βi =rTi−1yi−1

rTi−2yi−2

pi = yi−1 + βi pi−1

ENDIF

αi =rTi−1 ri−1

pTi

PApi

xi = xi−1 + αi pi

ri = ri−1 − αi PApi

END WHILE

xorginal = Qb + PT xlast (11)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 29: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

How to choose Z?

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 30: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

Several choices for Z:

I Approximated Eigenvector Deflation

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 31: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

Several choices for Z:

I Approximated Eigenvector Deflation

I Subdomain Deflation

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 32: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main ideaDeflated Preconditoned Conjugate Gradient MethodDeflation vector

Several choices for Z:

I Approximated Eigenvector Deflation

I Subdomain Deflation

I Rigid Body Mode Deflation

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 33: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Domain Decomposition

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 34: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

DefinitionWe will call a method a Domain Decomposition method, if itsmain idea will be based on the principle of divide and conquerapplied on the domain of the problem.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 35: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Figure: An example of domain decomposition

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 36: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

There are several ways to do it. The most known are:

I Schwarz Alternating Procedure

I Schur Complement

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 37: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Lets consider a domain as shown in the last figure with twooverlapping subdomains Ω1 and Ω2 on which we want to solve a

PDE of the following form:

Lu = b, in Ωu = g , on ∂Ω

. (12)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 38: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Schwarz Alternating Procedure

Choose u0

WHILE no convergence DO

FOR i = 1, ...s DO

Solve Lu = b in Ωi with u = uij in Γij

Update u values on Γij , ∀jEND FOR

END WHILE (13)

In our case, s = 2.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 39: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Within the SAP there are two distinguished variants

I Multiplicative Schwarz Method (MSM)

I Additive Schwarz Method (ASM)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 40: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Multiplicative Schwarz Method

un+1/2 = un +

[A−1

Ω10

0 0

](b − Aun)

un+1 = un+1/2 +

[0 0

0 A−1Ω2

](b − Aun+1/2) (14)

where AΩistays for the discrete form of the operator L restricted

to Ωi

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 41: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Additive Schwarz Method

un+1 = un +

([A−1

Ω10

0 0

]+

[0 0

0 A−1Ω2

])(b − Aun) (15)

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 42: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Additive Schwarz Method

Or in a more general:

Additive Schwarz Method

Choose u0, i = 0,

WHILE no convergence DO

ri = b − Aun

FOR i = 1, ...s DO

δi = Bi ri

END FOR

un+1 = un +s∑

i=1

δi

i = i + 1

END WHILE (16)

where Bi = Rti A−1

ΩiRi

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 43: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

Numerical Experiments

Figure: Domain Ω split into two subdomains, Ω1 and Ω2.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 44: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

MSM

Iteration step

Siz

e of

the

over

lap

5 10 15 20 25 30 35 401

2

3

4

5

6

7

8

9

10

−12

−10

−8

−6

−4

−2

0

Figure: Contour plot of the log10 (i-th residue) for MSM.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 45: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Main IdeaSchwarz Alternating ProcedureNumerical Experiments

ASM

Iteration step

Siz

e of

the

over

lap

5 10 15 20 25 30 35 401

2

3

4

5

6

7

8

9

10

−12

−10

−8

−6

−4

−2

0

2

Figure: Contour plot of the log10 (i-th residue) for ASM

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 46: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Research

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 47: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Choice of the method

DPCG with Additive Schwarz as the preconditoner and physicsbased decomposition.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 48: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

First Simple Problem

Figure: First Simple Problem Representation

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 49: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

0 10 20 30 40 50 60 70 80−12

−10

−8

−6

−4

−2

0

2

4

Iteration count

Log 10

(j−th

res

iduu

m)

Figure: First Simple Problem convergence behavior for PCG

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 50: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Analysis of the decomposition position

0

10

20

30

40

50

60

70

80

0 10 20 30 40 50 60 70 80

Iteration count

Siz

e of

firs

t sub

dom

ain

−10

−8

−6

−4

−2

0

2

Figure: First Simple Problem distribution of error in PCG

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 51: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Second Simple Problem

Figure: Second Simple Problem Representation

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 52: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

0 100 200 300 400 500 600 700 800−10

−8

−6

−4

−2

0

2

4

Iteration count

Log 10

(j−th

res

iduu

m)

Figure: Second Simple Problem convergence behavior for PCG with 2subdomains

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 53: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

0 100 200 300 400 500 600 700 800−10

−8

−6

−4

−2

0

2

4

Iteration count

Log 10

(j−th

res

iduu

m)

Figure: Second Simple Problem convergence behavior for PCG with 4subdomains

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 54: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

0 100 200 300 400 500 600 700 800−10

−8

−6

−4

−2

0

2

4

Iteration count

Log 10

(j−th

res

iduu

m)

Figure: Second Simple Problem convergence behavior for PCG with 8subdomains

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 55: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Iteration count

20 40 60 80 100 120 140 160 180 200

600

500

400

300

200

100

0

705

−8

−6

−4

−2

0

2

Figure: Second Simple Problem distribution of error in PCG

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 56: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

I The choice of the method is right.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 57: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

I The choice of the method is right.

I Number and size of the subdomains matters.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 58: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

I The choice of the method is right.

I Number and size of the subdomains matters.

I Introduction of deflation.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 59: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Research Goals

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 60: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Research Questions

I Subdomain overlap.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 61: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

Research Questions

I Subdomain overlap.

I Performance of Deflation.

Konrad Kaliszka Master Thesis Literature Study Presentation

Page 62: Master Thesis Literature Study Presentation

IntroductionConjugate Gradient Method

DeflationDomain Decomposition

Research

Choice of methodTest ProblemsConclusionsResearch Goals

The End

Konrad Kaliszka Master Thesis Literature Study Presentation