0% found this document useful (0 votes)
5 views4 pages

Convergence Check for Iterative Methods

The document discusses methods for checking the convergence of iterative schemes, specifically focusing on the spectral radius of matrix M and its implications for the convergence of the Jacobi and Gauss-Seidel methods. It highlights that the convergence can be determined by checking if the spectral radius is less than one and whether the matrix is strictly diagonally dominant. Examples illustrate scenarios where the Jacobi method may converge while the Gauss-Seidel method does not, and vice versa.

Uploaded by

Locke Cole
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views4 pages

Convergence Check for Iterative Methods

The document discusses methods for checking the convergence of iterative schemes, specifically focusing on the spectral radius of matrix M and its implications for the convergence of the Jacobi and Gauss-Seidel methods. It highlights that the convergence can be determined by checking if the spectral radius is less than one and whether the matrix is strictly diagonally dominant. Examples illustrate scenarios where the Jacobi method may converge while the Gauss-Seidel method does not, and vice versa.

Uploaded by

Locke Cole
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Howtocheckaniterativeschemeisconvergent.

lu
[Link]/ui+[Link]
[Link]/t=kDWhethertheJacobinethodco nveges ?
A ) ⽔场
'"
A= D + (A -
D ) , D x
=
(D -

喴 ?)
吖㖄
( 㓡 (别
⼼ =

2
t
R 》 [Link] ⼊ ⼯ ) detl
临别 了 ⼆ ⼊ -

⼆ =

P1 ⼊) = 0 =) ⼊⼆ ± t

Jawbimethod e [Link] -[Link]


50 ,

: 9 1: ! 到 。

17 以上 det ( M ⼊⻔
- ⼆
⼊( ⼩ ⼟) = 犿 专⼊

p)
= 0 = ) ⼊⼆ 0 or 兰 .
)

[Link] notwrk
𣲚
[Link] [Link]
[Link]

[Link]
[Link]
b)

[Link] )
⼆⽉ 1 41 1 )
( 加 1 2
1 .
7 1 1

[Link]
恃 予 幸)
[Link] l
,

信 : 别 熈;
㖄 ⼆


[Link] -
江 ) = P t ⾔ ⼊ ⼀步 = 0

⼩ = -

0 8 1
.
3 ,
⼩ ⼆ 0 40 6
7 .
-
0 .
3 8 33 i = T .

[Link]
rges ,
[Link]
忙季 ⻔ ,
Aisnot SDD

嘰 : 或 1 ::) 爧 1
17 1 ⼊ ) ⼆
[Link]/u-XI)=0=1h=9Xz=o ,
⼩ ⼆

[Link]
[Link]?IfA,BElRandbothAandA-B-Bare
3 : Use

[Link]
[Link]
[Link]

[Link]/uxktb,whereM=DlD-N).IfweletA=2D-N,and 13 = D
-

N ,

" '

Then , (A -
1 )
3 B = 5 l D -
N)

[Link]
S ,

[Link]
Forthehaus -seidelmethod.t /t=zD-N,B=-LorU,thenwecancheckthe
[Link]
[Link]
geigenvector
[Link]/tBiBv=N=7-BFNA-B)V,=s-v*Bv=xv*Av-X
ÜBV
(iii)

ÜBFÈÜAV ,

吖 ⼆点
[Link]
[Link] 㖄 =
(六 哨

[Link]
⺊ ⼊ 1
2

nnn

> 0
,

[Link] ㄑ 1 .

You might also like