• 한국수학사학회지
• /
• 제26권4호
• /
• pp.219-232
• /
• 2013

Japanese mathematics, namely Wasan, was well-developed before the Meiji period. Seki Takakazu (1642?-1708) is the most famous one. Taking Seki's interpolation as an example, the similarities and differences are made between Wasan and Chinese mathematics. According to investigating the sources and attitudes to this problem which both Japanese and Chinese mathematicians dealt with, the paper tries to show how and why Japanese mathematicians accepted Chinese tradition and beyond. Professor Wu Wentsun says that, in the whole history of mathematics, there exist two different major trends which occupy the main stream alternately. The axiomatic deductive system of logic is the one which we are familiar with. Another, he believes, goes to the mechanical algorithm system of program. The latter featured traditional Chinese mathematics, as well as Wasan. As a typical sample of the succession of Chinese tradition, Wasan will help people to understand the real meaning of the mechanical algorithm system of program deeper.

• 대한수학회보
• /
• 제39권3호
• /
• pp.423-430
• /
• 2002

Given operators X and Y acting on a Hilbert space H, an interpolating operator is a bounded operator A such that AX = Y. An interpolating operator for n-operators satisfies the equation $AX_{}i$ = $Y_{i}$ for i/ = 1,2,…, n. In this article, we obtained the following : Let X ＝ ($x_{i\sigma(i)}$ and Y ＝ ($y_{ij}$ be operators in B(H) such that $X_{i\sigma(i)}\neq\;0$ for all i. Then the following statements are equivalent. (1) There exists an operator A in Alg L such that AX = Y, every E in L reduces A and A is a self-adjoint operator. (2) sup ${\frac{\parallel{\sum^n}_{i=1}E_iYf_i\parallel}{\parallel{\sum^n}_{i=1}E_iXf_i\parallel}n\;\epsilon\;N,E_i\;\epsilon\;L and f_i\;\epsilon\;H}$ < $\infty$ and $x_{i,\sigma(i)}y_{i,\sigma(i)}$ is real for all i = 1,2, ....

• 대한전기학회논문지:전력기술부문A
• /
• 제48권6호
• /
• pp.753-759
• /
• 1999

BPF(block pulse function) has been used widely in the system analysis and controller design. The integral operational matrix of BPF converts the system represented in the form of the differential equation into the algebraic problem. Therefore, it is important to reduce the error caused by the integral operational matrix. In this paper, a new integral operational matrix is derived from the approximating function using Lagrange's interpolation formula. Comparing the proposed integral operational matrix with another, the result by proposed matrix is closer to the real value than that by the conventional matrix. The usefulness of th proposed method is also verified by numerical examples.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2006년도 정기 학술대회 논문집
• /
• pp.849-856
• /
• 2006

This paper is to examine the applicability of ordinary Kriging interpolation(OK) to the p-adaptivity of the finite element analysis that is based on variogram. In the p-refinement, the analytical domain has to be refined automatically to obtain an acceptable level of accuracy by increasing the p-level non-uniformly or selectively. In case of non-uniform p-distribution, the continuity between elements with different polynomial orders is achieved by assigning zero higher-order derivatives associated with the edge in common with the lower-order derivatives. It is demonstrated that the validity of the proposed approach by analyzing results for stress singularity problem.

• 대한수학회보
• /
• 제29권2호
• /
• pp.193-200
• /
• 1992

This paper uses a piecewise ratonal cubic interpolant to solve the problem of shape preserving interpolation for plane curves; scalar curves are also considered as a special case. The results derived here are actually the extensions of the convexity preserving results of Delbourgo and Gregory [Delbourgo and Gregory'85] who developed a $C^{1}$ shape preserving interpolation scheme for scalar curves using the same piecewise rational function. They derived the ocnstraints, on the shape parameters occuring in the rational function under discussion, to make the interpolant preserve the convex shape of the data. This paper begins with some preliminaries about the rational cubic interpolant. The constraints consistent with convex data, are derived in Sections 3. These constraints are dependent on the tangent vectors. The description of the tangent vectors, which are consistent and dependent on the given data, is made in Section 4. the convexity preserving results are explained with examples in Section 5.

• Structural Engineering and Mechanics
• /
• 제15권5호
• /
• pp.535-550
• /
• 2003

In this paper, a boundary-type meshfree method, the boundary radial point interpolation method (BRPIM), is presented for solving boundary value problems of two-dimensional solid mechanics. In the BRPIM, the boundary of a problem domain is represented by a set of properly scattered nodes. A technique is proposed to construct shape functions using radial functions as basis functions. The shape functions so formulated are proven to possess both delta function property and partitions of unity property. Boundary conditions can be easily implemented as in the conventional Boundary Element Method (BEM). The Boundary Integral Equation (BIE) for 2-D elastostatics is discretized using the radial basis point interpolation. Some important parameters on the performance of the BRPIM are investigated thoroughly. Validity and efficiency of the present BRPIM are demonstrated through a number of numerical examples.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.495-500
• /
• 2007

A Meshfree is a method used to establish algebraic equations of system for the whole problem domain without the use of a predefined mesh for the domain discretization. A point interpolation method is based on combining radial and polynomial basis functions. Involvement of radial basis functions overcomes possible singularity. Furthermore, the interpolation function passes through all scattered points in an influence domain and thus shape functions are of delta function property. This makes the implementation of essential boundary conditions much easier than the meshfree methods based on the moving least-squares approximation. This study aims to investigate a stress analysis of structural element between a meshfree method and the finite element method. Examples on cantilever type plate and stress concentration problems show that the accuracy and convergence rate of the meshfree methods are high.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.73-86
• /
• 2007

The general stereographic projection which maps a point on a sphere with arbitrary radius to a point on a plane stereographically and its inverse projection have the pythagorean-hodograph (PH) preserving property in the sense that they map a PH curve to another PH curve. Upon this fact, for given spatial $C^1$ Hermite data, we construct a spatial PH curve on a sphere that is a $C^1$ Hermite interpolant of the given data as follows: First, we solve $C^1$ Hermite interpolation problem for the stereographically projected planar data of the given data in $\mathbb{R}^3$ with planar PH curves expressed in the complex representation. Second, we construct spherical PH curves which are interpolants for the given data in $\mathbb{R}^3$ using the inverse general stereographic projection.

• 한국멀티미디어학회논문지
• /
• 제20권12호
• /
• pp.1865-1873
• /
• 2017

The feature-based visual SLAM requires 3D positions for the extracted feature points to perform 3D-2D motion estimation. LiDAR can provide reliable and accurate 3D position information with low computational burden, while stereo camera has the problem of the impossibility of stereo matching in simple texture image region, the inaccuracy in depth value due to error contained in intrinsic and extrinsic camera parameter, and the limited number of depth value restricted by permissible stereo disparity. However, the sparsity of LiDAR data may increase the inaccuracy of motion estimation and can even lead to the result of motion estimation failure. Therefore, in this paper, we propose three interpolation methods which can be applied to interpolate sparse LiDAR data. Simulation results obtained by applying these three methods to a visual odometry algorithm demonstrates that the selective bilinear interpolation shows better performance in the view point of computation speed and accuracy.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.474-479
• /
• 2003

This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.