• Journal of computational fluids engineering
• /
• v.10 no.2
• /
• pp.38-47
• /
• 2005

Substructuring methods are often used in finite element structural analyses. In this study a multi-level substructuring(MLSS) algorithm is developed and proposed as a possible candidate for finite element fluid solvers. The present algorithm consists of four stages such as a gathering, a condensing, a solving and a scattering stage. At each level, a predetermined number of elements are gathered and condensed to form an element of higher level. At the highest level, each sub-domain consists of only one super-element. Thus, the inversion process of a stiffness matrix associated with internal degrees of freedom of each sub-domain has been replaced by a sequential static condensation of gathered element matrices. The global algebraic system arising from the assembly of each sub-domain matrices is solved using a well-known iterative solver such as the conjugare gradient(CG) or the conjugate gradient squared(CGS) method. A time comparison with CG has been performed on a 2-D Poisson problem. With one domain the computing time by MLSS is comparable with that by CG up to about 260,000 d.o.f. For 263,169 d.o.f using 8 x 8 sub-domains, the time by MLSS is reduced to a value less than $30\%$ of that by CG. The lid-driven cavity problem has been solved for Re = 3200 using the element interpolation degree(Deg.) up to cubic. in this case, preconditioning techniques usually accompanied by iterative solvers are not needed. Finite element formulation for the incompressible flow has been stabilized by a modified residual procedure proposed by Ilinca et al.[9].

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.211-230
• /
• 2008

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.27 no.6
• /
• pp.753-765
• /
• 2003

A finite element code for the numerical solution of the Navier-Stokes equation is parallelized by vertex-oriented domain decomposition. To accelerate the convergence of iterative solvers like conjugate gradient method, parallel block ILU, iterative block ILU, and distributed ILU methods are tested as parallel preconditioners. The effectiveness of the algorithms has been investigated when P1P1 finite element discretization is used for the parallel solution of the Navier-Stokes equation. Two-dimensional and three-dimensional Laplace equations are calculated to estimate the speedup of the preconditioners. Calculation domain is partitioned by one- and multi-dimensional partitioning methods in structured grid and by METIS library in unstructured grid. For the domain-decomposed parallel computation of the Navier-Stokes equation, we have solved three-dimensional lid-driven cavity and natural convection problems in a cube as benchmark problems using a parallelized fractional 4-step finite element method. The speedup for each parallel preconditioning method is to be compared using upto 64 processors.

• Coupled systems mechanics
• /
• v.1 no.4
• /
• pp.361-379
• /
• 2012

This paper presents a fully coupled three-dimensional solver for the analysis of interaction between pulsatile flow and large deformation structure. A partitioned time marching algorithm is employed for the solution of the time dependent coupled discretised problem, enabling the use of highly developed, robust and well-tested solvers for each field. Conservative transfer of information at the fluid-structure interface is combined with an effective multi-predict-correct iterative scheme to enable implicit coupling of the interacting fields at each time increment. The three-dimensional unsteady incompressible fluid is solved using a powerful implicit time stepping technique and an ALE formulation for moving boundaries with second-order time accurate is used. A full spectrum of total variational diminishing (TVD) schemes in unstructured grids is allowed implementation for the advection terms and finite element shape functions are used to evaluate the solution and its variation within mesh elements. A finite element dynamic analysis of the highly deformable structure is carried out with a numerical strategy combining the implicit Newmark time integration algorithm with a Newton-Raphson second-order optimisation method. The proposed model is used to predict the wave flow fields of a particular flow-induced vibrational phenomenon, and comparison of the numerical results with available experimental data validates the methodology and assesses its accuracy. Another test case about three-dimensional biomedical model with pulsatile inflow is presented to benchmark the algorithm and to demonstrate the potential applications of this method.

• Interaction and multiscale mechanics
• /
• v.5 no.3
• /
• pp.287-318
• /
• 2012

We apply a partitioned-solution (iterative-staggered) coupling method based on a fixed Eulerian mesh with the level set function to a large-deformation fluid-structure interaction (FSI) problem where a large-deformable thin structure moves in a high-speed flow field, as an airbag does during deployment. This method combines advanced fluid and structure solvers-specifically, the constrained interpolation profile finite element method (CIP-FEM) for fluid Eulerian mesh and large-deformable structural elements for Lagrangian structural mesh. We express the large-deformable interface as a zero isosurface by the level set function, and introduce virtual nodes with level sets and structural normal velocities to generate the level set function according to the large-deformable interfacial geometry and enforce the kinematic condition at the interface. The virtual nodes are located in the direction normal to the structural mesh. It is confirmed that application of the method to unfolded airbag deployment simulation shows the adequacy of the method.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.83-90
• /
• 2004

Substructuring methods are usually used in finite element structural analyses. In this study a multi-level substructuring algorithm is developed and proposed as a possible candidate for incompressible fluid solves. Finite element formulation for incompressible flow has been stabilized by a modified residual procedure proposed by Ilinca et.al.[5]. The present algorithm consists of four stages such as a gathering stage, a condensing stage, a solving stage and a scattering stage. At each level, a predetermined number of elements are gathered and condensed to form an element of higher level. At highest level, each subdomain consists of only one super-element. Thus, the inversion process of a stiffness matrix associated with internal degrees of freedom of each subdomain has been replaced by a sequential static condensation. The global algebraic system arising feom the assembly of each subdomains is solved using Conjugate Gradient Squared(CGS) method. In this case, pre-conditioning techniques usually accompanied by iterative solvers are not needed.

• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1267-1286
• /
• 2020

We pay attention to a coupled problem by a penalty term which is induced from non-overlapping domain decomposition methods based on augmented Lagrangian methodology. The coupled problem is composed by two parts mainly; one is a problem associated with local problems in non-overlapping subdomains and the other is a coupled part over all subdomains due to the penalty term. For the speedup of iterative solvers for the coupled problem, we propose two different types of preconditioners: a block-diagonal preconditioner and an additive Schwarz preconditioner as overlapping domain decomposition methods. We analyze the coupled problem and the preconditioned problems in terms of their condition numbers. Finally we present numerical results which show the performance of the proposed methods.

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.529-550
• /
• 2011

In this work, a numerical solution of the incompressible Navier-Stokes equations is proposed. The method suggested is based on an algorithm of discretization by mixed finite elements with a posteriori error estimation of the computed solutions. In order to evaluate the performance of the method, the numerical results are compared with some previously published works or with others coming from commercial code like Adina system.

• Proceedings of the KSME Conference
• /
• 2008.11b
• /
• pp.2558-2561
• /
• 2008

In the present study, a parallel Taylor-Galerkin/level set based two-phase flow code was developed using finite element discretization and domain decomposition method based on MPI (Message Passing Interface). The proposed method can be utilized for the analysis of a large scale free surface problem in a complex geometry due to the feature of FEM and domain decomposition method. Four-step fractional step method was used for the solution of the incompressible Navier-Stokes equations and Taylor-Galerkin method was adopted for the discretization of hyperbolic type redistancing and advection equations. A Parallel ILU(0) type preconditioner was chosen to accelerate the convergence of a conjugate gradient type iterative solvers. From the present parallel numerical experiments, it has been shown that the proposed method is applicable to the simulation of large scale free surface flows.

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