• Title/Summary/Keyword: Gauss elimination method

Search Result 24, Processing Time 0.029 seconds

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

Parallel Computation Algorithm of Gauss Elimination in Power system Analysis (전력계통해석을 위한 자코비안행렬 가우스소거의병렬계산 알고리즘)

  • 서의석;오태규
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.43 no.2
    • /
    • pp.189-196
    • /
    • 1994
  • This paper describes a parallel computing algorithm in Gauss elimination of Jacobian matrix to large-scale power system. The structure of Jacobian matrix becomes different according to ordering method of buses. In sequential computation buses are ordered to minimize the number of fill-in in the triangulation of the Jacobian matrix. The proposed method develops the parallelism in the Gauss elimination by using ND(nested dissection) ordering. In this procedure the level structure of the power system network is transformed to be long and narrow by using end buses which results in balance of computing load among processes and maximization of parallel computation. Each processor uses the sequential computation method to preserve the sqarsity of matrix.

  • PDF

Parallel Computation Algorithm of Gauss Elimination in Power system Analysis (전력계통의 자코비안행렬 가우스소거의 병렬계산)

  • Suh, Eui-Suk;Oh, Tae-Kyoo
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.163-166
    • /
    • 1993
  • This paper describes an parallell computing algorithm in Gauss elimination of Jacobian matrix to large-scale power system. The structure of Jacobian matrix becomes different according to ordering method of buses. In sequential computation buses are ordered to minimize the number of fill-in in the triangulation of the Jacobian matrix. The proposed method using ND(nested dissection) ordering develops the parallelism in the Gauss elimination to have balance of computing load among processes and each processor uses the sequential computation method to preserve the sparsity of matrix.

  • PDF

Performance Optimization of Parallel Algorithms

  • Hudik, Martin;Hodon, Michal
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.436-446
    • /
    • 2014
  • The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.

A Study on the Simultaneous Linear Equations by Computer (전자계산기에 의한 다원연립 일차방정식의 해법에 관한 연구)

  • 이정복
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.8 no.12
    • /
    • pp.127-138
    • /
    • 1985
  • There are several methods which have been presented up to now in solving the simultaneous linear equations by computer. They are Gaussian Elimination Method, Gauss-Jordan Method, Inverse matrix Method and Gauss-Seidel iterative Method. This paper is not only discussed in their mechanisms compared with their algorithms, depicted flow charts, but also calculated the numbers of arithmetic operations and comparisons in order to criticize their availability. Inverse Matrix Method among em is founded out the smallest in the number of arithmetic operation, but is not the shortest operation time. This paper also indicates the many problems in using these methods and propose the new method which is able to applicate to even small or middle size computers.

  • PDF

Image Segmentation Using Bi-directional Distribution Functions of Histogram (히스토그램의 양방향 분포함수를 이용한 영상분할)

  • 남윤석;하영호;김수중
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.6
    • /
    • pp.1020-1024
    • /
    • 1987
  • Image segmentation based on the curvature of bi-directiona distribution functions of histogram with no mode informations is proposed. The curvature is an oscillating function and can be approximated to a polynomial form with a least square method using the Chebyshev basis. Nonhomogeneous linea equations are solved by Gauss-elimination method. In the proposed algorithm, critical points of the curvature are obtained on each direction to compensate the segmentation parameters, which can be ignored in only one-directional histogram.

  • PDF

An Improved Reconstruction Algorithm of Convolutional Codes Based on Channel Error Rate Estimation (채널 오류율 추정에 기반을 둔 길쌈부호의 개선된 재구성 알고리즘)

  • Seong, Jinwoo;Chung, Habong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.951-958
    • /
    • 2017
  • In an attack context, the adversary wants to retrieve the message from the intercepted noisy bit stream without any prior knowledge of the channel codes used. The process of finding out the code parameters such as code length, dimension, and generator, for this purpose, is called the blind recognition of channel codes or the reconstruction of channel codes. In this paper, we suggest an improved algorithm of the blind recovery of rate k/n convolutional encoders in a noisy environment. The suggested algorithm improves the existing algorithm by Marazin, et. al. by evaluating the threshold value through the estimation of the channel error probability of the BSC. By applying the soft decision method by Shaojing, et. al., we considerably enhance the success rate of the channel reconstruction.

Topological Observability Analysis Using Incidence Matrix in Power Systems (접속행열을 이용한 전력계통 입상학적 가관측성 해석)

  • Seog-Joo Kim;Young-Hyun Moon
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.36 no.11
    • /
    • pp.769-776
    • /
    • 1987
  • This paper deals with the topological observability analysis and the development of an observable island identification algorithm for state estimation in power systems, by using the incidence matrix and bus voltage grouping. An analogy of the DC power flow method to the DC circuit analysis is introduced, and all the relationships between power flows and phase angles are replaced by the corresponding current-voltage relation. As a result, a set of topological measurement equation expressed in the form of the incidince matrix is derived for the topological analysis, and the observability test is carried out by examining the rand of the measuremint matrix. The integer Gauss elimination method is introduced in the determination of matrix rand, so that the proposed observability test yields a precise observability criterion without any nearly-zero pivot problem encountered in the conventional algorithm. Also, an observable island identification algorithm reduced its computational time in comparision with the conventional algorithms. The proposed algorithms have been tested for sample systems, and their practicability has verified.

A Study on the Flow Behavior of Magnetic Fluids in a Circular Pipe with a Vertical Magnetic Field (수직자장하에서 원관내 자성유체의 거동에 관한 연구)

  • Park, Joung-Woo;Ryu, Shin-Oh;Seo, Lee-Soo
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.23 no.1
    • /
    • pp.25-32
    • /
    • 1999
  • In the present paper, we theoretically analyze the flow of magnetic fluids in a circular pipe with a vertical magnetic field and investigate the magnetic response by the external magnetic field. Theoretical study through the governing equation derived by Siliomis is carried out with numerical analysis by the Gauss Elimination Method. Using polar and magnetic effect parameters, theoretical equations and distributions for the velocity, vorticity, internal angular momentum and induced magnetization as the magnetic response are shown. Especially, in the region of strong magnetic field the specific property is appeared by finding a critical magnetic effect parameter for a polar effect parameter.

A Study on the Rheology Characteristics of Magnetic Fluids in a Circular Pipe (원관내 자성유체의 Rheology 특성에 관한 연구)

  • Jeon, Eon-Chan;Park, Joung-Woo;Kim, Tae-Ho;Kim, Soo-Yong
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.7 no.2
    • /
    • pp.38-44
    • /
    • 2008
  • In the present paper, we theoretically analyze the flow of magnetic fluids in a circular pipe with a vertical magnetic field and investigate the magnetic response by the external magnetic field. Theoretical study through the governing equation derived by Siliomis is carried out with numerical analysis by the Gauss Elimination Method. Using polar and magnetic effect parameters, theoretical equations and distributions for the velocity, apparent viscosity as the magnetic response are shown. Especially, in the region of strong magnetic field the specific property is appeared by finding a critical magnetic effect parameter for a polar effect parameter.

  • PDF