• 沒有找到結果。

(2) can be written as Dx(i+1

N/A
N/A
Protected

Academic year: 2022

Share "(2) can be written as Dx(i+1"

Copied!
4
0
0

加載中.... (立即查看全文)

全文

(1)

師大 Successive Over Relaxation (SOR) Method Symmetric Successive Over Relaxation (SSOR) Method

The single-step method (SSM)

(D + L)x(i+1)= −U x(i)+ b can be written in the form

x(i+1) = x(i)+{−D−1Lx(i+1)−D−1U x(i)+D−1b−x(i)} := x(i)(i). (1) Consider a general form of (1)

x(i+1)= x(i)+ ων(i) (2)

with constant ω. (2) can be written as

Dx(i+1) = Dx(i)− ωLx(i+1)− ωU x(i)+ ωb − ωDx(i). Then

x(i+1) = (D + ωL)−1[(1 − ω)D − ωU ] x(i)+ ω(D + ωL)−1b.

(3) Hence the iteration matrix

Tω = (D + ωL)−1[(1 − ω)D − ωU ] .

(2)

師大 Successive Over Relaxation (SOR) Method Symmetric Successive Over Relaxation (SSOR) Method

These methods is called for

ω < 1: under relaxation, ω = 1: single-step method,

ω > 1: over relaxation. (In general: relaxation methods.)

(3)

師大 Successive Over Relaxation (SOR) Method Symmetric Successive Over Relaxation (SSOR) Method

Let A be symmetric and A = D + L + LT. The idea is in fact to implement the SOR formulationtwice,one forwardandone backward, at each iteration. That is, SSOR method defines

(D + ωL)x(k−12) = (1 − ω)D − ωLT x(k−1)+ ωb (4) (D + ωLT)x(k) = [(1 − ω)D − ωL] x(k−12)+ ωb. (5) Define

 Mω: = D + ωL,

Nω: = (1 − ω)D − ωLT. Then from the iterations (4) and (5), it follows that

xi+1 = Mω−TNωTMω−1Nω xi+ ω Mω−TNωTMω−1+ Mω−T b

≡ T (ω)xi+ M (ω)−1b.

(4)

師大 Successive Over Relaxation (SOR) Method Symmetric Successive Over Relaxation (SSOR) Method

But

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

= (−ωL − D − ωD + 2D)(D + ωL)−1+ I

= −I + (2 − ω)D(D + ωL)−1+ I

= (2 − ω)D(D + ωL)−1, Thus

M (ω)−1 = ω D + ωLT−1

(2 − ω)D(D + ωL)−1, then the splitting matrix is

M (ω) = 1

ω(2 − ω)(D + ωL)D−1 D + ωLT . The iteration matrix is

T (ω) = (D + ωLT)−1[(1 − ω)D − ωL] (D + ωL)−1(1 − ω)D − ωLT .

參考文獻

相關文件

[r]

『Philosophy is written in this grand book — I mean the universe — which stands continually open to our gaze, but it cannot be understood unless one first learns to comprehend

As shown in class, for one-dimensional data, the VC dimension of the decision stump model is 2.. In fact, the decision stump model is one of the few models that we could easily

Two optimization problems (P 1 ) and (P 2 ) are equivalent if the optimal solution of one problem can be transformed to that of the other so that solving one the problems also gives

(Note that the representation theorem concludes that each one linear transformation can be represented by a unique matrix up to the. considering

• When light is refracted into two rays each polarized with the vibration directions.. oriented at right angles to one another, and traveling at

Remark: Master students should take the course “Trend of Mathematics Research” as one of the required courses. The course should be completed in 3 semesters and is counted as 1

for the short essay, you can aim for two, and for longer essays, four is acceptable), each limited to one central idea/ or string of ideas that supports your thesis. You should