• Title/Summary/Keyword: 반복계산법

Search Result 412, Processing Time 0.04 seconds

A Study for Improving Computational Efficiency in Method of Moments with Loop-Star Basis Functions and Preconditioner (루프-스타(Loop-Star) 기저 함수와 전제 조건(Preconditioner)을 이용한 모멘트법의 계산 효율 향상에 대한 연구)

  • Yeom, Jae-Hyun;Park, Hyeon-Gyu;Lee, Hyun-Suck;Chin, Hui-Cheol;Kim, Hyo-Tae;Kim, Kyung-Tae
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.2
    • /
    • pp.169-176
    • /
    • 2012
  • This paper uses loop-star basis functions to overcome the low frequency breakdown problem in method of moments (MoM) based on electric field integral equation(EFIE). In addition, p-Type Multiplicative Schwarz preconditioner (p-MUS) technique is employed to reduce the number of iterations required for the conjugate gradient method(CGM). Low frequency instability with Rao Wilton Glisson(RWG) basis functions in EFIE can be resolved using loop-start basis functions and frequency normalized techniques. However, loop-star basis functions, consisting of irrotational and solenoidal components of RWG basis functions, require a large number of iterations to calculate a solution through iterative methods, such as conjugate gradient method(CGM), due to high condition number. To circumvent this problem, in this paper, the pMUS preconditioner technique is proposed to reduce the number of iterations in CGM. Simulation results show that pMUS preconditioner is much faster than block diagonal preconditioner(BDP) when the sparsity of pMUS is the same as that of BDP.

Development of MLS Difference Method for Material Nonlinear Problem (MLS차분법을 이용한 재료비선형 문제 해석)

  • Yoon, Young-Cheol
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.29 no.3
    • /
    • pp.237-244
    • /
    • 2016
  • This paper presents a nonlinear Moving Least Squares(MLS) difference method for material nonlinearity problem. The MLS difference method, which employs strong formulation involving the fast derivative approximation, discretizes governing partial differential equation based on a node model. However, the conventional MLS difference method cannot explicitly handle constitutive equation since it solves solid mechanics problems by using the Navier's equation that unifies unknowns into one variable, displacement. In this study, a double derivative approximation is devised to treat the constitutive equation of inelastic material in the framework of strong formulation; in fact, it manipulates the first order derivative approximation two times. The equilibrium equation described by the divergence of stress tensor is directly discretized and is linearized by the Newton method; as a result, an iterative procedure is developed to find convergent solution. Stresses and internal variables are calculated and updated by the return mapping algorithm. Effectiveness and stability of the iterative procedure is improved by using algorithmic tangent modulus. The consistency of the double derivative approximation was shown by the reproducing property test. Also, accuracy and stability of the procedure were verified by analyzing inelastic beam under incremental tensile loading.

Recursive Estimation of Euclidean Distance between Probabilities based on A Set of Random Symbols (랜덤 심볼열에 기반한 확률분포의 반복적 유클리드 거리 추정법)

  • Kim, Namyong
    • Journal of Internet Computing and Services
    • /
    • v.15 no.4
    • /
    • pp.119-124
    • /
    • 2014
  • Blind adaptive systems based on the Euclidean distance (ED) between the distribution function of the output samples and that of a set of random symbols generated at the receiver matching with the distribution function of the transmitted symbol points estimate the ED at each iteration time to examine its convergence state or its minimum ED value. The problem is that this ED estimation obtained by block?data processing requires a heavy calculation burden. In this paper, a recursive ED estimation method is proposed that reduces the computational complexity by way of utilizing the relationship between the current and previous states of the datablock. The relationship provides a ground that the currently estimated ED value can be used for the estimation of the next ED without the need for processing the whole new data block. From the simulation results the proposed recursive ED estimation shows the same estimation values as that of the conventional method, and in the aspect of computational burden, the proposed method requires only O(N) at each iteration time while the conventional block?processing method does $O(N^2)$.

A Semi-Noniterative VQ Design Algorithm for Text Dependent Speaker Recognition (문맥종속 화자인식을 위한 준비반복 벡터 양자기 설계 알고리즘)

  • Lim, Dong-Chul;Lee, Haing-Sei
    • The KIPS Transactions:PartB
    • /
    • v.10B no.1
    • /
    • pp.67-72
    • /
    • 2003
  • In this paper, we study the enhancement of VQ (Vector Quantization) design for text dependent speaker recognition. In a concrete way, we present the non-Iterative method which makes a vector quantization codebook and this method Is nut Iterative learning so that the computational complexity is epochally reduced. The proposed semi-noniterative VQ design method contrasts with the existing design method which uses the iterative learning algorithm for every training speaker. The characteristics of a semi-noniterative VQ design is as follows. First, the proposed method performs the iterative learning only for the reference speaker, but the existing method performs the iterative learning for every speaker. Second, the quantization region of the non-reference speaker is equivalent for a quantization region of the reference speaker. And the quantization point of the non-reference speaker is the optimal point for the statistical distribution of the non-reference speaker In the numerical experiment, we use the 12th met-cepstrum feature vectors of 20 speakers and compare it with the existing method, changing the codebook size from 2 to 32. The recognition rate of the proposed method is 100% for suitable codebook size and adequate training data. It is equal to the recognition rate of the existing method. Therefore the proposed semi-noniterative VQ design method is, reducing computational complexity and maintaining the recognition rate, new alternative proposal.

Computational Complexity of BiCGstab(l) in Multi-Level Fast Multipole Method(MLFMM) and Efficient Choice of l (MLFMM(Multi-Level Fast Multipole Method) 방법에 적용된 BiCGstab(l)반복법의 l값에 따른 연산량 분석 및 효율적인 l값)

  • Lee, Hyunsoo;Rim, Jae-Won;Koh, Il-Suek;Seo, Seung-Mo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.29 no.3
    • /
    • pp.167-170
    • /
    • 2018
  • The method of moments(MoM) is one of the most popular integral-equation-based full-wave simulation methods, and the multi-level fast multipole method(MLFMM) algorithm can be used for its efficient calculation. When calculating the surface current on the large scatterer in the MoM or MLFMM, iterative methods for the final matrix inversion are used. Among them, BiCGstab(l) has been widely adopted due to its good convergence rate. The number of iterations can be reduced when l becomes larger, but the number of operations per iteration is increased. Herein, we analyze the computational complexity of BiCGstab(l) in the MLFMM method and propose an optimum choice of l.

The Computation of Stress Intensity Factor of the Crack on the Surface of the Pin Joint (핀으로 연결된 결합부분의 표면에 위치한 균열의 응력확대계수 계산)

  • 정동수;이기수
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.921-927
    • /
    • 1996
  • The purpose of this study is to compute the stress intensity factors of various conditions in the cracked p! ate. The stress intensity factor of pin-loaded cracked plate is investigated using the finite element method. This paper is divided into the two parts. The first part is the contact analysis, and the second is to compute the stress intensity factors. In the contact analysis, the iterative method is used, and convergence of this method is presented. In the computation of the stress intensity factors of plate, the length of crack, clearance, and angle are considered

  • PDF

Directivity Synthesis Simulation of Ultrasonic Transducer Using Gauss Elimination Method (GAUSS 소거법을 이용한 초음파 트랜스듀서의 지향성합성 SIMULATION)

  • 이정남;조기량;이진선;이문수
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.6 no.4
    • /
    • pp.20-27
    • /
    • 1995
  • A numerical simulation is carried out on the directivity synthesis of ultrasonic transducers by point source array. Gauss elimination method is practiced by means of a directive method to realize the desired directivity. Desired directivity is chosen to be that of a directivity of line source, a beam width and a direction arbitrary specified. On the numerical result, Gauss elimination method is showed high speed ca- lculative simulation and stability of system more than iterative method(LMS, DFP). Numerical simulations are carried out by PC(CPU:80486 DX2, RAM 16Mbyte).

  • PDF

Structural System Identification by Iterative IRS (반복적 IRS를 이용한 구조 시스템 식별)

  • Baek, Sung-Min;Kim, Hyun-Gi;Kim, Ki-Ook;Cho, Maeng-Hyo
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.1
    • /
    • pp.65-73
    • /
    • 2007
  • In the inverse perturbation method, enormous computational resource was required to obtain reliable results, because all unspecified DOFs were considered as unknown variables. Thus, in the present study, a reduced system method is used to condense the unspecified DOFs by using the specified DOFs, and to improve the computational efficiency as well as the solution accuracy. In most of the conventional reduction methods, transformation errors occur in the transformation matrix between the unspecified DOFs and the specified DOFs. Thus it is hard to obtain reliable and accurate solution of inverse perturbation problems by reduction methods due to the error in the transformation matrix. This numerical trouble is resolved in the present study by adopting iterative improved reduced system(IIRS) as well as by updating the transformation matrix at every step. In this reduction method, system accuracy is related to the selection of the primary DOFs and Iteration time. And both are dependent to each other So, the two level condensation method (TLCS) is selected as Selection method of primary DOFs for increasing accuracy and reducing iteration time. Finally, numerical verification results of the present iterative inverse perturbation method (IIPM) are presented.

A Classified Space VQ Design for Text-Independent Speaker Recognition (문맥 독립 화자인식을 위한 공간 분할 벡터 양자기 설계)

  • Lim, Dong-Chul;Lee, Hanig-Sei
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.673-680
    • /
    • 2003
  • In this paper, we study the enhancement of VQ (Vector Quantization) design for text independent speaker recognition. In a concrete way, we present a non-iterative method which makes a vector quantization codebook and this method performs non-iterative learning so that the computational complexity is epochally reduced The proposed Classified Space VQ (CSVQ) design method for text Independent speaker recognition is generalized from Semi-noniterative VQ design method for text dependent speaker recognition. CSVQ contrasts with the existing desiEn method which uses the iterative learninE algorithm for every traininE speaker. The characteristics of a CSVQ design is as follows. First, the proposed method performs the non-iterative learning by using a Classified Space Codebook. Second, a quantization region of each speaker is equivalent for the quantization region of a Classified Space Codebook. And the quantization point of each speaker is the optimal point for the statistical distribution of each speaker in a quantization region of a Classified Space Codebook. Third, Classified Space Codebook (CSC) is constructed through Sample Vector Formation Method (CSVQ1, 2) and Hyper-Lattice Formation Method (CSVQ 3). In the numerical experiment, we use the 12th met-cepstrum feature vectors of 10 speakers and compare it with the existing method, changing the codebook size from 16 to 128 for each Classified Space Codebook. The recognition rate of the proposed method is 100% for CSVQ1, 2. It is equal to the recognition rate of the existing method. Therefore the proposed CSVQ design method is, reducing computational complexity and maintaining the recognition rate, new alternative proposal and CSVQ with CSC can be applied to a general purpose recognition.