• Structural Engineering and Mechanics
• /
• v.43 no.3
• /
• pp.273-285
• /
• 2012

Structural reanalysis is frequently used to reduce the computational cost during the process of design or optimization. The supports can be regarded as the design variables in various types of structural optimization problems. The location, number, and type of supports may be varied in order to yield a more effective design. The paper is focused on structural static reanalysis problem with added supports where some node displacements along axes of the global coordinate system are specified. A new approach is proposed and exact solutions can be provided by the approach. Thus, it belongs to the direct reanalysis methods. The information from the initial analysis has been fully exploited. Numerical examples show that the exact results can be achieved and the computational time can be significantly reduced by the proposed method.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.1-17
• /
• 2004

The famous Newton-Kantorovich hypothesis has been used for a long time as a sufficient condition for the convergence of Newton method to a solution of an equation in connection with the Lipschitz continuity of the Frechet-derivative of the operator involved. Using Lipschitz and center-Lipschitz conditions we show that the Newton-Kantorovich hypothesis is weakened. The error bounds obtained under our semilocal convergence result are finer and the information on the location of the solution more precise than the corresponding ones given by the dominating Newton-Kantorovich theorem, and under the same hypotheses/computational cost, since the evaluation of the Lipschitz also requires the evaluation of the center-Lipschitz constant. In the case of local convergence we obtain a larger convergence radius than before. This observation is important in computational mathematics and can be used in connection to projection methods and in the construction of optimum mesh independence refinement strategies.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.445-460
• /
• 2022

In this paper, we studied on 𝛽-fuzzy filters of Stone almost distributive lattices. An isomorphism between the lattice of 𝛽-fuzzy filters of a Stone ADL A onto the lattice of fuzzy ideals of the set of all boosters of A is established. The fact that any 𝛽-fuzzy filter of A is an e-fuzzy filter of A is proved. We discuss on some properties of prime 𝛽-fuzzy filters and some topological concepts on the collection of prime 𝛽-fuzzy filters of a Stone ADL. Further we show that the collection 𝓣 = {X^𝛽(λ) : λ is a fuzzy ideal of A} is a topology on 𝓕Spec_𝛽(A) where X^𝛽(λ) = {𝜇 ∈ 𝓕Spec_𝛽(A) : λ ⊈ 𝜇}.

• Nuclear Engineering and Technology
• /
• v.55 no.2
• /
• pp.756-768
• /
• 2023

Neutron transport calculations are extremely challenging due to the high computational cost of large and complex problems. A multilevel octree grid algorithm (MLTG) of discrete ordinates method was developed to improve the modeling accuracy and simulation efficiency on 3-D Cartesian grids. The Balakovo-3 VVER-1000 neutron dosimetry benchmark is calculated to verify and validate this numerical technique. A simplified S₂ synthetic acceleration is used in the MLTG calculation method to improve the convergence of the source iterations. For the triangularly arranged fuel pins, we adopt a source projection algorithm to generate pin-by-pin source distributions of hexagonal assemblies. MLTG provides accurate geometric modeling and flexible fixed source description at a lower cost than traditional Cartesian grids. The total number of meshes is reduced to 1.9 million from the initial 9.5 million for the Balakovo-3 model. The numerical comparisons show that the MLTG results are in satisfactory agreement with the conventional S_N method and experimental data, within the root-mean-square errors of about 4% and 10%, respectively. Compared to uniform fine meshing, approximately 70% of the computational cost can be saved using the MLTG algorithm for the Balakovo-3 computational model.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.293-304
• /
• 2007

In this paper, we present a Krylov subspace based projection method for reduced-order modeling of large scale bilinear multi-input multi-output (MIMO) systems. The reduced-order bilinear system is constructed in such a way that it can match a desired number of moments of multi-variable transfer functions corresponding to the kernels of Volterra series representation of the original system. Numerical examples report the effectiveness of this method.

• Journal for History of Mathematics
• /
• v.16 no.3
• /
• pp.69-76
• /
• 2003

In this article, We explained the historical origin and significance of decimal fraction, and draw some educational implications based on that. In general, it is accepted that decimal fraction was first invented by a Belgian man, Simon Stevin(1548-1620). In short, the idea of infinite decimal fraction refers to the ratio of the whole quantity to a unit. Stevin's idea of decimal fraction is significant for the history of mathematics in that it broke through the limit of Greek mathematics which separated discrete quantity from continuous quantity, and number from magnitude, and it became the origin of modern number concept. H. Eves chose the invention of decimal fraction as one of the "Great moments of mathematics."The method of teaching decimal fraction in our school mathematics tends to emphasize the computational aspect of decimal fraction too much and ignore the conceptual aspect of it. In teaching decimal fraction, like all the other areas of mathematics, the conceptual aspect should be emphasized as much as the computational aspect.al aspect.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.4
• /
• pp.295-306
• /
• 2013

In this paper, we consider the adaptive multigrid method for solving the Black-Scholes equation to improve the efficiency of the option pricing. Adaptive meshing is generally regarded as an indispensable tool because of reduction of the computational costs. The Black-Scholes equation is discretized using a Crank-Nicolson scheme on block-structured adaptively refined rectangular meshes. And the resulting discrete equations are solved by a fast solver such as a multigrid method. Numerical simulations are performed to confirm the efficiency of the adaptive multigrid technique. In particular, through the comparison of computational results on adaptively refined mesh and uniform mesh, we show that adaptively refined mesh solver is superior to a standard method.

• Journal for History of Mathematics
• /
• v.31 no.5
• /
• pp.223-234
• /
• 2018

Ancient Chinese mathematics education has a long history of more than 3,000 years, and many excellent mathematicians have been fostered. However, the systematic framework for teaching mathematics should be considered to be started from the Zhou Dynasty. In this paper, we examined the educational goals, trainees(learners), providers(educators), and contents in mathematics education in the ancient Chinese Zhou Han Dynasty, Tang Dynasty and Song Dynasty.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.5.2-5
• /
• 2003

In this paper, we are to find the condition that a two-dimensional Finsler space with Matsumoto metric satisfying L(${\alpha}$,${\beta}$)=${\alpha}$$^2$/(${\alpha}$-${\beta}$) be a Landsberg space and the differential equations of geodesics.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.8.1-8
• /
• 2003

We prove that m-step walks and self-avoiding walks on the 2D triangle lattices can be uniquely characterized (canonized) with no more than m Euclidian distances. We also demonstrate that these canonical distances can be obtained with O(n) physical measurements.