• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.05a
• /
• pp.784-787
• /
• 2004

Modified version of subspace iteration method using accelerated starting vectors is proposed to efficiently calculate free vibration modes of structures. Proposed method employs accelerated Lanczos starting vectors that can reduce the number of iterations in the subspace iteration method. Proposed method is more efficient than the conventional method when the number of required modes is relatively small. To verify the efficiency of proposed method, two numerical examples are presented.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.10a
• /
• pp.503-508
• /
• 2003

This paper proposes modified subspace iteration method for efficient frequency analysis of structures. Proposed method uses accelerated Lanczos vectors as starting vectors in order to reduce the number of iterations in the subspace iteration method. Proposed method has better computing efficiency than the conventional method when the number of desired frequencies is relatively small. The efficiency of proposed method is verified through numerical examples.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.353-360
• /
• 2004

In this Paper, We propose an efficient iteration decoding control method with variable iteration decoding of iteration codes decoding using Cyclic Redundancy Check. As the number of iterations increases, the bit error rate and frame error rate of the decoder decrease and the incremental improvement gradually diminishes. However, when the iteration decoding number is increased, it require much delay and amount of processing time for decoding. Also, It can be observed the error nor that the performance cannot be improved even though increasing of the number of iterations and SNR. So, Suitable number of iterations for stopping criterion is required. we propose variable iteration control method to adapt variation of channel using Frame Error-Check indicator. Therefore, the amount of computation and the number of iterations required for iteration decoding with CRC method can be reduced without sacrificing performance.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.10a
• /
• pp.84-91
• /
• 1998

A numerically stable technique to remove tile limitation in choosing a shift in the subspace iteration method with shift is presented. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. This study selves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shiht is an eigenvalue itself. This is one of tile significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.243-248
• /
• 1997

A full multigrid scheme was used in computing some eigenvalues of the Laplace eigenvalues problem with the Dirichlet bound-ary condition. We get a system of algebraic equations with an aid of finite difference method and apply subspace iteration method to the system to compute first some eigenvalues. The result shows that this is very effective in calculating some eigenvalues of this problem.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.3
• /
• pp.371-383
• /
• 1999

An efficient and numerically stable eigensolution method for structures with multiple natural frequencies is presented. The proposed method is developed by improving the well-known subspace iteration method with shift. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. In this paper, the above singularity problem has been solved by introducing side conditions without sacrifice of convergence. The proposed method is always nonsingular even if a shift is on a distinct eigenvalue or multiple ones. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.13 no.1
• /
• pp.20-24
• /
• 2009

Objective: In this study, the differences between two reconstruction methods were analyzed by comparing image uniformity and contrast according to Iteration and Subset, which were altered through the Iterative method and True X method, used in Siemens' PET/CT studies. Methods: The Phantom images were obtained by exposure for two minutes per one bed. To determine the image uniformity, the Coefficient of variance was used. Also, in order to compare the contrast value, we measured and analyzed the ratio of the SUV mean of Phantom image's hot spheres and the background. Results: Under the same reconstruction conditions (Iteration and Subset) of CV, the Iterative method was higher than the True X method. In the comparison of the SUV mean ratio of the background and hot sphere, the True X method had a closer rate than the Iterative method. Conclusion: The newly developed True X reconstruction method is better than the previously used Iterative method in terms of uniformity and contrast. However, the date for this study was only obtained using the Phantom device. In order to obtain more accurate and useful information from the experiment, further research should be conducted. Also, it is necessary to find the appropriate standards for Iteration and Subset for further experimentation.

• Nuclear Engineering and Technology
• /
• v.15 no.1
• /
• pp.33-40
• /
• 1983

It is shown that the Shanks sequence $E_{k}$-transformation and the conventional extrapolation method are theoretically related. The $E_1$$^2$-transformation method is then applied for the multigroup diffusion problems. The diffusion code, CITATION, is modified for this study and the computing time is compared for each iteration tactics. The Equipose method, in which only sing1e inner iteration for each energy group is carried for an outer iteration, has been known as the fastest iteration method. However, in the case of 3-group problems, the proposed method, in which the number of inner iteration for the fast and thermal group is 2 and 1 respectively, gives better convergency than the Equipose method by about 12%. The double extrapolation method results in faster computing time than the single extrapolation method without computing storage problem. It is, however, to note that this method is verified only for a two-group treatment.t.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.1 no.1
• /
• pp.140-148
• /
• 1993

When a large automobile sheet metal part is formed in a draw die, the binder wrap is first calculated to predict the initial punch contact location for avoiding wrinkles and severe stretching of its thin blank sheet. Since the boundary of a pseudo blank in calculating a binder wrap by means of a geometrically nonlinear finite element method is unknown in advance, an iteration method is generally used. This paper presents an effective iteration method for correction of the pseudo blank in a binder wrap calculation. For the performance test, two examples are adopted. The calculated results for both examples show the good convergence which wasted solutions are obtained in the second iteration step.

• Nuclear Engineering and Technology
• /
• v.50 no.6
• /
• pp.854-859
• /
• 2018

Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculated or if the accuracy of the quantification result is in doubt, the Monte Carlo method can provide an alternative for fault tree quantification. The Monte Carlo method for fault tree quantification tends to take a long time because it repeats the calculation for a large number of samples. Herein, proposal is made to improve the quantification algorithm of a fault tree with circular logic. We developed a top-down iteration algorithm that combines the characteristics of the top-down approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method.