Linversion de la matrice globale de ce systme

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: o successive iterations. This δH is to be compared to the total head variation of 1 meter along the mean flow path. The 2D random seawater intrusion problem was solved on a 1000x1000 node grid. The total CPU time for the 10 continuation steps was on the order of one day on a PC Intel Pentium-4 processor, in double precision. Inside each continuation step, there are two interlooped solvers: (1) the inner loop is the iterative DSCG solver (stopping criterion δH < ε =10-9 (m), and ITER ≤ 1000); (2) the outer loop is the fixed point (Picard) iteration solver (stopping criterion δH < ε = 10-6 and ITER ≤ 20). In Fig. 1(b), the average number of iterations within each continuation step is 18596. However the actual number of iterations per step increases with successive steps. The problem is more difficult as σlnK increases. The continuation algorithm, as well as file management and graphic tasks, have been implemented as an option in the GUI application (BF-Py) under development for the BigFlow code. The BF-Py applicati...
View Full Document

This document was uploaded on 01/19/2014.

Ask a homework question - tutors are online