• Title/Summary/Keyword: iteration method

Search Result 1,144, Processing Time 0.029 seconds

A Study on Korean isolated word recognition using LPC cepstrum and clustering (LPC Cepstrum과 집단화를 이용한 한국어 고립단어 인식에 관한 연구)

  • Kim, Jin-Yeong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.6 no.4
    • /
    • pp.44-54
    • /
    • 1987
  • In this paper, the problem of LP-model and it's solution by liftering in cepstrum domain are investigated in speaker independent isolated-word recognition. And, clustering technique is discussed for obtaining the reference template. KMA (K-means iteration with average) method, which is transformed from UWA method and K-iteration method, has been suggested and compared with each other for clustering, the result of recognition experiments shows max. $95\%$ recognition rate when rasied-sign lifter and KMA clustering method is applied.

  • PDF

SOME GLOBAL CONVERGENCE PROPERTIES OF THE LEVENBERG-MARQUARDT METHODS WITH LINE SEARCH

  • Du, Shou-Qiang
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.3_4
    • /
    • pp.373-378
    • /
    • 2013
  • In this paper, we consider two kinds of the Levenberg-Marquardt method for solve a system of nonlinear equations. We use line search on every iteration to guarantee that the Levenberg-Marquardt methods are globally convergent. Under mild conditions, we prove that while the de- scent condition can be satisfied at the iteration of the Levenberg-Marquardt method, the global convergence of the method can be established.

A Study on the Shortest path of use Auction Algorithm (Auction 알고리즘을 이용한 최단경로에 관한 연구)

  • 우경환
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.03a
    • /
    • pp.11-16
    • /
    • 1998
  • The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

  • PDF

Solution of Eigenvalue Problems for Nonclassically Damped Systems with Multiple Frequencies (중복근을 갖는 비비례 감쇠시스템의 고유치 해석)

  • 김만철;정형조;오주원;이인원
    • Computational Structural Engineering
    • /
    • v.11 no.1
    • /
    • pp.205-216
    • /
    • 1998
  • A solution method is presented to solve the eigenvalue problem arising in the dynamic analysis of nonclassicary damped structural systems with multiple eigenvalues. The proposed method is obtained by applying the modified Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linear eigenproblem through matrix augmentation of the quadratic eigenvalue problem. In the iteration methods such as the inverse iteration method and the subspace iteration method, singularity may be occurred during the factorizing process when the shift value is close to an eigenvalue of the system. However, even though the shift value is an eigenvalue of the system, the proposed method provides nonsingularity, and that is analytically proved. Since the modified Newton-Raphson technique is adopted to the proposed method, initial values are need. Because the Lanczos method effectively produces better initial values than other methods, the results of the Lanczos method are taken as the initial values of the proposed method. Two numerical examples are presented to demonstrate the effectiveness of the proposed method and the results are compared with those of the well-known subspace iteration method and the Lanczos method.

  • PDF

ITERATIVE APPROXIMATION OF FIXED POINTS FOR STRONGLY PSEUDO-CONTRACTIVE MAPPINGS

  • Sharma, Sushil;Deshpande, Bhavana
    • Bulletin of the Korean Mathematical Society
    • /
    • v.39 no.1
    • /
    • pp.43-51
    • /
    • 2002
  • The aim of this paper is to prove a convergence theorem of a generalized Ishikawa iteration sequence for two multi-valued strongly pseudo-contractive mappings by using an approximation method in real uniformly smooth Banach spaces. We generalize and extend the results of Chang and Chang, Cho, Lee, Jung, and Kang.

Existence of Solutions for the Semilinear Fuzzy Integrodifferential Equations using by Successive Iteration

  • Kwun, Young-Chel;Kim, Mi-Ju;Lee, Bu-Young;Park, Jin-Han
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.4
    • /
    • pp.543-548
    • /
    • 2008
  • This paper is to investigate the existence theorem for the semilinear fuzzy integrodifferential equation in $E_N$ by using the concept of fuzzy number whose values are normal, convex, upper semicontinuous and compactly supported interval in $E_N$. Main tool is successive iteration method.

Improvement of the Rayleigh Quotient Iteration Method (RQI 기법의 성능 개선)

  • Jeon, C.W.;Kim, H.J.;Lee, J.G.
    • Proceedings of the KIEE Conference
    • /
    • 1994.11a
    • /
    • pp.319-321
    • /
    • 1994
  • When a few eigenvalues and eigenvectors are desired, Rayleigh Quotient Iteration(RQI) is widely used. The ROI, however, cannot give maximum or minimum eigenvalue/eigenvector. In this paper, Modified Rayleigh quotient Iteration(MRQI) is developed. The MRQI can give the maximum or minimum eigenvalue/eigenvector regardless of tile initial starting vector.

  • PDF

APPROXIMATION RESULTS OF A THREE STEP ITERATION METHOD IN BANACH SPACE

  • Omprakash Sahu;Amitabh Banerjee
    • Korean Journal of Mathematics
    • /
    • v.31 no.3
    • /
    • pp.269-294
    • /
    • 2023
  • The purpose of this paper is to introduce a new three-step iterative process and show that our iteration scheme is faster than other existing iteration schemes in the literature. We provide a numerical example supported by graphs and tables to validate our proofs. We also prove convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some weak and strong convergence theorems for nonexpansive mappings.

STRONG CONVERGENCE OF MODIFIED ISHIKAWA ITERATION FOR TWO RELATIVELY NONEXPANSIVE MAPPINGS IN A BANACH SPACE

  • Liu, Ying;Wang, Xian;He, Zhen
    • East Asian mathematical journal
    • /
    • v.25 no.1
    • /
    • pp.97-105
    • /
    • 2009
  • In this paper, we prove a strong convergence theorem for a common fixed point of two relatively nonexpansive mappings in a Banach space by using the modified Ishikawa iteration method. Our results improved and extend the corresponding results announced by many others.

The Influence of Iteration and Subset on True X Method in F-18-FPCIT Brain Imaging (F-18-FPCIP 뇌 영상에서 True-X 재구성 기법을 기반으로 했을 때의 Iteration과 Subset의 영향)

  • Choi, Jae-Min;Kim, Kyung-Sik;NamGung, Chang-Kyeong;Nam, Ki-Pyo;Im, Ki-Cheon
    • The Korean Journal of Nuclear Medicine Technology
    • /
    • v.14 no.1
    • /
    • pp.122-126
    • /
    • 2010
  • Purpose: F-18-FPCIT that shows strong familiarity with DAT located at a neural terminal site offers diagnostic information about DAT density state in the region of the striatum especially Parkinson's disease. In this study, we altered the iteration and subset and measured SUV${\pm}$SD and Contrasts from phantom images which set up to specific iteration and subset. So, we are going to suggest the appropriate range of the iteration and subset. Materials and Methods: This study has been performed with 10 normal volunteers who don't have any history of Parkinson's disease or cerebral disease and Flangeless Esser PET Phantom from Data Spectrum Corporation. $5.3{\pm}0.2$ mCi of F-18-FPCIT was injected to the normal group and PET Phantom was assembled by ACR PET Phantom Instructions and it's actual ratio between hot spheres and background was 2.35 to 1. Brain and Phantom images were acquired after 3 hours from the time of the injection and images were acquired for ten minutes. Basically, SIEMENS Bio graph 40 True-point was used and True-X method was applied for image reconstruction method. The iteration and Subset were set to 2 iterations, 8 subsets, 3 iterations, 16 subsets, 6 iterations, 16 subsets, 8 iterations, 16 subsets and 8 iterations, 21 subsets respectively. To measure SUVs on the brain images, ROIs were drawn on the right Putamen. Also, Coefficient of variance (CV) was calculated to indicate the uniformity at each iteration and subset combinations. On the phantom study, we measured the actual ratio between hot spheres and back ground at each combinations. Same size's ROIs were drawn on the same slide and location. Results: Mean SUVs were 10.60, 12.83, 13.87, 13.98 and 13.5 at each combination. The range of fluctuation by sets were 22.36%, 10.34%, 1.1%, and 4.8% respectively. The range of fluctuation of mean SUV was lowest between 6 iterations 16 subsets and 8 iterations 16 subsets. CV showed 9.07%, 11.46%, 13.56%, 14.91% and 19.47% respectively. This means that the numerical value of the iteration and subset gets higher the image's uniformity gets worse. The range of fluctuation of CV by sets were 2.39, 2.1, 1.35, and 4.56. The range of fluctuation of uniformity was lowest between 6 iterations, 16 subsets and 8 iterations, 16 subsets. In the contrast test, it showed 1.92:1, 2.12:1, 2.10:1, 2.13:1 and 2.11:1 at each iteration and subset combinations. A Setting of 8 iterations and 16 subsets reappeared most close ratio between hot spheres and background. Conclusion: Findings on this study, SUVs and uniformity might be calculated differently caused by variable reconstruction parameters like filter or FWHM. Mean SUV and uniformity showed the lowest range of fluctuation at 6 iterations 16 subsets and 8 iterations 16 subsets. Also, 8 iterations 16 subsets showed the nearest hot sphere to background ratio compared with others. But it can not be concluded that only 6 iterations 16 subsets and 8 iterations 16 subsets can make right images for the clinical diagnosis. There might be more factors that can make better images. For more exact clinical diagnosis through the quantitative analysis of DAT density in the region of striatum we need to secure healthy people's quantitative values.

  • PDF