• Title/Summary/Keyword: Matrices

Search Result 2,628, Processing Time 0.034 seconds

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.

Marguerre shell type secant matrices for the postbuckling analysis of thin, shallow composite shells

  • Arul Jayachandran, S.;Kalyanaraman, V.;Narayanan, R.
    • Structural Engineering and Mechanics
    • /
    • v.18 no.1
    • /
    • pp.41-58
    • /
    • 2004
  • The postbuckling behaviour of thin shells has fascinated researchers because the theoretical prediction and their experimental verification are often different. In reality, shell panels possess small imperfections and these can cause large reduction in static buckling strength. This is more relevant in thin laminated composite shells. To study the postbuckling behaviour of thin, imperfect laminated composite shells using finite elements, explicit incremental or secant matrices have been presented in this paper. These incremental matrices which are derived using Marguerre's shallow shell theory can be used in combination with any thin plate/shell finite element (Classical Laminated Plate Theory - CLPT) and can be easily extended to the First Order Shear deformation Theory (FOST). The advantage of the present formulation is that it involves no numerical approximation in forming total potential energy of the shell during large deformations as opposed to earlier approximate formulations published in the literature. The initial imperfection in shells could be modeled by simply adjusting the ordinate of the shell forms. The present formulation is very easy to implement in any existing finite element codes. The secant matrices presented in this paper are shown to be very accurate in tracing the postbuckling behaviour of thin isotropic and laminated composite shells with general initial imperfections.

The Toeplitz Circulant Jacket Matrices (The Toeplitz Circulant Jacket 행렬)

  • Park, Ju Yong;Kim, Jeong Su;Szollosi, Ferenc;Lee, Moon Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.7
    • /
    • pp.19-26
    • /
    • 2013
  • In this paper we prove that all Jacket matrices are circulant and up to equivalence. This result leads to new constructions of Toeplitz Jacket(TJ) matrices. We present the construction schemes of Toeplitz Jacket matrices and the examples of $4{\times}4$ and $8{\times}8$ Toeplitz Jacket matrices. As a corollary we show that a Toeplitz real Hadamard matrix is either circulant or negacyclic.

A High Throughput Multiple Transform Architecture for H.264/AVC Fidelity Range Extensions

  • Ma, Yao;Song, Yang;Ikenaga, Takeshi;Goto, Satoshi
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.7 no.4
    • /
    • pp.247-253
    • /
    • 2007
  • In this paper, a high throughput multiple transform architecture for H.264 Fidelity Range Extensions (FRExt) is proposed. New techniques are adopted which (1) regularize the $8{\times}8$ integer forward and inverse DCT transform matrices, (2) divide them into four $4{\times}4$ sub-matrices so that simple fast butterfly algorithm can be used, (3) because of the similarity of the sub-matrices, mixed butterflies are proposed that all the sub-matrices of $8{\times}8$ and matrices of $4{\times}4$ forward DCT (FDCT), inverse DCT (IDCT) and Hadamard transform can be merged together. Based on these techniques, a hardware architecture is realized which can achieve throughput of 1.488Gpixel/s when processing either $4{\times}4\;or\;8{\times}8$ transform. With such high throughput, the design can satisfy the critical requirement of the real-time multi-transform processing of High Definition (HD) applications such as High Definition DVD (HD-DVD) ($1920{\times}1080@60Hz$) in H.264/AVC FRExt. This work has been synthesized using Rohm 0.18um library. The design can work on a frequency of 93MHz and throughput of 1.488Gpixel/s with a cost of 56440 gates.

Evaluation of damage probability matrices from observational seismic damage data

  • Eleftheriadou, Anastasia K.;Karabinis, Athanasios I.
    • Earthquakes and Structures
    • /
    • v.4 no.3
    • /
    • pp.299-324
    • /
    • 2013
  • The current research focuses on the seismic vulnerability assessment of typical Southern Europe buildings, based on processing of a large set of observational damage data. The presented study constitutes a sequel of a previous research. The damage statistics have been enriched and a wider damage database (178578 buildings) is created compared to the one of the first presented paper (73468 buildings) with Damage Probability Matrices (DPMs) after the elaboration of the results from post-earthquake surveys carried out in the area struck by the 7-9-1999 near field Athens earthquake. The dataset comprises buildings which developed damage in several degree, type and extent. Two different parameters are estimated for the description of the seismic demand. After the classification of damaged buildings into structural types they are further categorized according to the level of damage and macroseismic intensity. The relative and the cumulative frequencies of the different damage states, for each structural type and each intensity level, are computed and presented, in terms of damage ratio. Damage Probability Matrices (DPMs) are obtained for typical structural types and they are compared to existing matrices derived from regions with similar building stock and soil conditions. A procedure is presented for the classification of those buildings which initially could not be discriminated into structural types due to restricted information and hence they had been disregarded. New proportional DPMs are developed and a correlation analysis is fulfilled with the existing vulnerability relations.

Patch based Semi-supervised Linear Regression for Face Recognition

  • Ding, Yuhua;Liu, Fan;Rui, Ting;Tang, Zhenmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.3962-3980
    • /
    • 2019
  • To deal with single sample face recognition, this paper presents a patch based semi-supervised linear regression (PSLR) algorithm, which draws facial variation information from unlabeled samples. Each facial image is divided into overlapped patches, and a regression model with mapping matrix will be constructed on each patch. Then, we adjust these matrices by mapping unlabeled patches to $[1,1,{\cdots},1]^T$. The solutions of all the mapping matrices are integrated into an overall objective function, which uses ${\ell}_{2,1}$-norm minimization constraints to improve discrimination ability of mapping matrices and reduce the impact of noise. After mapping matrices are computed, we adopt majority-voting strategy to classify the probe samples. To further learn the discrimination information between probe samples and obtain more robust mapping matrices, we also propose a multistage PSLR (MPSLR) algorithm, which iteratively updates the training dataset by adding those reliably labeled probe samples into it. The effectiveness of our approaches is evaluated using three public facial databases. Experimental results prove that our approaches are robust to illumination, expression and occlusion.

Optimal Wiener-Hopf Decoupling Controller Formula for State-space Algorithms

  • Park, Ki-Heon;Kim, Jin-Geol
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.4
    • /
    • pp.471-478
    • /
    • 2007
  • In this paper, an optimal Wiener-Hopf decoupling controller formula is obtained which is expressed in terms of rational matrices, thereby readily allowing the use of state-space algorithms. To this end, the characterization formula for the class of all realizable decoupling controller is formulated in terms of rational functions. The class of all stabilizing and decoupling controllers is parametrized via the free diagonal matrices and the optimal decoupling controller is determined from these free matrices.

On Testing Fisher's Linear Discriminant Function When Covariance Matrices Are Unequal

  • Kim, Hea-Jung
    • Journal of the Korean Statistical Society
    • /
    • v.22 no.2
    • /
    • pp.325-337
    • /
    • 1993
  • This paper propose two test statistics which enable us to proceed the variable selection in Fisher's linear discriminant function for the case of heterogeneous discrimination with equal training sample size. Simultaneous confidence intervals associated with the test are also given. These are exact and approximate results. The latter is based upon an approximation of a linear sum of Wishart distributions with unequal scale matrices. Using simulated sampling experiments, powers of the two tests have been tabulated, and power comparisons have been made between them.

  • PDF

IDEMPOTENT MATRIX PRESERVERS OVER BOOLEAN ALGEBRAS

  • Song, Seok-Zun;Kang, Kyung-Tae;Beasley Leroy B.
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.1
    • /
    • pp.169-178
    • /
    • 2007
  • We consider the set of $n{\times}n$ idempotent matrices and we characterize the linear operators that preserve idempotent matrices over Boolean algebras. We also obtain characterizations of linear operators that preserve idempotent matrices over a chain semiring, the nonnegative integers and the nonnegative reals.