• Title/Summary/Keyword: Mathematical Computing

Search Result 342, Processing Time 0.028 seconds

Middle School Students' Perceptions about and Mathematical Proficiency in Constructed-Response Items (수학 논술형 문항에 대한 중학생들의 인식 및 수학적 숙련도)

  • Park, SeokSun;Kim, Gooyeon
    • Journal of the Korean School Mathematics Society
    • /
    • v.16 no.1
    • /
    • pp.63-86
    • /
    • 2013
  • This study aimed to explore how middle school students perceive constructed-response items and how they solve those items and the patterns of the processes. For this purpose, data were collected from middle school students through survey, written responses on those items that were developed for this particular purpose, and interviews. The survey data were analyzed by using Excel and the written responses and interview data qualitatively. The findings about the students' perceptions about the constructed-response items suggested that the middle school students perceive the items primarily as involving writing solutions logically(17%) and being capable of explaining while solving them(7%). The most difficulties they encounter when solving the items were understanding(26%), applying(12%), mathematical writing(25%), computing(23%), and reasoning(14%). The findings about the students' mathematical proficiencies showed that they made an error most in reasoning (35%), then in understanding(31%), in applying(9%), and least in computing(3%).

  • PDF

Morava K- theory of the double loop spaces of quaternionic stieffel manifolds

  • Park, Younggi
    • Bulletin of the Korean Mathematical Society
    • /
    • v.34 no.3
    • /
    • pp.359-370
    • /
    • 1997
  • In this paper we get the Morava K-theory of the double loop spaces of quarternionic Stiefel manifolds for an odd prime p by computing the Atiyah - Hirzebruch spectral sequence. We also get the homology with Z/(p) coefficients and analyze p torsion in the homology with Z coefficients.

  • PDF

TRANSFORMS AND CONVOLUTIONS ON FUNCTION SPACE

  • Chang, Seung-Jun;Choi, Jae-Gil
    • Communications of the Korean Mathematical Society
    • /
    • v.24 no.3
    • /
    • pp.397-413
    • /
    • 2009
  • In this paper, for functionals of a generalized Brownian motion process, we show that the generalized Fourier-Feynman transform of the convolution product is a product of multiple transforms and that the conditional generalized Fourier-Feynman transform of the conditional convolution product is a product of multiple conditional transforms. This allows us to compute the (conditional) transform of the (conditional) convolution product without computing the (conditional) convolution product.

ERROR ANALYSIS OF THE hp-VERSION UNDER NUMERICAL INTEGRATIONS FOR NON-CONSTANT COEFFICIENTS

  • KIM, IK-SUNG
    • Honam Mathematical Journal
    • /
    • v.27 no.2
    • /
    • pp.317-332
    • /
    • 2005
  • In this paper we consider the hp-version to solve non-constant coefficients elliptic equations on a bounded, convex polygonal domain ${\Omega}$ in $R^2$. A family $G_p=\{I_m\}$ of numerical quadrature rules satisfying certain properties can be used for calculating the integrals. When the numerical quadrature rules $I_m{\in}G_p$ are used for computing the integrals in the stiffness matrix of the variational form we will give its variational form and derive an error estimate of ${\parallel}u-{\widetilde{u}}^h_p{\parallel}_{1,{\Omega}$.

  • PDF

A domain decomposition method applied to queuing network problems

  • Park, Pil-Seong
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.3
    • /
    • pp.735-750
    • /
    • 1995
  • We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

  • PDF

RESOLUTION OF THE CONJECTURE ON STRONG PRESERVERS OF MULTIVARIATE MAJORIZATION

  • Beasley, Leroy-B.;Lee, Sang-Gu;Lee, You-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.39 no.2
    • /
    • pp.283-287
    • /
    • 2002
  • In this paper, we will investigate the set of linear operators on real square matrices that strongly preserve multivariate majorisation without any additional conditions on the operator. This answers earlier conjecture on nonnegative matrices in [3] .

TORSION IN THE HOMOLOGY OF THE DOUBLE LOOP SPACES OF COMPACT SIMPLE LIE GROUPS

  • Choi, Young-Gi;Yoon, Seong-Hee
    • Journal of the Korean Mathematical Society
    • /
    • v.39 no.1
    • /
    • pp.149-161
    • /
    • 2002
  • We study the torsions in the integral homology of the double loop space of the compact simple Lie groups by determining the higher Bockstein actions on the homology of those spaces through the Bockstein lemma and computing the Bockstein spectral sequence.

DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES

  • Alahmadi, Adel;Alkenani, Ahmad;Kim, Jon-Lark;Shi, Minjia;Sole, Patrick
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.2
    • /
    • pp.497-505
    • /
    • 2017
  • The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.

RIGHT AND LEFT QUOTIENT OF TWO BOUNDED OPERATORS ON HILBERT SPACES

  • Benharrat, Mohammed
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.547-563
    • /
    • 2020
  • We define a left quotient as well as a right quotient of two bounded operators between Hilbert spaces, and we parametrize these two concepts using the Moore-Penrose inverse. In particular, we show that the adjoint of a left quotient is a right quotient and conversely. An explicit formulae for computing left (resp. right) quotient which correspond to adjoint, sum, and product of given left (resp. right) quotient of two bounded operators are also shown.

Code automorphism group algorithms and applications

  • Cho, Han-Hyuk;Shin, Hye-Sun;Yeo, Tae-Kyung
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.3
    • /
    • pp.575-584
    • /
    • 1996
  • We investigate how the code automorphism groups can be used to study such combinatorial objects as codes, finite projective planes and Hadamard matrices. For this purpose, we write down a computer program for computing code automorphisms in PASCAL language. Then we study the combinatorial properties using those code automorphism group algorithms and the relationship between combinatorial objects and codes.

  • PDF