• Journal of Korean Society of Steel Construction
• /
• v.10 no.3 s.36
• /
• pp.473-486
• /
• 1998

A numerically stable technique to remove the 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 solves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shift is an eigenvalue itself. 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.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2003.03a
• /
• pp.481-490
• /
• 2003

This paper presents an efficient eigensolution method for non-proportionally damped systems. The proposed method is obtained by applying the accelerated Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linearized form of the quadratic eigenproblem. A step length and a selective scheme are introduced to increase the convergence of the solution. The step length can be evaluated by minimizing the norm of the residual vector using the least square method. While the singularity may occur during factorizing process in other iteration methods such as the inverse iteration method and the subspace iteration method if the shift value is close to an exact eigenvalue, the proposed method guarantees the nonsingularity by introducing the orthonormal condition of the eigenvectors, which can be proved analytically. A numerical example is presented to demonstrate the effectiveness of the proposed method.

• Journal of the Society of Naval Architects of Korea
• /
• v.46 no.3
• /
• pp.232-248
• /
• 2009

Numerical methodology to solve ship springing problem, which is basically fluid-structure interaction problem, was explored in this study. Solution of this hydroelasticity problem was sought by coupling higher order B-spline Rankine panel method and finite element method in time domain, each of which is introduced for fluid and structure domain respectively. Even though varieties of different combinations in terms of numerical scheme are possible and have been tried by many researchers to solve the problem, no systematic study regarding the characteristics of each scheme has been done so far. Here, extensive case studies have been done on the numerical schemes especially focusing on the iteration method, FE analysis of beam-like structure, handling of forward speed problem and so on. Two different iteration scheme, Newton style one and fixed point iteration, were tried in this study and results were compared between the two. For the solution of the FE-based equation of motion, direct integration and modal superposition method were compared with each other from the viewpoint of its efficiency and accuracy. Finally, calculation of second derivative of basis potential, which is difficult to obtain with accuracy within grid-based method like BEM was discussed.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.136-150
• /
• 2021

The modern market is highly competitive. It has progressed from traditional competition between enterprises to competition between supply chains. To ensure that enterprise can form the best strategy consistently, it is necessary to evaluate the trust of other enterprises in the supply chain. First, this paper analyzes the background and significance of supply chain trust research, analyzes and expounds on the qualitative and quantitative methods of supply chain trust evaluation, and summarizes the research in this field. Analytic hierarchy process (AHP) is the most frequently used method in the literature to evaluate and rank criteria through data analysis. However, the input data for AHP analysis is based on human judgment, and hence there is every possibility that the data may be vague to some extent. Therefore, in view of the above problems, this study improves the global trust method based on chain iteration. The improved global trust evaluation method based on chain iteration is more flexible and practical, hence, it can more accurately evaluate supply chain trust. Finally, combined with an actual case of Zhaoxian Chengji Food Co. Ltd., the paper qualitatively analyzes the current situation of supply chain trust management and effectively strengthens the supervision of enterprises to cooperative enterprises. Thus, the company can identify problems on time and strategic adjustments can be implemented accordingly. The effectiveness of the evaluation method proposed in this paper is demonstrated through a quantitative evaluation of its trust in downstream enterprise A. Results suggest that the subjective preferences of and historical transactions together affect the final evaluation of trust.

• Structural Engineering and Mechanics
• /
• v.37 no.5
• /
• pp.561-573
• /
• 2011

For efficient calculation of natural modes of structures, a numerical scheme which accelerates convergence of the subspace iteration method by employing accelerated starting Lanczos vectors was proposed in 2005. This paper is an extension of the study. The previous study simply showed feasibility of the proposed method by analyzing structures with smaller degrees of freedom. While, the present study verifies efficiency of the proposed method more rigorously by comparing closeness of conventional and accelerated starting vectors to genuine eigenvectors. This study also analyzes an example structure with larger degrees of freedom and more complex constraints in order to investigate applicability of the proposed method.

• KIEE International Transactions on Electrophysics and Applications
• /
• v.3C no.5
• /
• pp.199-206
• /
• 2003

Numerical solutions to complex characteristic equations are quite often required to solve electromagnetic wave problems. In general, two traditional complex root search algorithms, the Newton-Raphson method and the Muller method, are used to produce such solutions. However, when utilizing these two methods, the choice of the initial iteration value is very sensitive, otherwise, the iteration can fail to converge into a solution. Thus, as an alternative approach, where the selection of the initial iteration value is more relaxed and the computation speed is high, Davidenko's method is used to determine accurate complex propagation constants for leaky circular symmetric modes in circular dielectric rod waveguides. Based on a precise determination of the complex propagation constants, the leaky mode characteristics of several lower-order circular symmetric modes are then numerically analyzed. In addition, no modification of the characteristic equation is required for the application of Davidenko's method.

• East Asian mathematical journal
• /
• v.34 no.5
• /
• pp.623-632
• /
• 2018

In [7, 8] they introduced a new finite element method for accurate numerical solutions of Poisson equations with corner singularities. They consider the Poisson equations with homogeneous boundary conditions, compute the finite element solutions using standard FEM and use the extraction formula to compute the stress intensity factor(s), then they posed new PDE with a regular solution by imposing the nonhomogeneous boundary condition using the computed stress intensity factor(s), which converges with optimal speed. From the solution they could get an accurate solution just by adding the singular part. Their algorithm involves an iteration and the iteration number depends on the acuracy of stress intensity factors, which is usually obtained by extraction formula which use the finite element solutions computed by standard Finite Element Method. In this paper we investigate the dependence of the iteration number on the convergence of stress intensity factors and give a way to reduce the iteration number, together with some numerical experiments.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.3
• /
• pp.189-202
• /
• 2009

In this paper we propose new primal-dual interior point algorithms for $P_*(\kappa)$ linear complementarity problems based on a new class of kernel functions which contains the kernel function in [8] as a special case. We show that the iteration bounds are $O((1+2\kappa)n^{\frac{9}{14}}\;log\;\frac{n{\mu}^0}{\epsilon}$) for large-update and $O((1+2\kappa)\sqrt{n}log\frac{n{\mu}^0}{\epsilon}$) for small-update methods, respectively. This iteration complexity for large-update methods improves the iteration complexity with a factor $n^{\frac{5}{14}}$ when compared with the method based on the classical logarithmic kernel function. For small-update, the iteration complexity is the best known bound for such methods.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.59-82
• /
• 2022

In this paper, we present a modified (improved) generalized M-iteration with the inertial technique for three quasi-nonexpansive multivalued mappings in a real Hilbert space. In addition, we obtain a weak convergence result under suitable conditions and the strong convergence result is achieved using the hybrid projection method with our modified generalized M-iteration. Finally, we apply our convergence results to certain optimization problem, and present some numerical experiments to show the efficiency and applicability of the proposed method in comparison with other improved iterative methods (modified SP-iterative scheme) in the literature. The results obtained in this paper extend, generalize and improve several results in this direction.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.499-511
• /
• 2013

In this article, Adomian decomposition method (ADM), variation iteration method(VIM) and homotopy analysis method (HAM) for solving integro-differential equation with singular kernel have been investigated. Also,we study the existence and uniqueness of solutions and the convergence of present methods. The accuracy of the proposed method are illustrated with solving some numerical examples.