• 제목/요약/키워드: computational mathematics

검색결과 3,201건 처리시간 0.023초

Computational Thinking based Mathematical Program for Free Semester System

  • Lee, Ji Yoon;Cho, Han Hyuk
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제18권4호
    • /
    • pp.273-288
    • /
    • 2014
  • In recent years, coding education has been globally emphasized and the Free Semester System will be executed to the public schools in Korea from 2016. With the introduction of the Free Semester System and the rising demand of Computational Thinking (CT) capacity, this research aims to design 'learning environment' in which learners can design and construct mathematical objects through computers and print them out through 3D printers. Furthermore, it will design learning mathematics by constructing the figurate number patterns from 'soma cubes' in the playing context and connecting those to algebraic and combinatorial patterns, which will allow students to experience mathematical connectivity. It is expected that the activities of designing figurate number patterns suggested in this research will not only strengthen CT capacity in relation to mathematical thinking but also serve as a meaningful program for the Free Semester System in terms of career experience as 3D printers can be widely used.

암호해독을 위한 양자 계산 알고리즘의 최근 연구동향 (Research Trends in Quantum Computational Algorithms for Cryptanalysis)

  • 배은옥;김정산;이수준
    • 한국광학회지
    • /
    • 제29권2호
    • /
    • pp.53-57
    • /
    • 2018
  • 본 논문에서는 고전 계산 알고리즘에 비해 지수적인 계산 속도의 향상을 주는 양자 계산 알고리즘들을 중점적으로 소개하고, 기존 암호체계에 영향을 줄 수 있는 양자 계산 알고리즘 연구에 대한 최근 연구 성과들을 정리하며 최종적으로 이 결과들을 보다 발전적으로 향상시킬 수 있는 연구 방향을 제시한다.

CHEYSHEFF-HALLEY-LIKE METHODS IN BANACH SPACES

  • Argyros, Ioannis-K.
    • Journal of applied mathematics & informatics
    • /
    • 제4권1호
    • /
    • pp.83-108
    • /
    • 1997
  • Chebysheff-Halley methods are probably the best known cubically convergent iterative procedures for solving nonlinear equa-tions. These methods however require an evaluation of the second Frechet-derivative at each step which means a number of function eval-uations proportional to the cube of the dimension of the space. To re-duce the computational cost we replace the second Frechet derivative with a fixed bounded bilinear operator. Using the majorant method and Newton-Kantorovich type hypotheses we provide sufficient condi-tions for the convergence of our method to a locally unique solution of a nonlinear equation in Banach space. Our method is shown to be faster than Newton's method under the same computational cost. Finally we apply our results to solve nonlinear integral equations appearing in radiative transfer in connection with the problem of determination of the angular distribution of the radiant-flux emerging from a plane radiation field.

THE MOORE-PENROSE INVERSE OF THE PARTITIONED MARIX AND SIMULATION STUDY

  • Sunwoo, Ha-Sik
    • Journal of applied mathematics & informatics
    • /
    • 제5권3호
    • /
    • pp.849-857
    • /
    • 1998
  • In this paper we have a concern on the Moore-Penrose inverse of two kinds of partitioned matrices of the form [V X] and [{{{{ {V atop {X} {{{{ {X atop { 0} }}] where V is symmetric. The Moore-Penrose inverse of the partitioned matrices can be reduced to be simpler forms according to some algebraic conditions. Firstly we investigate the representations of the Moore-Penrose inverses of the partitioned matrices under four al-gebraic conditions. Each condition reduces the Moore-Penrose inverses of the partitioned matrices under four al-gebraic conditions. Each condition reduces the Morre-Penrose inverse into some simpler form. Also equivalant conditions will be considered. Finally we will perform a simulation study to investigate which con-dition is the most important in the sense that which condition occurs the most frequently in the real situation. The simluation study will show us a particular condition occurs the most likely tha other conditions. This fact enables us to obtain the Morre-Penrose inverse with less computational efforts and computational storage.

Binary Sequence Family for Chaotic Compressed Sensing

  • Lu, Cunbo;Chen, Wengu;Xu, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4645-4664
    • /
    • 2019
  • It is significant to construct deterministic measurement matrices with easy hardware implementation, good sensing performance and good cryptographic property for practical compressed sensing (CS) applications. In this paper, a deterministic construction method of bipolar chaotic measurement matrices is presented based on binary sequence family (BSF) and Chebyshev chaotic sequence. The column vectors of these matrices are the sequences of BSF, where 1 is substituted with -1 and 0 is with 1. The proposed matrices, which exploit the pseudo-randomness of Chebyshev sequence, are sensitive to the initial state. The performance of proposed matrices is analyzed from the perspective of coherence. Theoretical analysis and simulation experiments show that the proposed matrices have limited influence on the recovery accuracy in different initial states and they outperform their Gaussian and Bernoulli counterparts in recovery accuracy. The proposed matrices can make the hardware implement easy by means of linear feedback shift register (LFSR) structures and numeric converter, which is conducive to practical CS.

BLOCK ITERATIVE METHODS FOR FUZZY LINEAR SYSTEMS

  • Wang, Ke;Zheng, Bing
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.119-136
    • /
    • 2007
  • Block Jacobi and Gauss-Seidel iterative methods are studied for solving $n{\times}n$ fuzzy linear systems. A new splitting method is considered as well. These methods are accompanied with some convergence theorems. Numerical examples are presented to illustrate the theory.

SOME RESULTS ON BINDING NUMBER AND FRACTIONAL PERFECT MATCHING

  • Zhu, Yan;Liu, Guizhen
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.339-344
    • /
    • 2007
  • The relationships between binding number and fractional edge (vertex)-deletability or fractional k-extendability of graphs are studied. Furthermore, we show that the result about fractional vertex-deletability are best possible.

OSCILLATION AND ASYMPTOTIC BEHAVIOR FOR DELAY DIFFERENTIAL EQUATIONS

  • Choi, Sung-Kyu;Koo, Nam-Jip;Ryu, Hyun-Sook
    • Journal of applied mathematics & informatics
    • /
    • 제7권2호
    • /
    • pp.641-652
    • /
    • 2000
  • In this paper we will survey the recent results about oscillation and asymptotic behavior for the linear differential equation with a single delay x'9t)+p(t)x(t-r)=0, $t\geqt_1$.

T-FUZZY CIRCLED SUBALGEBRAS OF BCK-ALGEBRAS

  • Kim, Kyung-Ho;Jun, Young-Bae
    • Journal of applied mathematics & informatics
    • /
    • 제7권2호
    • /
    • pp.685-692
    • /
    • 2000
  • We introduce the notion of T-fuzzy circled subalgebras, and obtain some related results.

SOME RESULTS ON FUZZY BANACH SPACES

  • SAADATI R.;VAEZPOUR S. M.
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.475-484
    • /
    • 2005
  • The main aim of this paper is to consider the fuzzy norm, define the fuzzy Banach spaces, its quotients and prove some theoremes and in particular Open mapping and Closed graph theoremes on these spaces.