CFD lecture 17 - Computational Fluid Dynamics Lecture 17...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Computational Fluid Dynamics Lecture 17 Stopping Criteria Continued There is a solution that is as accurate as possible with a given difference equation and grid. The number of iterations required to improve the solution one decimal place (for the Jacobi scheme) is approximately () 10 1 10 1 log 0.1 where log m λ = is the largest eigenvalue of the error propogation matrix. ( ) 1 1 1 1 1 4 if 0.5 22 if 0.9 230 if 0.99 2302 if 0.999 or the iteration matrix. kk k k m e e BAe I BA e RIB A + = = = = = =− KK K K R is the convergence factor 1 1 1 L k kk j j j e a + + = == KK j x K eR . For example, for a 2-D problem with 100, 100 xy NN = = it takes many more iterations than for with for the Jacobi scheme it should take: 10, 10 100 1 10 10 46 0.951057 100 100 4666 0.99507 1000 1000 466,601 0.999995 10 100 2,365 0.999027 50 100 2,916 0.999211 50 1000 233,922 0.999990 m asymptotic results Initial convergence is faster than asymptotic result. This is an upper bound. If the error is in the direction of a smaller eigenvalue then convergence will be faster.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/08/2011 for the course EOC 6850 taught by Professor Slinn during the Spring '07 term at University of Florida.

Page1 / 3

CFD lecture 17 - Computational Fluid Dynamics Lecture 17...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online