Quote:
I used to work on faces ... I defined a local system on the face, two unit vectors normal and tangential to the face. Then I fix a convention, for example the right cell sees the normal outward oriented. Then check for each couple of cells the right orientation 
Quote:
Thank you for sharing your precious experience. I have some questions ensued. 1st When I loop over faces, then, do I have to treat Diagonal, Lower, Upper components, i.e., , as an array in order to sweep? (I guess it's 1D in which each component has the sum of lower/upper update flux and linearized Jocobiansspectral radii around a cell) Or, then, how can I sweep along face to update solution with scalar variables? The reason why I tried to use cell loop was I expect that I can make sweeps with scalar value of D, L, U(L, U are to be sum of fluxs) for each cell with this approach only. I have no idea of making sweeps with scalar variables(D, L, U) for face based. From my understanding, LUSGS scheme's feature is to update solution with scalar values D, L, U. (Exactly speaking, they are vectors composed with conservative variablessize 4 for euler 2d.) 2nd For a structured solver, it seems clear that where a ghost cell's properties effect treated, L or U. Because there are explicit relation between a cell and its ghost cell. But, it looks an elusive matter in unstructured case. May boundary condition is applied to the both sweeps by ghost cells? 
for the first question, I think there is more than one technique to develop the algorithm ...
second question, I did not use ghost cells... on the boundaries I implemented the Neumann/Dirichlet BC directly in the shape functions in an FV/FEM hybrid approach... 
Quote:
I think it's getting more clear for this problem. Then, when the direct bc is implemented?I mean forward, backward, or in both sweeps. 
in my opinion, any time bc.s are involved

i found an interasting discussion about thinking on cfl number in implicit scheme. For implicit scheme, whole computation area is regarded as the domain of dependent. in that sence it seems applying bc for all sweeps is reasonable.
thank you again for your kind explains. 
Although it's not a lofty subject, I think I have to update my thought in order to make this post more useful for someone.
First of all, I have several data structures ex) node, cell, face, BCs. node has just coordinates data. Cell and face point the nodes they need. Face has also left/right cell pointers and its face vector. Conservative properties and other necessary data are stored in each cell. Boundary faces are defined in BCs. The cell doesn't know which bc types it has when there is no neighbors for one of the neibhbor face. Over the weekend, I had a difficulty on implementing lusgs by face loop. Because, for the current cell update, I have to have updates of the neighbor cells(which are L for forward, U for backward sweep). For the explicit operator(residual), face loop is enough to get each cell's residual. For the face loop in implicit operator, however, I can't get any update before the completion of face loop over a cell. So, returning to the cell loop, My pseudo program is like below until now. Code:
I have to put a loop after jface for applying bc. But it doesn't seem to be an efficient way. A loop for finding the face in BCs data contains many overlapped tasks. So I think need put more imformation to faces or cells defining which bc as their neighbors. Afterall my problem looks like a data constructing for reasonable calculation loop. 
Now I can implement a loop over a cell which informed which bc is applied. What I'm concerning is how this bc is contributing on the sweepings. From the googling I found a paper.
Dmitri Sharov and Kazuhiro Nakahashi. "Reordering of Hybrid Unstructured Grids for LowerUpper Symmetric GaussSeidel Computations", AIAA Journal, Vol. 36, No. 3 (1998), pp. 484486. doi: 10.2514/2.392 I didn't get this paper yet, but I found following sentence. Contributions from boundary faces must be considered only for the computation of the diagonal matrixD. The important issue for the unstructured grid LUSGS ... This paper maybe an answer for my question. 
All times are GMT 4. The time now is 23:55. 