• 한국전산유체공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.156-157
• /
• 2003

A simple method is proposed to split the flux vector of the Euler equations by introducing two artificial wave speeds. The direction of wave propagation can be adjusted by these two wave speeds. This idea greatly simplifies the upwinding, and leads to a new family of upwind schemes. Numerical flux function for multi-dimensional Euler equations is formulated for any grid system, structured or unstructured. A remarkable simplicity of the scheme is that it successfully achieves one-sided approximation for all waves without recourse to any matrix operation. Moreover, its accuracy is comparable with the exact Riemann solver. For 1-D Euler equations, the scheme actually surpasses the exact solver in avoiding expansion shocks without any additional entropy fix. The scheme can exactly resolve stationary contact discontinuities, and it is also freed of the carbuncle problem in multi­dimensional computations.

• Journal of computational fluids engineering
• /
• v.3 no.2
• /
• pp.17-26
• /
• 1998

The three-dimensional incompressible Navier-Stokes equations have been solved by a node-centered finite volume method with unstructured hybrid grids. The pressure-velocity coupling is handled by the artificial compressibility algorithm and convective fluxes are obtained by Roe's flux difference splitting scheme with linear reconstruction of the solutions. Euler implicit method with Jacobi matrix solver is used for the time-integration. The viscous terms are discretised in a manner to handle any kind of grids such as tetragedra, prisms, pyramids, hexahedra, or mixed-element grid. Inviscid bump flow is solved to check the accuracy of high order convective flux discretisation. And viscous flows around a circular cylinder and a sphere are studied to show the efficiency and accuracy of the solver.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1990.10a
• /
• pp.34-39
• /
• 1990

For the analysis of structures, specifically if it is large-scale, in which case it can not be solved within the core memory, the majority of computation time is consumed In the solution of simultaneous linear equation. In this study an efficient in- and out-of-core column solver for sparse symmetric matrix utilizing memory moving scheme is developed. Compare with existing blocking methods the algorithm is simple, therefore the coding and computational efficiencies are greatly enhanced. Upon available memory size, the solver automatically performs solution within the core or outside core. Analysis example shows that the proposed method efficiently solve the large structural problem on the small-memory microcomputer.

• 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 Institute of Electronics Engineers of Korea TC
• /
• v.44 no.7 s.361
• /
• pp.96-104
• /
• 2007

In this paper, the field solver based deembedding technique for the on-chip inductors to deembed the pad and surrounding ground effect was described, and the results from field solver based deembedding techniques and measurement based matrix calculation method were compared. In addition, LNA circuit is designed by using deembedded inductors and fabricated by using standard $0.25{\mu}m$ CMOS process, in the range over the 2.5GHz it shows the good agreements between measurement and simulation results when the proper deembedding was adapted. Supposed deembedding techniques can be used to get the pure on-chip devices's values and adapted to design accurate RFIC circuit design.

• Structural Engineering and Mechanics
• /
• v.83 no.3
• /
• pp.353-361
• /
• 2022

Linear Elastic Fracture Mechanics (LEFM) has been developed by applying stress analysis to determine the stress intensity factor (SIF, K). The finite element method (FEM) is widely used as a standard tool for evaluating the SIF for various crack configurations. The prediction accuracy can be achieved by applying an adaptive Delaunay triangulation combined with a FEM. The solution can be solved using either direct or iterative solvers. This work adopts the element-by-element preconditioned conjugate gradient (EBE-PCG) iterative solver into an adaptive FEM to solve the solution to heal problem size constraints that exist when direct solution techniques are applied. It can avoid the formation of a global stiffness matrix of a finite element model. Several numerical experiments reveal that the present method is simple, fast, and efficient compared to conventional sparse direct solvers. The optimum convergence criterion for two-dimensional LEFM analysis is studied. In this paper, four sample problems of a two-edge cracked plate, a center cracked plate, a single-edge cracked plate, and a compact tension specimen is used to evaluate the accuracy of the prediction of the SIF values. Finally, the efficiency of the present iterative solver is summarized by comparing the computational time for all cases.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.2
• /
• pp.117-124
• /
• 2019

Parallel sparse solvers are essential for solving large-scale finite element models. This paper introduces the combination of iterative and direct solver that can be applied efficiently to problems that require continuous solution for a subtly changing sequence of systems of equations. The iterative-direct sparse solver combination technique, proposed and implemented in the parallel sparse solver package, PARDISO, means that iterative sparse solver is applied for the newly updated linear system, but it uses the direct sparse solver's factorization of previous system matrix as a preconditioner. If the solution does not converge until the preset iterations, the solution will be sought by the direct sparse solver, and the last factorization results will be used as a preconditioner for subsequent updated system of equations. In this study, an improved method that sets the maximum number of iterations dynamically at the first Krylov iteration step is proposed and verified thereby enhancing calculation efficiency by the frequency domain analysis.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.1-9
• /
• 2021

OpenGL compute shader is a shader stage that operate differently from other shader stage and it can be used for the calculating purpose of any data in parallel. This paper proposes a GPU-based parallel algorithm for computing sparse linear systems through conjugate gradient using an iterative method, which perform calculation on OpenGL compute shader. Basically, this sparse linear solver is used to solve large linear systems such as symmetric positive definite matrix. Four well-known matrix formats (Dense, COO, ELL and CSR) have been used for matrix storage. The performance comparison from our experimental tests using eight sparse matrices shows that GPU-based linear solving system much faster than CPU-based linear solving system with the best average computing time 0.64ms in GPU-based and 15.37ms in CPU-based.

• Structural Engineering and Mechanics
• /
• v.4 no.2
• /
• pp.139-148
• /
• 1996

Vector algorithms and the relative importance of the four basic modules (computation of element stiffness matrices, assembly of the global stiffness matrix, solution of the system of linear simultaneous equations, and calculation of stresses and strains) of a finite element computer program for inelastic analysis of reinforced concrete shells are presented. Performance of the vector program is compared with a scalar program. For a cooling tower problem, the speedup factor from the scalar to the vector program is 34 for the element stiffness matrices calculation, 25.3 for the assembly of global stiffness matrix, 27.5 for the equation solver, and 37.8 for stresses, strains and nodal forces computations on a Gray Y-MP. The overall speedup factor is 30.9. When the equation solver alone is vectorized, which is computationally the most intensive part of a finite element program, a speedup factor of only 1.9 is achieved. When the rest of the program is also vectorized, a large additional speedup factor of 15.9 is attained. Therefore, it is very important that all the modules in a nonlinear program are vectorized to gain the full potential of the supercomputers. The vector finite element computer program for inelastic analysis of RC shells with layered elements developed in the present study enabled us to perform mesh convergence studies. The vector program can be used for studying the ultimate behavior of RC shells and used as a design tool.

• Nuclear Engineering and Technology
• /
• v.50 no.7
• /
• pp.1043-1050
• /
• 2018

For an efficient Monte Carlo (MC) burnup analysis, an accurate high-order depletion scheme to consider the nonlinear flux variation in a coarse burnup-step interval is crucial accompanied with an accurate depletion equation solver. In a Seoul National University MC code, McCARD, the high-order depletion schemes of the quadratic depletion method (QDM) and the linear extrapolation/quadratic interpolation (LEQI) method and a depletion equation solver by the Chebyshev rational approximation method (CRAM) have been newly implemented in addition to the existing constant extrapolation/backward extrapolation (CEBE) method using the matrix exponential method (MEM) solver with substeps. In this paper, the quadratic extrapolation/quadratic interpolation (QEQI) method is proposed as a new high-order depletion scheme. In order to examine the effectiveness of the newly-implemented depletion modules in McCARD, four problems in the VERA depletion benchmarks are solved by CEBE/MEM, CEBE/CRAM, LEQI/MEM, QEQI/MEM, and QDM for gadolinium isotopes. From the comparisons, it is shown that the QEQI/MEM predicts ${k_{inf}}^{\prime}s$ most accurately among the test cases. In addition, statistical uncertainty propagation analyses for a VERA pin cell problem are conducted by the sensitivity and uncertainty and the stochastic sampling methods.