• Title, Summary, Keyword: interpolation problem

Search Result 359, Processing Time 0.046 seconds

A NON-RECURSIVE APPROACH TO NEVANLINNA-PICK INTERPOLATION PROBLEM

  • Kim, Jeongook
    • Honam Mathematical Journal
    • /
    • v.41 no.4
    • /
    • pp.823-835
    • /
    • 2019
  • A solution for Nevanlinna-Pick interpolation problem with low complexity is constructed via non-recursive method. More precisely, a stable rational function satifying the given interpolation data in the complex right half plane is found by solving a homogeneous interpolation problem related to a minial interpolation problem for the given data in the right half plane together with its mirror-image data.

Problem-dependent cubic linked interpolation for Mindlin plate four-node quadrilateral finite elements

  • Ribaric, Dragan
    • Structural Engineering and Mechanics
    • /
    • v.59 no.6
    • /
    • pp.1071-1094
    • /
    • 2016
  • We employ the so-called problem-dependent linked interpolation concept to develop two cubic 4-node quadrilateral plate finite elements with 12 external degrees of freedom that pass the constant bending patch test for arbitrary node positions of which the second element has five additional internal degrees of freedom to get polynomial completeness of the cubic form. The new elements are compared to the existing linked-interpolation quadratic and nine-node cubic elements presented by the author earlier and to the other elements from literature that use the cubic linked interpolation by testing them on several benchmark examples.

Feedback Control for Multidimensional Linear Systems and Interpolation Problems for Multivariable Holomorphic Functions

  • Malakorn, T.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • 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.

  • PDF

NORMAL INTERPOLATION PROBLEMS IN ALGL

  • Jo, Young-Soo
    • Communications of the Korean Mathematical Society
    • /
    • v.19 no.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?

Efficient Modifications of Cubic Convolution Interpolation Based on Even-Odd Decomposition (짝수 홀수 분해법에 기초한 CCI의 효율적인 변형)

  • Cho, Hyun-Ji;Yoo, Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.5
    • /
    • pp.690-695
    • /
    • 2014
  • This paper presents a modified CCI image interpolation method based on the even-odd decomposition (EOD). The CCI method is a well-known technique to interpolate images. Although the method provides better image quality than the linear interpolation, its complexity still is a problem. To remedy the problem, this paper introduces analysis on the EOD decomposition of CCI and then proposes a reduced CCI interpolation in terms of complexity, providing better image quality in terms of PSNR. To evaluate the proposed method, we conduct experiments and complexity comparison. The results indicate that our method do not only outperforms the existing methods by up to 43% in terms of MSE but also requires low-complexity with 37% less computing time than the CCI method.

Real-Time Continuous-Scale Image Interpolation with Directional Smoothing

  • Yoo, Yoonjong;Shin, Jeongho;Paik, Joonki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.3
    • /
    • pp.128-134
    • /
    • 2014
  • A real-time, continuous-scale image interpolation method is proposed based on a bilinear interpolation with directionally adaptive low-pass filtering. The proposed algorithm was optimized for hardware implementation. The ordinary bi-linear interpolation method has blocking artifacts. The proposed algorithm solves this problem using directionally adaptive low-pass filtering. The algorithm can also solve the severe blurring problem by selectively choosing low-pass filter coefficients. Therefore, the proposed interpolation algorithm can realize a high-quality image scaler for a range of imaging systems, such as digital cameras, CCTV and digital flat panel displays.

A Study on the Comparison for Shape Interpolation of Magnified Image (확대 영상의 보간에 관한 비교 연구)

  • Lee, Y.J.;Lee, H.W.;Lee, H.A.
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.3165-3168
    • /
    • 1999
  • When a input image is extensively magnified on the computer system, it is almost impossible to replicate the original shape because of mismatched coordinates system. In order to resolve the problem, the shape of the magnified image has been reconfigured using the bilinear interpolation method, low pass special filtering interpolation method and B-spline interpolation method. Ferguson curve interpolation method based on the CAD/CAM curve interpolation algorithm.

  • PDF

Interpolation Algorithm Comparison for Contour of Magnified Image (확대 영상의 윤각선 보간 알고리즘 비교)

  • 이용중;김기대;조순조
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • /
    • pp.381-386
    • /
    • 2001
  • When a input image is extensively magnified on the computer system, it is almost impossible to replicate the original shape because of mismatched coordinates system. In order to resolve the problem, the shape of the magnified image has been reconfigured using the bilinear interpolation method, low pass special filtering interpolation method and B-spline interpolation method, Ferguson curve interpolation method based on the CAD/CAM curve interpolation algorithm. The computer simulation main result was that. Nearest neighbor interpolation method is simple in making the interpolation program but it is not capable to distinguish the original shape. Bilinear interpolation method has the merit to make the magnified shape smooth and soft but calculation time is longer than the other method. Low pass spatial filtering method and B-spline interpolation method has an effect to immerge the intense of the magnified shape but it is also difficult to distinguish the original shape. Ferguson curve interpolation method has sharping shape than B-spline interpolation method.

  • PDF

Strong Stabilization Controller Design Using Advanced Unit Interpolation algorithm (개선된 Unit 보강 알고리즘을 이용한 강안정화 제어기 설계)

  • 윤한오;신창훈;박홍배
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.8
    • /
    • pp.31-38
    • /
    • 1994
  • This paper presents an improved interpolation algorithm which enables to find a unit function in $H^{\infty}$. From the proposed algorithm the interpolation problem on the infinity point with multiplicity can be solved. This is based on the DPL algorithm the acquired unit function has low order and can be directly applied to strong/simultaneous stabilization problem in control systems. Finally, we verify that poles of transfer function of closed-loop system exist in stable region while investgating internal stability.

  • PDF