• Journal of applied mathematics & informatics
• /
• 제7권1호
• /
• pp.257-267
• /
• 2000

In this article, we investigate positive interpolation problems in tridiagonal algebra which was introduded by F. Gilfeather and D. Larson.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2005년도 춘계학술대회 논문집
• /
• pp.115-124
• /
• 2005

This paper analyzes the problems that occurred in the magnification process for a fine input image and investigates a method to improve the problems. This paper applies a curve interpolation algorithm in CAD/CAM for the same test images with the existing image algorithm in order to improve the problems. As a result. the nearest neighbor interpolation. which is the most frequently applied algorithm for the existing image interpolation algorithm. shows that the identification of a magnified image is not possible. Therefore. this study examines an interpolation of gray-level data by applying a low-pass spatial filter and verifies that a bilinear interpolation presents a lack of property that accentuates the boundary of the image where the image is largely changed. The periodic B-spline interpolation algorithm used for curve interpolation in CAD/CAM can remove the blurring but shows a problem of obscuration, and the Ferguson's curve interpolation algorithm shows a more sharpened image than that of the periodic B-spline algorithm. For the future study, hereafter. this study will develop an interpolation algorithm that has an excel lent improvement for the boundary of the image and continuous and flexible property by using the NURBS. Ferguson's complex surface. and Bezier surface used in CAD/CAM engineering based on. the results of this study.

• 대한수학회보
• /
• 제49권1호
• /
• pp.175-195
• /
• 2012

Representing planar Pythagorean hodograph (PH) curves by the complex roots of their hodographs, we standardize Farouki's double cubic method to become the undetermined junction point (UJP) method, and then prove the generic existence of solutions for general $C^1$ Hermite interpolation problems. We also extend the UJP method to solve $C^2$ Hermite interpolation problems with multiple PH cubics, and also prove the generic existence of solutions which consist of triple PH cubics with $C^1$ junction points. Further generalizing the UJP method, we go on to solve $C^2$ Hermite interpolation problems using two PH quintics with a $C^1$ junction point, and we also show the possibility of applying the modi e UJP method to $G^2[C^1]$ Hermite interpolation.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1847-1852
• /
• 2004

This article provides the connection between feedback stabilization and interpolation conditions for n-D linear systems (n > 1). In addition to internal stability, if one demands performance as a design goal, then there results an n-D matrix Nevanlinna-Pick interpolation problem. Application of recent work on Nevanlinna-Pick interpolation on the polydisk yields a solution of the problem for the 2-D case. The same analysis applies in the n-D case (n > 2), but leads to solutions which are contractive in a norm (the "Schur-Agler norm") somewhat stronger than the $H^{\infty}$ norm. This is an analogous version of the connection between the standard $H^{\infty}$ control problem and an interpolation problem of Nevanlinna-Pick type in the classical 1-D linear time-invariant systems.

• 대한수학회보
• /
• 제41권2호
• /
• pp.319-326
• /
• 2004

In this article, we investigate invertible interpolation problems in Alg(equation omitted) : Let(equation omitted) be a subspace lattice on a Hilbert space H and let X and Y be operators acting on H. When does there exist an invertible operator A in Alg(equation omitted) such that AX = Y?

• 대한수학회논문집
• /
• 제19권4호
• /
• pp.691-700
• /
• 2004

Let X and Y be operators acting on a Hilbert space and let (equation omitted) be a subspace lattice of orthogonal projections on the space containing 0 and I. We investigate normal interpolation problems in Alg(equation omitted): Given operators X and Y acting on a Hilbert space, when does there exist a normal operator A in Alg(equation omitted) such that AX = Y?

• 대한기계학회논문집
• /
• 제19권2호
• /
• pp.433-442
• /
• 1995

For the line search of a multi-variable optimization, an efficient algorithm is presented. The algorithm sequentially employs several polynomial approximations such as 2-point quadratic interpolation, 3-point cubic interpolation/extrapolation and 4-point cubic interpolation/extrapolation. The order of polynomial function is automatically increased for improving the accuracy of approximation. The method of approximation (interpolation or extrapolation) is automatically switched by checking the slope information of the sample points. Also, for selecting the initial step length along the descent vector, a new approach is presented. The performance of the proposed method is examined by solving typical test problems such as mathematical problems, mechanical design problems and dynamic response problems.

• 호남수학학술지
• /
• 제27권1호
• /
• pp.83-100
• /
• 2005

• 대한수학회보
• /
• 제40권2호
• /
• pp.207-213
• /
• 2003

Given vectors x and y in a Hilbert space, an interpolating operator is a bounded operator T such that Tx=y. An interpolating operator for n-vectors satisfies the equation Ax$_{i}$=y$_{i}$. for i=1,2, …, n. In this article, we investigate unitary interpolation problems in CSL-Algebra AlgL : Let L be a commutative subspace lattice on a Hilbert space H. Let x and y be vectors in H. When does there exist a unitary operator A in AlgL such that Ax=y?

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.359-365
• /
• 2003

Given vectors x and y in a Hilbert space, an interpolating operator is a bounded operator T such that Tx = y. In this article, we investigate invertible interpolation problems in CSL-Algebra AlgL : Let L be a commutative subspace lattice on a Hilbert space H and x and y be vectors in H. When does there exist an invertible operator A in AlgL suth that An = ㅛ?