• Journal of applied mathematics & informatics
• /
• 제4권2호
• /
• pp.487-500
• /
• 1997

In this paper we introduce a multigrid method for solving the nonliear Urysohn integral equation. The algorithm is derived from a discrete resolvent equation which approximates the continuous resolvent equation of the nonlinear Urysohn integral equa-tion. The algorithm is mathematically equivalent to Atkinson's adap-tive twogrid iteration. But the two are different computationally. We show the convergence of the algorithm and its equivalence to Atkinson's adaptive twogrid iteration. in our numerical example we compare our algorithm to other multigrid methods for solving the nonliear Urysohn integral equation including the nonlinear multigrid nethod introduced by hackbush.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제1권1호
• /
• pp.105-125
• /
• 1997

In this paper we consider multigrid algorithms for solving elasticity problems by using Wilson's nonconforming finite element method. We consider two types of intergrid transfer operators which is needed to define the multigrid algorithm and prove convergence of $\mathcal{W}$-cycle mutigrid algorithm and uniform condition number estimates for the variable $\mathcal{V}$-cycle multigrid preconditioner.

• Journal of information and communication convergence engineering
• /
• 제9권3호
• /
• pp.319-324
• /
• 2011

In computing the optical flow. Horn and Schunck's method which is a representative algorithm is based on differentiation. But it is difficult to estimate the velocity for a large displacement by this algorithm. To cope with this problem multigrid method has been proposed. In this paper, we have proposed a scaled multigrid algorithm which the initial flow for a level is calculated by the summation of the optimally scaled flow and error flow. The optimally scaled flow is the scaled expanded flow of the previous level, which can generate an estimated second image having the least RMS error with respect to the original second image, and the error flow is the flow between the estimated second image (generated by the optimally scaled flow) and the original second image. The flow for this level is then estimated using the original first and second images and the initial flow for that level. From among the various coarsest starting levels of the multigrid algorithm, we select the one that finally gives the best estimated flow. Better results were achieved using our proposed method compared with Horn and Schunck's method and a conventional multigrid algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제7권2호
• /
• pp.75-81
• /
• 2003

Compact schemes are shown to be effective for a class of problems including convection-diffusion equations when combined with multigrid algorithms [7, 8] and V-cycle convergence is proved[5]. We apply the multigrid algorithm for an semianalytic finite difference scheme, which is desinged to preserve high order accuracy despite of singularities.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1997년도 춘계학술발표회논문집(1)
• /
• pp.27-32
• /
• 1997

In this paper, a new multigrid method is developed to solve the reactor eigenvalue problems. The new algorithm can be used in any matrix equation concerned with the eigenvalue problem. The finite difference neutron diffusion problem is considered demonstration of the performance of the new multigrid algorithm. The numerical results show that the new multigrid algorithm works well and requires much shorter (7~10 times) computing time compaired to the production code VENTURE.

• 대한기계학회논문집B
• /
• 제27권1호
• /
• pp.135-140
• /
• 2003

The convergence of finite volume method (FVM) or discrete ordinate method (DOM) is known to degrade for optical thickness greater than unity and large scattering albedo. The present article presents a convergence acceleration procedure for the FVM based on a full approximation storage (FAS) multigrid method. Among a variety of multigrid cycles, the V-cycle is used and the full multigrid algorithm (FMG) is applied to an analysis of radiation in irregular two-dimensional geometry. Solution convergence is discussed for the several cases of various optical thickness and scattering albedo. At small scattering albedo and optical thickness, there is no advantage to using the multigrid method for calculation CPU time. For large scattering albedo greater than 0.5 and optical thickness greater than unity, however, the multigrid method improves the convergence and the solution is rapidly obtained.

• Journal of applied mathematics & informatics
• /
• 제7권1호
• /
• pp.215-222
• /
• 2000

A multigrid algorithm is developed for solving the one- dimensional initial boundary value problem. The numerical solutions of linear and nonlinear Burgers; equation for various initial conditions are studied. The stability conditions are derived by Von -Neumann analysis . Numerical results are presented.

• 한국전산유체공학회지
• /
• 제3권1호
• /
• pp.30-36
• /
• 1998

The three dimensional Navier-Stokes equations in rotational coordinate are solved using a multigrid algorithm for the calculations of turbulent flows in centrifugal compressor impellers. Some numerical studies are made in applying the multigrid algorithm for the turbulent flow calculations with the standard κ-ε equations. The present method is used to calculate the flow fields of Mizuki's B-type and Niigata Ms. 350 centrifugal compressor impellers. Fast convergent steady-state solutions are carefully examined, comparing the static pressure distributions along the impeller flow passage and also in the diffuser with experimental data. Performance of a centrifugal compressor system is also numerically validated by comparing the performances of the impeller and the diffuser individually.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 1998년도 춘계 학술대회논문집
• /
• pp.29-34
• /
• 1998

An efficient 3-dimensional compressible solver is developed using the second-order upwind TVD scheme and the multigrid diagonalized ADI method. The multigrid method is improved so that the present DADI algorithm obtains better convergence rates. Results are computed on Cray C90 computer for transonic unsaperated flows past ONERA-M6 wing to demonstrate the accuracy and efficiency. The results show good agreement with experimetal data. A reduction of four orders of residual for 3-dimensional transonic flow is obtained about 99 seconds.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권2호
• /
• pp.135-142
• /
• 2000

We consider a multigrid algorithm for higher order finite difference scheme for the Poisson problem on rectangular domain. Several smoothers including Jacobi, Red-black Gauss-Seidel are tested and compared. Since higher order scheme gives much more accurate result then 5-point scheme, one may use small number of levels with higher order scheme and thus the overall cost is reduced quite a lot. The numerical experiment compares the two cases.