• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.1 no.1
• /
• pp.72-74
• /
• 1983

Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.

• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1041-1041
• /
• 2001

Removal of variability in spectra data before the application of chemometric modeling will generally result in simpler (and presumably more robust) models. Particularly for sparsely sampled data, such as typically encountered in diode array instruments, the use of Savitzky-Golay (S-G) derivatives offers an effective method to remove effects of shifting baselines and sloping or curving apparent baselines often observed with scattering samples. The application of these convolution functions is equivalent to fitting a selected polynomial to a number of points in the spectrum, usually 5 to 25 points. The value of the polynomial evaluated at its mid-point, or its derivative, is taken as the (smoothed) spectrum or its derivative at the mid-point of the wavelength window. The process is continued for successive windows along the spectrum. The original paper, published in 1964 [1] presented these convolution functions as integers to be used as multipliers for the spectral values at equal intervals in the window, with a normalization integer to divide the sum of the products, to determine the result for each point. Steinier et al. [2] published corrections to errors in the original presentation [1], and a vector formulation for obtaining the coefficients. The actual selection of the degree of polynomial and number of points in the window determines whether closely situated bands and shoulders are resolved in the derivatives. Furthermore, the actual noise reduction in the derivatives may be estimated from the square root of the sums of the coefficients, divided by the NORM value. A simple technique to evaluate the actual convolution factors employed in the calculation by the software will be presented. It has been found that some software packages do not properly account for the sampling interval of the spectral data (Equation Ⅶ in [1]). While this is not a problem in the construction and implementation of chemometric models, it may be noticed in comparing models at differing spectral resolutions. Also, the effects on parameters of PLS models of choosing various polynomials and numbers of points in the window will be presented.

• Structural Engineering and Mechanics
• /
• v.2 no.3
• /
• pp.245-256
• /
• 1994

A new axisymmetric crack model is proposed on the basis of p-version of the finite element method limited to theory of small scale yielding. To this end, axisymmetric stress element is formulated by integrals of Legendre polynomial which has hierarchical nature and orthogonality relationship. The virtual crack extension method has been adopted to calculate the stress intensity factors for 3-D axisymmetric cracked bodies where the potential energy change as a function of position along the crack front is calculated. The sensitivity with respect to the aspect ratio and Poisson locking has been tested to ascertain the robustness of p-version axisymmetric element. Also, the limit value that is an exact solution obtained by FEM when degree of freedom is infinite can be estimated using the extrapolation equation based on error prediction in energy norm. Numerical examples of thick-walled cylinder, axisymmetric crack in a round bar and internal part-thorough cracked pipes are tested with high precision.

• Journal of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.579-591
• /
• 2006

In this paper we obtain a sufficient and necessary condition for an analytic function f on the unit ball B with Hadamard gaps, that is, for $f(z)\;=\;{\sum}^{\infty}_{k=1}\;P_{nk}(z)$ (the homogeneous polynomial expansion of f) satisfying $n_{k+1}/n_{k}{\ge}{\lambda}>1$ for all $k\;{\in}\;N$, to belong to the weighted Bergman space $$A^p_{\alpha}(B)\;=\;\{f{\mid}{\int}_{B}{\mid}f(z){\mid}^{p}(1-{\mid}z{\mid}^2)^{\alpha}dV(z) < {\infty},\;f{\in}H(B)\}$$. We find a growth estimate for the integral mean $$\({\int}_{{\partial}B}{\mid}f(r{\zeta}){\mid}^pd{\sigma}({\zeta})\)^{1/p}$$, and an estimate for the point evaluations in this class of functions. Similar results on the mixed norm space $H_{p,q,{\alpha}$(B) and weighted Bergman space on polydisc $A^p_{^{\to}_{\alpha}}(U^n)$ are also given.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.3
• /
• pp.211-236
• /
• 2019

This paper is devoted to the study and investigation of the Runge-Kutta discontinuous Galerkin method for a system of differential equations consisting of two hyperbolic conservation laws. The numerical coupling flux which is used at a given interface (x = 0) is the upwind flux. Moreover, in the linear case, we derive optimal convergence rates in the $L_2$-norm, showing an error estimate of order ${\mathcal{O}}(h^{k+1})$ in domains where the exact solution is smooth; here h is the mesh width and k is the degree of the (orthogonal Legendre) polynomial functions spanning the finite element subspace. The underlying temporal discretization scheme in time is the third-order total variation diminishing Runge-Kutta scheme. We justify the advantages of the Runge-Kutta discontinuous Galerkin method in a series of numerical examples.

• Communications of the Korean Mathematical Society
• /
• v.9 no.2
• /
• pp.467-489
• /
• 1994

Let $\Omega$ be a closed and bounded polygonal domain in R$^2$, or a closed line segment in R$^1$ with boundary $\Gamma$, such that there exists an invertible mapping T : $\Omega$ \longrightarrow $\Omega$ with the following correspondence: x$\in$$\Omega$ ↔ x = T(x) $\in$$\Omega$, (1.1) and (1.2) t $\in$ U$\sub$p/($\Omega$) ↔ t = to T$\^$-1/ $\in$ U$\sub$p/($\Omega$), where $\Omega$ denotes the corresponding reference elements I = [-1,1] and I ${\times}$ I in R$^1$ and R$^2$ respectively, (1.3) U$\sub$p/($\Omega$) = {t : t is a polynomial of degree $\leq$ p in each variable on $\Omega$}, and (1.4) U$\sub$p/($\Omega$) = {t : t = to T $\in$ U$\sub$p/($\Omega$)}.(omitted)

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.4_1
• /
• pp.67-76
• /
• 1992

A hierarchical formulation based on p-version of the finite element method for linear elastic axisymmetric stress analysis is presented. This is accomplished by introducing additional nodal variables in the element displacement approximation on the basis of integrals of Legendre polynomials. Since the displacement approximation is hierarchical, the resulting element stiffness matrix and equivalent nodal load vectors are hierarchical also. The merits of the propoosed element are as follow: i) improved conditioning, ii) ease of joining finite elements of different polynomial order, and iii) utilizing previous solutions and computation when attempting a refinement. Numerical examples are presented to demonstrate the accuracy, efficiency, modeling convenience, robustness and overall superiority of the present formulation. The results obtained from the present formulation are also compared with those available in the literature as well as with the analytical solutions.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.57-64
• /
• 2019

In this paper, we study a polynomially solvable case of the inverse interval graph coloring problem. Given an interval graph associated with a specific interval system, the inverse interval graph coloring problem is defined with the assumption that there is no proper K-coloring for the given interval graph, where K is a fixed integer. The problem is to modify the system of intervals associated with the given interval graph by shifting some of the intervals in such a way that the resulting interval graph becomes K-colorable and the total modification is minimum with respect to a certain norm. In this paper, we focus on the case K = 1 where all intervals associated with the interval graph have length 1 or 2, and interval displacement is only allowed to the righthand side with respect to its original position. To solve this problem in polynomial time, we propose a two-phase algorithm which consists of the sorting and First Fit procedure.