• 호남수학학술지
• /
• 제39권4호
• /
• pp.617-635
• /
• 2017

By applying a classical approach for scalar rational interpolation problem, certain type of minimal interpolation problem for rational matrix functions is solved. It is shown that an appropriately defined matrix plays a key role in solving the minimal problem.

• Korea-Australia Rheology Journal
• /
• 제15권3호
• /
• pp.131-150
• /
• 2003

A new numerical algorithm of finite element methods is presented to solve high Deborah number flow problems with geometric singularities. The steady inertialess planar 4 : 1 contraction flow is chosen for its test. As a viscoelastic constitutive equation, we have applied the globally stable (dissipative and Hadamard stable) Leonov model that can also properly accommodate important nonlinear viscoelastic phenomena. The streamline upwinding method with discrete elastic-viscous stress splitting is incorporated. New interpolation functions classified as rational interpolation, an alternative formalism to enhance numerical convergence at high Deborah number, are implemented not for the whole set of finite elements but for a few elements attached to the entrance comer, where stress singularity seems to exist. The rational interpolation scheme contains one arbitrary parameter b that controls the singular behavior of the rational functions, and its value is specified to yield the best stabilization effect. The new interpolation method raises the limit of Deborah number by 2∼5 times. Therefore on average, we can obtain convergent solution up to the Deborah number of 200 for which the comer vortex size reaches 1.6 times of the half width of the upstream reservoir. Examining spatial violation of the positive definiteness of the elastic strain tensor, we conjecture that the stabilization effect results from the peculiar behavior of rational functions identified as steep gradient on one domain boundary and linear slope on the other. Whereas the rational interpolation of both elastic strain and velocity distorts solutions significantly, it is shown that the variation of solutions incurred by rational interpolation only of the elastic strain is almost negligible. It is also verified that the rational interpolation deteriorates speed of convergence with respect to mesh refinement.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.771-771
• /
• 1999

• 한국유변학회:학술대회논문집
• /
• 한국유변학회 2002년도 추계학술발표회 논문집
• /
• pp.101-103
• /
• 2002

• 호남수학학술지
• /
• 제41권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.

• Korean Journal of Mathematics
• /
• 제30권1호
• /
• pp.43-51
• /
• 2022

The aim of this paper is to obtain a Radau type quadrature formula for a rational interpolation process satisfying the almost quasi Hermite Fejér interpolatory conditions on the zeros of Chebyshev Markov sine fraction on [-1, 1).

• Journal of Mechanical Science and Technology
• /
• 제15권2호
• /
• pp.192-198
• /
• 2001

We consider an interpolation problem with nonuniform rational B-spline curves given ordered data points. The existing approaches assume that weight for each point is available. But, it is not the case in practical applications. Schneider suggested a method which interpolates data points by automatically determining the weight of each control point. However, a drawback of Schneiders approach is that there is no guarantee of avoiding undesired poles; avoiding negative weights. Based on a quadratic programming technique, we use the weights of the control points for interpolating additional data. The weights are restricted to appropriate intervals; this guarantees the regularity of the interpolating curve. In a addition, a knot placement is proposed for pleasing interpolation. In comparison with integral B-spline interpolation, the proposed scheme leads to B-spline curves with fewer control points.

• 대한수학회보
• /
• 제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.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.517-525
• /
• 2000

A constrained rational cubic spline with linear denominator was constructed in [1]. In the present paper, the sufficient condition for convex interpolation and some properties in error estimation are given.

• 대한수학회지
• /
• 제33권4호
• /
• pp.717-734
• /
• 1996

For a scalar rational function, the spectral data consisting of zeros and poles with their respective multiplicities uniquely determines the function up to a nonzero multiplicative factor. But due to the richness of the spectral structure of a rational matrix function, reconstruction of a rational matrix function from a given spectral data is not that simple.