• 한국전산유체공학회:학술대회논문집
• /
• 2000.10a
• /
• pp.129-134
• /
• 2000

An efficient numerical method to solve the unsteady incompressible Navier-Stokes equations is developed. A fully implicit time advancement is employed to avoid the CFL(Courant-Friedrichs-Lewy) restriction, where the Crank-Nicholson discretization is used for both the diffusion and convection terms. Based on a block LU decomposition, velocity-pressure decoupling is achieved in conjunction with the approximate factorization. Main emphasis is placed on the additional decoupling of the intermediate velocity components with only n th time step velocity The temporal second-order accuracy is Preserved with the approximate factorization without any modification of boundary conditions. Since the decoupled momentum equations are solved without iteration, the computational time is reduced significantly. The present decoupling method is validated by solving the turbulent minimal channel flow unit.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.8
• /
• pp.1950-1963
• /
• 1995

A modification of the approximate-factorization method is made to accelerate the convergency rate and to take sufficiently large Courant number without loss of accuracy. And a stable implicit finite-difference scheme for solving the incompressible Navier-Stokes equations employed above modified method is developed. In the present implicit scheme, the volume fluxes with contravariant velocity components and the pressure formulation in curvilinear coordinates is adopted. In order to satisfy the continuity condition completely and to remove spurious errors for the pressure, the Navier-Stokes equations are solved by a modified SMAC scheme using a staggered gird. The upstream-difference scheme such as the QUICK scheme is also employed to the right hand side. The implicit scheme is unconditionally stable and satisfies a diagonally dominant condition for scalar diagonal linear systems of implicit operator on the left hand side. Numerical results for some test calculations of the two-dimensional flow in a square cavity and over a backward-facing step are obtained using both usual approximate-factorization method and the modified one, and compared with each other. It is shown that the present scheme allows a sufficiently large Courant number of O(10$^{2}$) and reduces the computing time.

• 한국전산유체공학회:학술대회논문집
• /
• 1999.11a
• /
• pp.17-22
• /
• 1999

Convergence characteristics and efficiency of three implicit approximate factorization schemes(ADI, DDADI and MAF) are examined using 2-Dimensional compressible upwind Navier-Stokes code. Second-order CSCM(Conservative Supra Characteristic Method) upwind flux difference splitting method with Fromm scheme is used for the right-hand side residual evaluation, while generally first-order upwind differencing is used for the implicit operator on the left-hand side. Convergence studies are performed using an example of the flow past a NACA0012 airfoil at steady transonic flow condition, i. e. Mach number 0.8 at $1.25^{\circ}$ angle of attack. The results were compared with other computational results in order to validate the current numerical analysis. The results from the implicit AF algorithms were compared well in low surface with the other computational results; however, not well in upper surface. It might be due to lack of the grid around the shock position. Because the algorithm minimizes the errors of the approximate decomposition, the improved convergence rate with MAF were observed.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.59-80
• /
• 2003

An incomplete factorization method for preconditioning symmetric positive definite matrices is introduced to solve normal equations. The normal equations are form to solve linear least squares problems. The procedure is based on a block incomplete Cholesky factorization and a multilevel recursive strategy with an approximate Schur complement matrix formed implicitly. A diagonal perturbation strategy is implemented to enhance factorization robustness. The factors obtained are used as a preconditioner for the conjugate gradient method. Numerical experiments are used to show the robustness and efficiency of this preconditioning technique, and to compare it with two other preconditioners.

• 한국전산유체공학회:학술대회논문집
• /
• 2002.10a
• /
• pp.95-102
• /
• 2002

Studies of the numerical characteristics of implicit upwind schemes, such as upwind ADI, Line Gauss-Seidel(LGS) and Point Gauss-Seidel(LU) algorithms, for preconditioned Navier-Stokes equations ate performed. All the algorithms are expressed in approximate factorization form and Von Neumann stability analysis and convergence studies are made. Preconditioning is applied for efficient convergence at low Mach numbers and low Reynolds numbers. For high aspect ratio computations, the ADI and LGS algorithms show efficient and uniform convergence up to moderate aspect ratio if we adopt viscous preconditioning based on min- CFL/max- VNN time-step definition. The LU algorithm, on the other hand, shows serious deterioration in convergence rate as the grid aspect ratio increases. Computations for practical applications also verify these results.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.63-72
• /
• 2021

Mobile crowd-sensing (MCS) is a promising sensing paradigm that leverages mobile users with smart devices to perform large-scale sensing tasks in order to provide services to specific applications in various domains. However, MCS sensing tasks may not always be successfully completed or timely completed for various reasons, such as accidentally leaving the tasks incomplete by the users, asynchronous transmission, or connection errors. This results in missing sensing data at specific locations and times, which can degrade the performance of the applications and lead to serious casualties. Therefore, in this paper, we propose a missing data inference approach, called missing data approximation with probabilistic tensor factorization (MDI-PTF), to approximate the missing values as closely as possible to the actual values while taking asynchronous data transmission time and different sensing locations of the mobile users into account. The proposed method first normalizes the data to limit the range of the possible values. Next, a probabilistic model of tensor factorization is formulated, and finally, the data are approximated using the gradient descent method. The performance of the proposed algorithm is verified by conducting simulations under various situations using different datasets.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.1
• /
• pp.63-70
• /
• 1994

The three-dimensional incompressible clavier-Stokes equations are solved to simulate the flow field around a Wigley model with free-surface. The IAF(Implicit Approximate Factorization) method is used to show a good success in reducing the computing time. The CPU time is almost an half of that if the IAF method were used. The present method adopts the local linearization and Euler implicit scheme without the pressure-gradient terms for the artificial viscosity. Calculations are carried out at the Reynolds number of $10^6$ and the Froude numbers are 0.25, 0.289 and 0.316. For the approximations of turbulence, the Baldwin-Lomax model is used. The resulting free-surface wave configurations and the velocity vectors are compared with those by the explicit method and experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.386-393
• /
• 2003

For fast Cholesky factorization, it is most important to reduce the number of non-zero elements by ordering methods. Minimum deficiency ordering produces less non-zero elements. However, since it is very slow. the minimum degree algorithm is widely used. To improve the computation time, Rothberg's AMF uses an approximate deficiency instead of computing the deficiency. In this paper we present simple efficient methods to obtain a good approximate deficiency using information related to cliques. Experimental results show that our proposed method produces better ordering quality than that of AMF.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3B
• /
• pp.293-303
• /
• 2011

An efficient diagonalized approximate factorization algorithm (DAF) is developed for the solution of three-dimensional incompressible viscous flows. The pressure-based, artificial compressibility (AC) method is used for calculating steady incompressible Navier-Stokes equations. The AC form of the governing equations is discretized in space using a second-order-accurate finite volume method. The present DAF method is applied to derive a second-order accurate splitting of the discrete system of equations. The primary objective of this study is to investigate the computational efficiency of the present DAF method. The solutions of the DAF method are evaluated relative to those of well-known four-stage Runge-Kutta (RK4) method for fully developed and developing laminar flows in curved square ducts and a laminar flow in a cavity. While converged solutions obtained by DAF and RK4 methods on the same computational meshes are essentially identical because of employing the same discrete schemes in space, both algorithms shows significant discrepancy in the computing efficiency. The results reveal that the DAF method requires substantially at least two times less computational time than RK4 to solve all applied flow fields. The increase in computational efficiency of the DAF methods is achieved with no increase in computational resources and coding complexity.

• Journal of Energy Engineering
• /
• v.9 no.4
• /
• pp.309-318
• /
• 2000

핀-관 열교환기의 효율을 증대시키기 위하여는 열저항을 결정하는 데 있어서 중요한 역할을 하는 공기측 열전달 특성의 향상이 필요하다. 본 연구에서는 핀-관 열교환기의 공리측 성능을 해석하기 위해서 3차원 비압축성 Navier-Stokes 코드를 개발하였으며 이 코드는 시간항에 스칼라 내재적 근사분해법(scalar implicit approximate factorization)절차, 공간항에 유한체적법과 2차의 풍상차분법(upwind differencing)을 사용한다. 서로 다른 3개의 핀형상(평판핀, 슬릿핀, 파형핀)을 고려하였고 이들의 유동 및 열전달 특성을 연구하였다.