• 한국전산유체공학회:학술대회논문집
• /
• 1999.05a
• /
• pp.106-112
• /
• 1999

In this article, combination of the FAS-FMG multi-grid method and the Krylov subspace method was presented in solving two dimensional driven-cavity flows. Three algorithms of the Krylov subspace method, CG, CGSTAB(Bi-CG Stabilized) and GMRES method were tested with MILU preconditioner. As a smoother of the pressure correction equation, the MILU-CG is recommended rather than MILU-GMRES(k) or MILU-CGSTAB, since the MILU-GMRES(k) preconditioner has too much computation on the coarse grid compared to the MILU-CG one. As for the momentum equation, relatively cheap smoother like SIP solver may be sufficient.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.7
• /
• pp.907-915
• /
• 2000

The preconditioned Krylov subspace methods were applied to the incompressible Navier-Stoke's equations for convergence acceleration. Three of the Krylov subspace methods combined with the five of the preconditioners were tested to solve the lid-driven cavity flow problem. The MILU preconditioned CG method showed very fast and stable convergency. The combination of GMRES/MILU-CG solver for momentum and pressure correction equations was found less dependency on the number of the grid points among them. A guide line for stopping inner iterations for each equation is offered.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.436-441
• /
• 2008

One of important factors in designing array-type MEMS resonators is obtaining a desired frequency response function (FRF) within a specific range. In this paper Krylov subspace-based model order reduction using moment-matching with non-zero expansion points is represented to calculate the FRF of array-type resonators. By matching moments at a frequency around a specific range of the array-type resonators, required FRFs can be efficiently calculated with significantly reduced systems regardless of their operating frequencies. In addition, because of the characteristics of moment-matching method, a minimal order of reduced system with a specified accuracy can be determined through an error indicator using successive reduced models, which is very useful to automate the order reduction process and FRF calculation for structural optimization iterations.

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

It is shown that a new Krylov subspace method for solving symmetric indefinite systems of linear equations can be obtained. We call the method as the projection method in this paper. The residual vector of the projection method is maintained at each iteration, which may be useful in some applications.

• Journal of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.805-827
• /
• 2012

In this paper, we first study convergence of a special type of multisplitting methods with preweighting, and then we provide some comparison results of those multisplitting methods. Next, we propose both parallel implementation of an SOR-like multisplitting method with preweighting and an application of the SOR-like multisplitting method with preweighting to a parallel preconditioner of Krylov subspace method. Lastly, we provide parallel performance results of both the SOR-like multisplitting method with preweighting and Krylov subspace method with the parallel preconditioner to evaluate parallel efficiency of the proposed methods.

• Nuclear Engineering and Technology
• /
• v.54 no.11
• /
• pp.4280-4295
• /
• 2022

In this paper, a new multi-group neutron-gamma transport calculation code system STRAUM-MATXST for complicated geometrical problems is introduced and its development status including numerical tests is presented. In this code system, the MATXST (MATXS-based Cross Section Processor for S_N Transport) code generates multi-group neutron and gamma cross sections by processing MATXS format libraries generated using NJOY and the STRAUM (S_N Transport for Radiation Analysis with Unstructured Meshes) code performs multi-group neutron-gamma coupled transport calculation using tetrahedral meshes. In particular, this work presents the recent implementation and its test results of the Krylov subspace methods (i.e., Bi-CGSTAB and GMRES(m)) with preconditioners using DSA (Diffusion Synthetic Acceleration) and TSA (Transport Synthetic Acceleration). In addition, the Krylov subspace methods for accelerating the energy-group coupling iteration through thermal up-scatterings are implemented with new multi-group block DSA and TSA preconditioners in STRAUM.

• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.375-388
• /
• 2004

For solving symmetric systems of linear equations, it is shown that a new Krylov subspace method can be obtained. The new approach is one of the projection methods, and we call it the projection method for convenience in this paper. The projection method maintains the residual vector like simpler GMRES, symmetric QMR, SYMMLQ, and MINRES. By studying the quasiminimal residual method, we show that an extended projection method and the scaled symmetric QMR method are equivalent.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1131-1141
• /
• 2010

We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Some numerical experiments are given to show the efficiency of the preconditioner.

• Structural Engineering and Mechanics
• /
• v.81 no.4
• /
• pp.411-428
• /
• 2022

This paper presents the Campbell diagram analysis of the rotordynamic system using the full order model (FOM) and the reduced order model (ROM) techniques to determine the critical speeds, identify the stability and reduce the computational time. Due to the spin-speed-dependent matrices (e.g., centrifugal stiffening matrix), several model order reduction (MOR) techniques may be considered, such as the modal superposition (MS) method and the Krylov subspace-based MOR techniques (e.g., Ritz vector (RV), quasi-static Ritz vector (QSRV), multifrequency quasi-static Ritz vector (MQSRV), multifrequency/ multi-spin-speed quasi-static Ritz vector (MMQSRV) and the combined Ritz vector & modal superposition (RV+MS) methods). The proposed MMQSRV method in this study is extended from the MQSRV method by incorporating the rotational-speed-dependent stiffness matrices into the Krylov subspace during the MOR process. Thus, the objective of this note is to respond to the question of whether to use the MS method or the Krylov subspace-based MOR technique in establishing the Campbell diagram of the shaft-disc-blade assembly systems in three-dimensional (3D) finite element analysis (FEA). The Campbell diagrams produced by the FOM and various MOR methods are presented and discussed thoroughly by computing the norm of relative errors (ER). It is found that the RV and the MS methods are dominant at low and high rotating speeds, respectively. More precisely, as the spinning velocity becomes large, the calculated ER produced by the RV method is significantly increased; in contrast, the ER produced by the MS method is smaller and more consistent. From a computational point of view, the MORs have substantially reduced the time computing considerably compared to the FOM. Additionally, the verification of the 3D FE rotordynamic model is also provided and found to be in close agreement with the existing solutions.

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

In this paper, we present a Krylov subspace based projection method for reduced-order modeling of large scale bilinear multi-input multi-output (MIMO) systems. The reduced-order bilinear system is constructed in such a way that it can match a desired number of moments of multi-variable transfer functions corresponding to the kernels of Volterra series representation of the original system. Numerical examples report the effectiveness of this method.