• Structural Engineering and Mechanics
• /
• v.76 no.5
• /
• pp.643-651
• /
• 2020

Generally, it is necessary to perform transient structural analysis in order to verify and improve the seismic performance of high-rise buildings and bridges against earthquake loads. In this paper, we propose the model order reduction (MOR) method using the Krylov vectors to perform seismic analysis for linear and elastic systems in an efficient way. We then compared the proposed method with the mode superposition method (MSM) by using the limited numbers of modal vectors (or eigenvectors) calculated from the modal analysis. In the calculation, the data of the El Centro earthquake in 1940 were adopted for the seismic loading in the transient analysis. The numerical accuracy and efficiency of the two methods were compared in detail in the case of a simplified high-rise building.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.1-4
• /
• 1999

The Helmholtz equation is very important in physics and engineering. However, solution of the Helmholtz equation is in general known as a very difficult phenomenon. For if the ${\omega}$ is negative, the FDM discretized linear system becomes indefinite, whose solution by iterative method requires a very clever preconditioner. In this paper we assume that ${\omega}$ is nonnegative, and determine the optimal ${\rho}$ parameter for the three dimensional ADI iteration for the Helmholtz equation. The ADI(Alternating Direction Implicit) method is also getting new attentions due to the fact that it is very suitable to the vector/parallel computers, for example, as a preconditioner to the Krylov subspace methods. However, classical ADI was developed for two dimensions, and for three dimensions it is known that its convergence behaviour is quite different from that in two dimensions. So far, in three dimensions the so-called Douglas-Rachford form of ADI was developed. It is known to converge for a relatively wide range of ${\rho}$ values but its convergence is very slow. In this paper we determine the necessary conditions of the ${\rho}$ parameter for the convergence and optimal ${\rho}$ for the three dimensional ADI iteration of the Peaceman-Rachford form for the real Helmholtz equation with nonnegative ${\omega}$. Also, we conducted some experiments which is in close agreement with our theory. This straightforward extension of Peaceman-rachford ADI into three dimensions will be useful as an iterative solver itself or as a preconditioner to the the Krylov subspace methods, such as CG(Conjugate Gradient) method or GMRES(m).

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.4
• /
• pp.375-385
• /
• 2020

In this paper, a special indefinite inner product, named hyperbolic scalar product, is used and all acquired results have been raised and proved with the proviso that the space is equipped with this indefinite scalar product. The main objective is to be introduced and applied an indefinite oblique projection method, called Indefinite Lanczos J-biorthogonalizatiom process, which in addition to building a pair of J-biorthogonal bases for two used Krylov subspaces, leads to the introduction of a process for solving large non-J-symmetric linear systems, i.e., Indefinite two-sided Lanczos Algorithm for Linear systems.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.3
• /
• pp.155-162
• /
• 2018

We describe a parallel implementation of a relaxed Hermitian and skew-Hermitian splitting preconditioner for the numerical solution of saddle point problems arising from the steady incompressible Navier-Stokes equations. The equations are linearized by the Picard iteration and discretized with the finite element and finite difference schemes on two-dimensional and three-dimensional domains. We report strong scalability results for up to 32 cores.

• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.145-155
• /
• 1997

We present a couple of tools that can be used in the solution of nonsymmetric eigenvalue problems. The first one allows us to convert power iterates into Arnoldi's results so that a few eigenpairs are easily obtainable. The other converts Arnoldi's results into power iterates to simulate the power method and improve the result. Suggestions for application are also given.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.9
• /
• pp.933-941
• /
• 2014

This paper provides a comparison between the Krylov subspace method (KSM) and modal truncation method (MTM), which are typical projection-based model order reduction methods. The frequency responses are compared to determine the numerical accuracies and efficiencies. In order to compare the numerical accuracies of the KSM and MTM, the frequency responses and relative errors according to the order of the reduced model and frequency of interest are studied. Subsequently, a numerical examination shows whether a reduced order can be determined automatically with the help of an error convergence indicator. As for the numerical efficiency, the computation time needed to generate the projection matrix and the solution time to perform a frequency response analysis are compared according to the reduced order. A finite element model for a car suspension is considered as an application example of the numerical comparison.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.307-316
• /
• 2006

Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1310-1317
• /
• 2017

GASFLOW-MPI is a widely used scalable computational fluid dynamics numerical tool to simulate the fluid turbulence behavior, combustion dynamics, and other related thermal-hydraulic phenomena in nuclear power plant containment. An efficient scalable linear solver for the large-scale pressure equation is one of the key issues to ensure the computational efficiency of GASFLOW-MPI. Several advanced Krylov subspace methods and scalable preconditioning methods are compared and analyzed to improve the computational performance. With the help of the powerful computational capability, the large eddy simulation turbulent model is used to resolve more detailed turbulent behaviors. A backward-facing step flow is performed to study the free shear layer, the recirculation region, and the boundary layer, which is widespread in many scientific and engineering applications. Numerical results are compared with the experimental data in the literature and the direct numerical simulation results by GASFLOW-MPI. Both time-averaged velocity profile and turbulent intensity are well consistent with the experimental data and direct numerical simulation result. Furthermore, the frequency spectrum is presented and a -5/3 energy decay is observed for a wide range of frequencies, satisfying the turbulent energy spectrum theory. Parallel scaling tests are also implemented on the KIT/IKET cluster and a linear scaling is realized for GASFLOW-MPI.

• Structural Engineering and Mechanics
• /
• v.57 no.5
• /
• pp.921-936
• /
• 2016

In this study, a model order reduction technique is applied to solve the transient responses of submerged floating tunnel (SFT) from Mokpo to Jeju under seismic excitations. Because the SFT is a very long structure as well as a transient response analysis requires large amount of computational resources, the model order reduction is mandatory in the design stage of the SFT. Thus, we apply a model order reduction based on Krylov subspace to the simplified finite element model of the SFT. The responses of the reduced order model are compared with those of the full order model and also are verified by referring a previous work. In conclusion, the computational resources are dramatically reduced with an acceptable accuracy by using the model order reduction, which eventually is useful for designing the full-scale model of SFTs.

• Geophysics and Geophysical Exploration
• /
• v.7 no.2
• /
• pp.148-154
• /
• 2004

This article reviews the development of three-dimensional (3-D) magnetotelluric (MT) modeling. The 3-D modeling of electromagnetic fields is essential in understanding the physics of MT soundings, and in implementing an inversion method to reconstruct a 3-D resistivity image. Although various numerical schemes have been developed over the last two decades, practical methods have been quite limited. However, the recent rapid improvement in computer speed and memory, as well as the advance in iterative solution algorithms for a large system of equations, makes it possible to model the MT responses of complex 3-D structures, which have been very difficult to simulate before. The use of staggered grids in finite difference method has become popular, conserving a magnetic flux and an electric current and allowing for realistic discontinuous fields. The convergence of numerical solutions has been greatly accelerated by adopting Krylov subspace methods, proper preconditioning techniques, and static divergence corrections. The vector finite-element method using edge elements is also free from the discontinuity problem, and seems a natural choice for modeling complex structures including irregular topography because its flexibility allows one to capture full geometric complexity.