• Structural Engineering and Mechanics
• /
• v.30 no.4
• /
• pp.467-480
• /
• 2008

An aggregation multigrid method (AMM) is a leading iterative solver in solid mechanics. Recently, AMM is applied for solving Schur Complement system in the FE analysis of shell structures. In this work, an extended application of AMM for solving Schur Complement system in the FE analysis of continuum elements is presented. Further, the performance of the proposed AMM in multiple load cases, which is a challenging problem for an iterative solver, is studied. The proposed method is developed by combining the substructuring and the multigrid methods. The substructuring method avoids factorizing the full-size matrix of an original system and the multigrid method gives near-optimal convergence. This method is demonstrated for the FE analysis of several elastostatic problems. The numerical results show better performance by the proposed method as compared to the preconditioned conjugate gradient method. The smaller computational cost for the iterative procedure of the proposed method gives a good alternative to a direct solver in large systems with multiple load cases.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.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.

• 한국전산유체공학회:학술대회논문집
• /
• 2002.05a
• /
• pp.59-64
• /
• 2002

In this paper, the preconditioned multistage time stepping methods which are popular multigrid smoothers is implemented for the compressible Navier-Stokes calculation with full-coarsening multigrid method. The convergence characteristic of the point-Jacobi and Alternating direction line Jacobi(DDADI) preconditioners are studied. The performance of 2nd order upwind numerical fluxes such as 2nd order upwind TVD scheme and MUSCL-type linear reconstruction scheme are compared in the inviscid and viscous turbulent flow caculations.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.235-244
• /
• 2012

In this paper, we solve the three-dimensional biharmonic equation with Dirichlet boundary conditions of second kind using the full multigrid (FMG) algorithm. We derive a finite difference approximations for the biharmonic equation on a 18 point compact stencil. The unknown solution and its second derivatives are carried as unknowns at grid points. In the multigrid methods, we use a fourth order interpolation to producing a new intermediate unknown functions values on a finer grid, and the full weighting restriction operators to calculating the residuals at coarse grid points. A set of test problems gives excellent results.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.6
• /
• pp.1-8
• /
• 2004

The objective of this study is convergence acceleration of multigrid Navier-Stokes solvers. This study has been performed to enhance the performance of preconditioned multi-stage time stepping method which is a popular smoother for the multigrid Navier-Stokes solvers. Comparative study on the convergence characteristics of the ADI and DDADI preconditioners has been conducted. It is shown that the DDADI preconditioner has better performance than the ADI by numerical tests on the 2-D compressible turbulent flows past airfoils. The Spalart-Allmaras turbulent model and the Baldwin-Lomax turbulent model have been compared with the multigrid calculations.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.2
• /
• pp.9-24
• /
• 2002

Total Variation(TV) regularization method is effective for reconstructing "blocky", discontinuous images from contaminated image with noise. But TV is represented by highly nonlinear integro-differential equation that is hard to solve. There have been much effort to obtain stable and fast methods. C. Vogel introduced "the Fixed Point Lagged Diffusivity Iteration", which solves the nonlinear equation by linearizing. In this paper, we apply multigrid(MG) method for cell centered finite difference (CCFD) to solve system arise at each step of this fixed point iteration. In numerical simulation, we test various images varying noises and regularization parameter $\alpha$ and smoothness $\beta$ which appear in TV method. Numerical tests show that the parameter ${\beta}$ does not affect the solution if it is sufficiently small. We compute optimal $\alpha$ that minimizes the error with respect to $L^2$ norm and $H^1$ norm and compare reconstructed images.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1680-1691
• /
• 2004

One of the representative methods of optical flow is a gradient method which estimates the movement of an object based on the differential of image brightness. However, the method is ineffective for large displacement of the object and many improved methods have been proposed to copy with such limitations. One of these improved techniques is the multigrid processing, which is used in many optical flow algorithms. As an alternative novel technique we have been proposing an orthogonal functional expansion method, where whole displacements are expanded from low frequency terms. This method is expected to be applicable to flow estimation with large displacement and deformation including expansion and contraction, which are difficult to cope with by conventional optical flow methods. In the orthogonal functional expansion method, the apparent displacement field is calculated iteratively by a projection method which utilizes derivatives of the invariant constraint equations of brightness constancy. One feature of this method is that differentiation of the input image is not necessary, thereby reducing sensitivity to noise. In this paper, we apply our method to several real images in which the objects undergo large displacement and/or deformation including expansion. We demonstrate the effectiveness of the orthogonal functional expansion method by comparing with conventional methods including our optimally scaled multigrid optical flow algorithm.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.1392-1396
• /
• 2007

The governing equations in generalized curvilinear coordinates for 3D laminar flow are the Incompressible Navier-Stokes (INS) equations with the artificial dissipative terms. and continuity equation discretized using a second-order accurate, finite volume method on the nonstaggered computational grid. This method adopts a dual or pseudo time-stepping Artificial Compressibility (AC) method integrated in pseudo-time. Multigrid methods are also applied because solving the equations on the coarse grids requires much less computational effort per iteration than on the fine grid. The algorithm yields practically identical velocity profiles and secondary flows that are in excellent overall agreement with an experimental measurement (Humphrey et al., 1977).

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.195-202
• /
• 2001

In this paper, the convergence characteristics of preconditioned multigrid methods are investigated. The preconditioning method is introduced to reduce the condition number of discrete governing equations. 6 preconditioners including a point, line and diagonalized line solvers are implemented and applied to 2-dimensional inviscid flow problems. Theoretical fourier analyses and numerical results are presented for the preconditioners.

• The Pure and Applied Mathematics
• /
• v.21 no.2
• /
• pp.129-139
• /
• 2014

In this paper, we present a detailed comparison of the performance of the numerical solvers such as the biconjugate gradient stabilized, operator splitting, and multigrid methods for solving the two-dimensional Black-Scholes equation. The equation is discretized by the finite difference method. The computational results demonstrate that the operator splitting method is fastest among these solvers with the same level of accuracy.