• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.387-394
• /
• 2004

In the structural analysis procedure using finite element technique, the performance of a linear equation solver is critical because the linear equation solving part spends most of the computing time for finite element analysis codes. However, most of researchers are still using inefficient profile-based direct solvers such as the band solver or the skyline solver. In this research, we introduce the multifrontal solution method as an efficient direct solution method for structural analysis, and show the efficiency and performance of the multifrontal solution method by comparing the performance of our own implementation of the multifrontal method with the band solver or the skyline solver. In addition, we also compare the performance of our solver with other implementations of the multifrontal method such as WSMP and MUMPS as well as commercial structural analysis packages such as ABAQUS and NASTRAN. Through the performance test results, the usefulness and efficiency of our domain-wise multifrontal solver for structural analysis is shown.

• International Journal of Aeronautical and Space Sciences
• /
• v.9 no.2
• /
• pp.79-86
• /
• 2008

High performance direct-iterative hybrid linear solver for large scale finite element problem is developed. Direct solution method is robust but difficult to parallelize, whereas iterative solution method is opposite for direct method. Therefore, combining two solution methods is desired to get both high performance parallel efficiency and numerical robustness for large scale structural analysis problems. Hybrid method mentioned in this paper is based on FETI-DP (Finite Element Tearing and Interconnecting-Dual Primal method) which has good parallel scalability and efficiency. It is suitable for fourth and second order finite element elliptic problems including structural analysis problems. We are using the hybrid concept of theses two solution method categories, combining the multifrontal solver into FETI-DP based iterative solver. Hybrid solver is implemented for our general structural analysis code, IPSAP.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.25-42
• /
• 2007

A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem is proposed. Using the factorization of symmetric eigenvalue problem, the algorithm overcomes the weak points of the Schur decomposition and the conventional diagonalization techniques for the Legendre tau approximation. The convergence of the method is proved and numerical results are presented.

• 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.

• 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.

• 한국연소학회:학술대회논문집
• /
• 2012.04a
• /
• pp.105-106
• /
• 2012

This study is numerical analysis about optimal conditions of GDICI (gasoline direct injection compression ignition) engine operation using intake preheating. Numerical modeling was performed by using the KIVA-3V Release2 code integrated Chemkin chemistry solver II. For validation of numerical model, experiments were performed on a single-cylinder engine. Throughout the numerical simulations under variable conditions, the ranges of optimal conditions were found.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.5 s.176
• /
• pp.1215-1230
• /
• 2000

Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.75-94
• /
• 2005

Research in the decision sciences has continued to develop a variety of mathematical models as well as software tools supporting corporate decision-making. Yet. in spite of their potential usefulness, the models are little used in real-world decision making since the model solution processes are too complex for ordinary users to get accustomed. This paper proposes an intelligent and flexible model-solver integration framework that enables the user to solve decision problems using multiple models and solvers without having precise knowledge of the model-solution processes. Specifically, for intuitive model-solution, the framework enables a decision support system to suggest the compatible solvers of a model autonomously without direct user intervention and to solve the model by matching the model and solver parameters intelligently without any serious conflicts. Thus, the framework would improve the productivity of institutional model solving tasks by relieving the user from the burden of leaning model and solver semantics requiring considerable time and efforts.

• Journal of the Chungcheong Mathematical Society
• /
• v.10 no.1
• /
• pp.147-159
• /
• 1997

It is important to solve the large sparse linear system appeared in many application field such as $AA^Ty={\beta}$ efficiently. In solving this linear system, the sparse solver using the splitting method for the relatively dense column is experimentally better than the direct solver using the Cholesky method.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.66-72
• /
• 2000

Aerodynamic sensitivity analysis is performed for the Navier-Stokes equations coupled with two-equation turbulence models using a discrete adjoint method and a direct differentiation method respectively. Like the mean flow equations, the turbulence model equations are also hand-differentiated to accurately calculate the sensitivity derivatives of flow quantities with respect to design variables in turbulent viscous flows. Both the direct differentiation code and the adjoint variable code adopt the same time integration scheme with the flow solver to efficiently solve the differentiated equations. The sensitivity codes are then compared with the flow solver in terms of solution accuracy, computing time and computer memory requirements. The sensitivity derivatives obtained from the sensitivity codes with different turbulence models are compared with each other. Using two-equation turbulence models, it is observed that a usual assumption of constant turbulent eddy viscosity in adjoint methods may lead to seriously inaccurate results in highly turbulent flows.