# boundary conditions and convergence

 Register Blogs Members List Search Today's Posts Mark Forums Read

 March 22, 2000, 05:17 boundary conditions and convergence #1 Jongtae Kim Guest   Posts: n/a Hello. Currently I am solving Laplace or Poisson equations such as heat conduction equation based on FVM. For heat conduction on a square domain, Dirichlet BC makes the problem solved very quickly. But when I used Neumann-type BCs like heat-flux or convection condition q_b = h*(T_b - T_inf), the convergence slows down seriously. I just think that the Neumann BCs destory the diagonal dominance of the discrete eq. of the boundary cells. Is there any good methods to make them diagonal-dominant? If there is any other reason for the convergence problem could you give me some teachings? Sincerely yours, Jongtae Kim

 March 22, 2000, 10:06 Re: boundary conditions and convergence #2 John C. Chien Guest   Posts: n/a (1). The slow convergence is due to the fact that the solution in the computational domain in T is changing all the time, trying to satisfy the gradient boundary conditions. Everything is floating except for the boundary gradient condition itself. (2). For the fixed boundary temperature type, the variable around the boundary is fixed and known, therefore, the convergence rate is a function of the distance of the unknown temperature from the boundary. For the variables near the boundary, the extent of the fluctuation is limited by the fixed temperature already. (3). So, the boundary condition itself changes the nature of the problem, and it affects the convergence of the process. The convergence of iterative methods is a different story, which deals with the numerical information propagation inside the computational domain.

 March 22, 2000, 10:19 Re: boundary conditions and convergence #3 franck bertagnolio Guest   Posts: n/a You have to check first that you fulfill the compatibility condition required for the Neumann problem, i.e. that the sum of the source term inside the domain is equal to the sum of the boundary fluxes (Gauss theorem). Moreover, this should be satisfied in the discrete sense!! To increase the diagonal dominance, any iterative method can be written more or less as: dx/dt + f(x) = 0 where x is your unknow, f(x)=0 your actual equation, t being a pseudo-time step. Appropriately discretizing this pseudo-time derivative allows to recover a certain degree of diagonal dominance, at least when solving the problem at each iteration step. Hope this helps. franck

 Thread Tools Display Modes Linear Mode

 Posting Rules You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is OffTrackbacks are On Pingbacks are On Refbacks are On Forum Rules

 Similar Threads Thread Thread Starter Forum Replies Last Post Saturn CFX 45 February 8, 2016 05:42 Pankaj CFX 9 November 23, 2009 05:05 tippo CFX 2 May 5, 2009 10:55 Mark CFX 6 November 15, 2004 16:55 Tudor Miron CFX 15 April 2, 2004 06:18

All times are GMT -4. The time now is 17:56.