• 한국수학교육학회지시리즈A:수학교육
• /
• 제4권1호
• /
• pp.1-15
• /
• 1966

In accordance with the tendency of Modern Mathematics laying emphasis on Mathematical structure, that is, on axioms, it is necessary for students to be interested in structure of Geometry on Mathematics Education. In fact, it is of importance not only to obtain new ideas but also to forget old ones in the development of Mathematics. Most students do not understand the Mathematical significance of axioms, and do not know what Mathemetical truth is. Now Non-Euclidean Geometry offers opportunity to understand the essence of Mathematics better, and is no less effective than Euclidean Geometry in training student in logical inference. This thesis is a study with regard to what should be taught and how student should be guided at High school Mathematics. Chiefly Hyperbolic Geometry is discussed in connection with Abosolute Geometry. As Non-Euclidean Geometry has not appeared in our curriculum, some experiments are required before putting it into actual curriculum to find out how much students understand and how much pedagogically useful it can be. This is only a. presentation of a tentative plan, which needs to be criticized by many teachers.

• 호남수학학술지
• /
• 제34권3호
• /
• pp.341-349
• /
• 2012

In this paper, we discuss a constructive approximation by Gaussian neural networks. We show that it is possible to construct Gaussian neural networks with integer weights that approximate arbitrarily well for functions in $C_c(\mathbb{R}^s)$. We demonstrate numerical experiments to support our theoretical results.

• 호남수학학술지
• /
• 제32권3호
• /
• pp.399-412
• /
• 2010

In this paper, we consider a preconditioned accelerated overrelaxation (PAOR) method to solve systems of linear equations. We show the convergence of the PAOR method. We also give com-parison results when the coefficient matrix is an L- or H-matrix. Finally, we provide some numerical experiments to show efficiency of PAOR method.

• 대한수학회지
• /
• 제53권3호
• /
• pp.691-707
• /
• 2016

In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR methods with scaled preconditioners by comparing their performance with the parameterized Uzawa method with optimal parameters.

• 대한수학회보
• /
• 제47권4호
• /
• pp.727-741
• /
• 2010

In this paper, we study the convergence of relaxed two-stage multisplitting method using H-compatible splittings or SOR multisplitting as inner splittings and an outer splitting for solving a linear system whose coefficient matrix is an H-matrix. We also provide numerical experiments for the convergence of the relaxed two-stage multisplitting method.

• 대한수학회논문집
• /
• 제15권1호
• /
• pp.143-153
• /
• 2000

In [8], Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we propose the block diagonal preconditioners. The preconditioned conjugate residual method is robust in that the convergence is uniform as the parameter, v, goes to $\sfrac{1}{2}$. Computational experiments are included.

• 대한수학회보
• /
• 제52권5호
• /
• pp.1669-1681
• /
• 2015

In this paper, we provide semi-convergence results of the parameterized inexact Uzawa method with singular preconditioners for solving singular saddle point problems. We also provide numerical experiments to examine the effectiveness of the parameterized inexact Uzawa method with singular preconditioners.

• 대한수학회보
• /
• 제51권1호
• /
• pp.267-285
• /
• 2014

An upstream scheme based on the pseudostress-velocity mixed formulation is studied to solve convection-dominated Oseen equations. Lagrange multipliers are introduced to treat the trace-free constraint and the lowest order Raviart-Thomas finite element space on rectangular mesh is used. Error analysis for several quantities of interest is given. Particularly, first-order convergence in $L^2$ norm for the velocity is proved. Finally, numerical experiments for various cases are presented to show the efficiency of this method.

• 대한수학회보
• /
• 제48권4호
• /
• pp.873-896
• /
• 2011

The semi-discrete central scheme and central upwind scheme use Runge-Kutta (RK) time discretization. We do the Lax-Wendroff (LW) type time discretization for both schemes. We perform numerical experiments for various problems including two dimensional Riemann problems for Burgers' equation and Euler equations. The results show that the LW time discretization is more efficient in CPU time than the RK time discretization while maintaining the same order of accuracy.

• 충청수학회지
• /
• 제6권1호
• /
• pp.25-43
• /
• 1993

This paper introduces a numerical method approximating the minimum norm solution to the first kind integral equation Kf = g with its kernel satisfying a certain property, where g belongs to the range space of K. Most of the existing expansion methods suffer from choosing a set of basis functions, whereas this method automatically provides an optimal set of basis functions approximating the minimum norm solution of Kf = g. Perturbation results and numerical experiments are also provided to analyze this method.