• Title/Summary/Keyword: 일차행렬방정식

Search Result 11, Processing Time 0.022 seconds

On Representations of Linear Systems and Analysis for the Meaning of Elimination Method (연립일차방정식의 다양한 표현과 소거법의 의미에 관한 연구)

  • Kim, Jin Hwan;Park, Kyo Sik
    • School Mathematics
    • /
    • v.17 no.3
    • /
    • pp.407-421
    • /
    • 2015
  • Linear system is a basic subject matter of school mathematics courses. Even though elimination is a useful method to solve linear systems, its fundamental principles were not discussed pedagogically. The purpose of this study is to help the development of mathematical content knowledge on linear systems conceptions. To do this, various representations and translations among them were considered, and in particular, the basic principles for elimination method are analyzed geometrically. Rectangular representation is used to solve word problem treated in numbers of things in elementary mathematics and it is useful as a pre-stage to introduce elimination. Slopes and intercepts of lines associated linear equations are used to obtain the Cramer's formula and this solving method was showing the connection between algebraic and geometric procedures. Strategy deleting variables of linear systems by elementary operations is explored and associated with the movements of lines in the family of lines passing through a fixed point. The development of mathematical content knowledge is expected to enhance pedagogical content knowledges.

Localization using Centroid in Wireless Sensor Networks (무선 센서 네트워크에서 위치 측정을 위한 중점 기 법)

  • Kim Sook-Yeon;Kwon Oh-Heum
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.574-582
    • /
    • 2005
  • Localization in wireless sensor networks is essential to important network functions such as event detection, geographic routing, and information tracking. Localization is to determine the locations of nodes when node connectivities are given. In this paper, centroid approach known as a distributed algorithm is extended to a centralized algorithm. The centralized algorithm has the advantage of simplicity. but does not have the disadvantage that each unknown node should be in transmission ranges of three fixed nodes at least. The algorithm shows that localization can be formulated to a linear system of equations. We mathematically show that the linear system have a unique solution. The unique solution indicates the locations of unknown nodes are capable of being uniquely determined.

An Analytical Method for Kinematic Analysis of The Planting Mechanism of A rice Transplanter (이앙기 식부기구 기구학적 분석을 위한 해석적방법)

  • 김경욱;정창주
    • Journal of Biosystems Engineering
    • /
    • v.2 no.2
    • /
    • pp.15-36
    • /
    • 1977
  • 일반적으로 기계의 분석법은 도해적 방법으로 대별할 수 있다. 도해적 방법이 간편하지만 그 정학성이 부정하고 해석적 방법은 복잡한 계산과정을 요구한다. 최근 많은 컴퓨터 시설은 해석적 방법의 활용을 가능케 하였으나 간단한 기구의 분석은 EH한 경제적인 면에서 컴퓨터의 광범위한 사용을 어렵게 하고 있다. 본 연구는 소형 계산기를 이용하여 크랭크로커 기구를 분석할 수 있는 분석적 방법을 위한 방정식을 유도하고 이 방법을 동력 이앙기의 직촌기구의 분석에 적용하였다. 기구 표시법으로 크랭크-로커 기구를 심볼 방정식으로 나타내고, 기구상의 각 링크에 고정된 좌표계를 3$\times$3행렬식을 이용하여 좌표계를 전이 시키는 방법으로 방정식들을 유도하였다. 크랭크-로커 기구의 링크상의 어떤 한점의 위치벡타를 행렬 방정식으로 표시하고 이 행렬 방정식을 일차, 이차 미분하여 그 점에 대한 속도와 가속도 방정식은 유도하였다.

  • PDF

행렬의 고유치의 수치해법

  • 이두성
    • Journal of the KSME
    • /
    • v.26 no.5
    • /
    • pp.389-393
    • /
    • 1986
  • 고유치는 여러 공학문제에서 중요하다. 예를들어 비행기의 안전성은 어떤 행렬(matrix)의 고유 치에 의해서 결정된다. 보의 고유진동수는 실제로 행렬의 고유치이다. 좌굴(buckling) 해석도 행렬의 고유치를 구하는 문제이다. 고유치는 여러 수학적인 문제의 해석에서도 자연히 발생한다. 상수계수 일계연립상미분방정식의 해는 그 계수행렬의 고유치로 구할 수 있다. 또한 행렬의 제곱의 수렬 $A,{\;}A^{2},{\;}A^{3},{\;}{\cdots}$의 거동은 A의 고유치로서 가장 쉽게 해석할 수 있다. 이러한 수렬은 연립일차방정식(비선형)의 반복해에서 발생한다. 따라서 이 강좌에서는 행렬의 고유치를 수치적으로 구하는 문제에 대하여 고찰 하고자 한다. 실 또는 보소수 .lambda.가 행렬 B의 고유치라 함은 영이 아닌 벡터 y가 존재하여 $By={\lambda}y$ 가 성립할 때이다. 여기서 벡터 y를 고유치 ${\lambda}$에 속하는 B의 고유벡터라 한다. 윗식은 또 $(B-{\lambda}I)y=0$의 형으로도 써 줄 수 있다. 행렬의 고유치를 수치적으로 구하는 방법에는 여러 가지 방법이 있으나 그 중에서 효과있는 Danilevskii 방법을 소개 하고자 한다. 이 Danilevskii 방법에 의하여 특 성다항식(Characteristic polynomial)을 얻을 수 있고 이 다항식의 근을 얻는 방법 중에 Bairstow 방법 (또는 Hitchcock 방법)이 있는데 이에 대하여 아울러 고찰하고자 한다.

  • PDF

A Review of Teaching the Concept of the Matrix in relation to Historico-Genetic Principle (역사발생적 관점에서 본 행렬 지도의 재음미)

  • Cho, Seong-Min
    • Journal of the Korean School Mathematics Society
    • /
    • v.12 no.1
    • /
    • pp.99-114
    • /
    • 2009
  • Although they are interested in Linear Algebra not only in science and engineering but also in humanities and sociology recently, a study of teaching linear algebra is not relatively abundant because linear algebra was taken as basic course in colleges just for 20-30 years. However, after establishing The Linear Algebra Curriculum Study Group in January, 1990, a variety of attempts to improve teaching linear algebra have been emerging. This article looks into series of studies related with teaching matrix. For this the method for teaching the concepts of matrix in relation to historico-genetic principle looking through the process of the conceptual development of matrix-determinants, matrix-systems of linear equations and linear transformation.

  • PDF

Location Estimation based on Edge Weights in Wireless Sensor Networks (무선 센서 네트워크에서 에지 가중치를 이용하여 위치를 측정하는 기법)

  • Kim Sook-Yeon;Kwon Oh-Heum
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10A
    • /
    • pp.938-948
    • /
    • 2005
  • Localization in wireless sensor networks is to determine the positions of all nodes based on the Down positions of several nodes. Much previous work for localization use multilateration or triangulation based on measurement of angles or distances to the fixed nodes. In this paper, we propose a new centralized algorithm for localization using weights of adjacent nodes. The algorithm, having the advantage of simplicity, shows that the localization problem can be formulated to a linear matrix equalities. We mathematically show that the equalities have a unique solution. The unique solution indicates the locations of unknown nodes are capable of being uniquely determined. Three kinds of weights proposed for practical use are compared in simulation analysis.

Numerical Dispersion and Its Control for 1-D Finite Element Simulation of Stress Wave Propagation (응력파 전파 수치모의를 위한 일차원 유한요소모형의 분산 특성 및 제어)

  • 이종세;유한규;윤성범
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.17 no.1
    • /
    • pp.75-82
    • /
    • 2004
  • With an aim at eliminating the numerical dispersion error arising from the numerical simulation of stress wave propagation, numerical dispersion characteristics of the wave equation based one-dimensional finite element model are analyzed and some dispersion control scheme are proposed in this paper The dispersion analyses are carried out for two types of mass matrix, namely the consistent and the lumped mass matrices. Based on the finding of the analyses, dispersion correction techniques are developed for both the implicit and explicit schemes. For the implicit scheme, either the weighting factor for the spatial derivatives of each time level or the lumping coefficient for mass matrix is adjusted to minimize the numerical dispersion. In the case of the explicit scheme an artificial dispersion term is introduced in the governing equation. The validity of the dispersion correction techniques proposed in this study is demonstrated by comparing the numerical solutions obtained using the Present techniques with the analytical ones.

A Study on the Efficient Synthesis of Nonuniform Transmission Line Filters using Zakharov-Shabat Coupled Mode Equation (Zakharov-Shabat 결합모드 방정식을 사용한 불균일 전송선로 필터의 효율적인 합성에 관한 연구)

  • 장완규;박의준
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.12
    • /
    • pp.1283-1291
    • /
    • 2003
  • Nonuniform transmission lines(NTLs) with the desired frequency response can be realized by synthesizing the potential from the coupled mode Zakharov-Shabat(ZS) equation in the one-dimensional inverse scattering problem. In this study, an efficient synthesis method using the ZS equations is presented for NTLs with arbitrarily specified reflection coefficients which take the restricted potential. This method lessens the line length which plague conventional design schemes using specific windows for reflection coefficients. Furthermore solving the ZS inverse transform problem is simplified by adopting the successive approach instead of the conventional iterative method. The proposed method is compared with the conventional method using specific windows by applying to design of dispersive NTL filters, and verified by two-port analysis through the chain matrix.

Analysis of teaching and learning contents of matrix in German high school mathematics (독일 고등학교 수학에서 행렬 교수·학습 내용 분석)

  • Ahn, Eunkyung;Ko, Ho Kyoung
    • The Mathematical Education
    • /
    • v.62 no.2
    • /
    • pp.269-287
    • /
    • 2023
  • Matrix theory is widely used not only in mathematics, natural sciences, and engineering, but also in social sciences and artificial intelligence. In the 2009 revised mathematics curriculum, matrices were removed from high school math education to reduce the burden on students, but in anticipation of the age of artificial intelligence, they will be reintegrated into the 2022 revised education curriculum. Therefore, there is a need to analyze the matrix content covered in other countries to suggest a meaningful direction for matrix education and to derive implications for textbook composition. In this study, we analyzed the German mathematics curriculum and standard education curriculum, as well as the matrix units in the German Hesse state mathematics curriculum and textbook, and identified the characteristics of their content elements and development methods. As a result of our analysis, it was found that the German textbooks cover matrices in three categories: matrices for solving linear equations, matrices for explaining linear transformations, and matrices for explaining transition processes. It was also found that the emphasis was on mathematical reasoning and modeling when learning matrices. Based on these findings, we suggest that if matrices are to be reintegrated into school mathematics, the curriculum should focus on deep conceptual understanding, mathematical reasoning, and mathematical modeling in textbook composition.

Efficient Iterative Physical Optics(IPO) Algorithms for Calculation of RCS (RCS 계산을 위한 효율적인 IPO 계산 방법)

  • Lee, Hyunsoo;Jung, Ki-Hwan;Chae, Dae-Young;Koh, Il-Suek
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.5
    • /
    • pp.601-606
    • /
    • 2014
  • The IPO(Iterative Physical Optics) method repeatedly applies the well-known PO(Physical Optics) approximation to calculate the scattered field by a large object. Thus, the IPO method can consider the multiple scattering in the object, which is ignored for the PO approximation. This kind of iteration can improve the final accuracy of the induced current on the scatterer, which can result in the enhancement of the accuracy of the RCS(Radar Cross Section) of the scatterer. Since the IPO method can not exactly but approximately solve the required integral equation, however, the convergence of the IPO solution can not be guaranteed. Hence, we apply the famous techniques used in the inversion of a matrix to the IPO method, which include Jacobi, Gauss-Seidel, SOR(Successive Over Relaxation) and Richardson methods. The proposed IPO methods can efficiently calculate the RCS of a large scatterer, and are numerically verified.