• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.4
• /
• pp.381-394
• /
• 2019

In this paper, we are extending fractional partial differential equations to fuzzy fractional partial differential equation under Riemann-Liouville and Caputo fractional derivatives, namely Variational iteration methods, and this method have applied to the fuzzy fractional wave equation with initial conditions as in fuzzy. It is explained by one and two-dimensional wave equations with suitable fuzzy initial conditions.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.7-9
• /
• 1988

K-means iteration method is generally used for creating the templates in speaker-independent isolated-word recognition system. In this paper the initialization method of initial centers is proposed. The concepts are sorting and trace segmentation. All the tokens are sorted and segmented by trace segmentation so that initial centers are decided. The performance of this method is evaluated by isolated-word recognition of Korean digits. The highest recognition rate is 97.6%.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.11
• /
• pp.1852-1861
• /
• 1997

An enhanced subspace iteration algorithm has been developed to solve eigenvalue problems reliably and efficiently. Basic subspace iteration algorithm has been improved by eliminating recalculation of converged eigenvectors, using Krylov sequence as initial vectors and incorporating with shifting techniques. The number of iterations and computational time have been considerably reduced when compared with the original one, and reliability for catching copies of the multiple roots has been retained successfully. Further research would be required for mathematical justification of the present method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.551-558
• /
• 2003

An efficient and reliable subspace iteration algorithm using the block algorithm is proposed. The block algorithm is the method dividing eigenpairs into several blocks when a lot of eigenpairs are required. One of the key for the faster convergence is carefully selected initial vectors. As the initial vectors, the proposed method uses the modified Ritz vectors for guaranteering all the required eigenpairs and the quasi-static Ritz vectors for accelerating convergency of high frequency eigenvectors. Applying the quasi-static Ritz vectors, a shift is always required, and the proper shift based on the geometric average is proposed. To maximize efficiency, this paper estimates the proper number of blocks based on the theoretical amount of calculation in the subspace iteration. And it also considers the problems generated in the process of combining various algorithms and the solutions to the problems. Several numerical experiments show that the proposed subspace iteration algorithm is very efficient, reliable ,and accurate.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1167-1178
• /
• 2011

In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Cao, On local Hermitian and Skew-Hermitian splitting iteration methods for generalized saddle point problems, J. Comput. Appl. Math., 2009(231): 973-982] for the generalized saddle point problems to generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. Numerical experiments show the effectiveness of the iterative methods.

• East Asian mathematical journal
• /
• v.29 no.5
• /
• pp.511-519
• /
• 2013

There are various methods for evaluating a matrix square root, which is a solvent of the quadratic matrix equation $X^2-A=0$. We consider new iterative methods for solving matrix square roots of M-matrices. Particulary we show that the relaxed binomial iteration is more efficient than Newton-Schulz iteration in some cases. And we construct a formula to find relaxation coefficients through statistical experiments.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.487-500
• /
• 1997

In this paper we introduce a multigrid method for solving the nonliear Urysohn integral equation. The algorithm is derived from a discrete resolvent equation which approximates the continuous resolvent equation of the nonlinear Urysohn integral equa-tion. The algorithm is mathematically equivalent to Atkinson's adap-tive twogrid iteration. But the two are different computationally. We show the convergence of the algorithm and its equivalence to Atkinson's adaptive twogrid iteration. in our numerical example we compare our algorithm to other multigrid methods for solving the nonliear Urysohn integral equation including the nonlinear multigrid nethod introduced by hackbush.

• Structural Engineering and Mechanics
• /
• v.8 no.6
• /
• pp.547-560
• /
• 1999

In this paper an asymptotic iteration method is adopted to analyze non-linear free vibration of reticulated circular plates composed of beam members placed in two orthogonal directions. For the resulting linear ordinary differential equations in the process of iteration, the power series with rapid convergence has been applied to obtain an analytical solution for non-linear characteristic relation between the amplitude and frequency of the structure. Numerical examples are given, and the phenomena indicating hardening of such structures have been presented for the (immovable or movable) simply-supported and clamped circular plates.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1371-1377
• /
• 2008

In this paper, we have employed the variational iteration method to solve the boundary value problems. Numerical results reveal that it is a very effective method compared with the results obtained by using the Adomian decomposition method in Wazwaz, A. M. (2000).

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.327-334
• /
• 2005

The representation of Web Sites with EMFG(Extended Mark Flow Graph) is studied as a new method that represents the complicated Web Sites structure. The Web Sites usually have the number of iteration structures. The representation of these Web Sites with EMFG is too complicated, and so we can not understand the structure of these Web Sites sometimes. Therefore, in this paper, we classify these iteration structures when express Web Sites by EMFG as serial iteration structures and parallel iteration structures and propose the method that can simplify these iteration structures. Then we can reduce number of boxes, arcs, and transitions, and efficiently design and manage Web Sites by using this method.