• The Mathematical Education
• /
• v.39 no.1
• /
• pp.49-58
• /
• 2000

The purpose of this study is to investigate how to teach algorithms in mathematics class. Until recently, traditional school mathematics was primarily treated as drill and practice or memorizing of algorithmic skills. In an attempt to shift the focus and energies of mathematics teachers toward problem solving, conceptual understanding and the development of number sense, the recent reform recommendations do-emphasize algorithmic skills, in particular, paper-pencil algorithms. But the development of algorithmic thinking provides the foundation for student's mathematical power and confidence in their ability to do mathematics. Hence, for learning algorithms meaningfully, they should be taught with problem solving and conceptual understanding.

• Research in Mathematical Education
• /
• v.9 no.4 s.24
• /
• pp.341-350
• /
• 2005

In this increasingly technological world, the creativity development has been highlighted much in many countries. In this paper, two mathematical activities with Chinese characteristics are presented to illustrate how to integrate algorithmic teaching into mathematical activities to develop students' creativity. Case studies show that the learning of algorithm can be transferred into creative learning when students construct their own algorithms in Logo environment rather than being indoctrinated the existing algorithms. Creativity development in different stages of mathematical activities and creativity development in programming are also discussed.

• Journal of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.83-97
• /
• 2009

Two new iterative algorithms are provided to find zeros of accretive operators in a Banach space E with a uniformly $G\hat{a}teaux$ differentiable norm. Strong convergence for two iterations is proved and as applications, the viscosity approximation results are obtained also.

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.363-370
• /
• 1999

A new and simple estimate using a convex function for convergence factors of Schwarz algorithms orthogonal spline collocation method is presented. The estimated convergence factors in this context depend only on a way to split a given domain.

• Journal of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.115-139
• /
• 1995

Our purpose in this paper is to prove a new version of the nonlinear Chernoff theorem and to discuss the equivalence between resolvent consistency and converge nce for nonlinear algorithms acting on different Banach spaces. Such results are useful in the numerical treatment of partial differential equations via difference schemes.

• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.797-819
• /
• 2015

A trapdoor discrete logarithm group is a cryptographic primitive with many applications, and an algorithm that allows discrete logarithm problems to be solved faster using a pre-computed table increases the practicality of using this primitive. Currently, the distinguished point method and one extension to this algorithm are the only pre-computation aided discrete logarithm problem solving algorithms appearing in the related literature. This work investigates the possibility of adopting other pre-computation matrix structures that were originally designed for used with cryptanalytic time memory tradeoff algorithms to work as pre-computation aided discrete logarithm problem solving algorithms. We find that the classical Hellman matrix structure leads to an algorithm that has performance advantages over the two existing algorithms.

• Journal of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.1031-1047
• /
• 2017

In this paper, we introduce two general iterative algorithms (one implicit algorithm and other explicit algorithm) for nonexpansive mappings in a reflexive Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm. Strong convergence theorems for the sequences generated by the proposed algorithms are established.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.1019-1044
• /
• 2022

In this paper, we propose new algorithms for solving equilibrium and multivalued variational inequality problems in a real Hilbert space. The first algorithm for equilibrium problems uses only one approximate projection at each iteration to generate an iteration sequence converging strongly to a solution of the problem underlining the bifunction is pseudomonotone. On the basis of the proposed algorithm for the equilibrium problems, we introduce a new algorithm for solving multivalued variational inequality problems. Some fundamental experiments are given to illustrate our algorithms as well as to compare them with other algorithms.

• Research in Mathematical Education
• /
• v.13 no.1
• /
• pp.13-22
• /
• 2009

School children in Brunei Darussalam, as elsewhere, learn how to apply a lot of algorithms and formulas in mathematics. These include methods of finding the lowest common multiple and highest common multiple of numbers and methods of factorizing quadratics. Investigations and experience have shown that both able and less able students learn to do these mechanically and unimaginatively and in a way that is reliable when answering examination questions. Most of them do not, however, learn these algorithms and methods so as to develop a deeper insight of what they learn and thereby perform even more effectively in examinations. Yet it is possible to teach these and other methods for understanding in ways that are enjoyable and enable students to use them effectively and with flair.

• Journal of the Chungcheong Mathematical Society
• /
• v.8 no.1
• /
• pp.55-69
• /
• 1995

This paper proposes two variants of BCG-like method for solving nonsymmetric linear sytems. It is shown that these new algorithms converge faster and more smoothly than the existing BCG and BiCGSTAB algorithms for problems tested in this paper.