• Journal of Integrative Natural Science
• /
• v.9 no.1
• /
• pp.10-15
• /
• 2016

In this paper the approximation methods of offset curve of conic with explicit error bound are considered. The quadratic approximation of conic(QAC) method, the method based on quadratic circle approximation(BQC) and the Pythagorean hodograph cubic(PHC) approximation have the explicit error bound for approximation of offset curve of conic. We present the explicit upper bound of the Hausdorff distance between the offset curve of conic and its PHC approximation. Also we show that the PHC approximation of any symmetric conic is closer to the line passing through both endpoints of the conic than the QAC.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.257-265
• /
• 2009

In this paper we find an explicit form of upper bound of Hausdorff distance between given cubic spline curve and its quadratic spline approximation. As an application the approximation of offset curve of cubic spline curve is presented using our explicit error analysis. The offset curve of quadratic spline curve is exact rational spline curve of degree six, which is also an approximation of the offset curve of cubic spline curve.

• East Asian mathematical journal
• /
• v.36 no.1
• /
• pp.91-99
• /
• 2020

This paper obtains an explicit expression for a debtor's consumption, porfolio and time for filing for bankruptcy when the debtor is subject to upper bound on consumption rate. The utility of consumption is CRRA type and the dynamic programming principle is applied.

• Journal of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.121-136
• /
• 2008

Some new explicit bounds on the solutions to a class of new nonlinear retarded Volterra-Fredholm type integral inequalities in two independent variables are established, which can be used as effective tools in the study of certain integral equations. Some examples of application are also indicated.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.1
• /
• pp.1-22
• /
• 2023

In this paper we settle some polynomial identity which provides a family of explicit Waring decompositions of any monomial Xa00 Xa11··· Xann over a field k. This gives an upper bound for the Waring rank of a given monomial and naturally leads to an explicit Waring decomposition of any homogeneous form and, eventually, of any polynomial via (de)homogenization. Note that such decomposition is very useful in many applications dealing with polynomial computations, symmetric tensor problems and so on. We discuss some computational aspect of our result as comparing with other known methods and also present a computer implementation for potential use in the end.

• Communications of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.1193-1202
• /
• 2020

We consider the integral ${{\int}_{0}^{\infty}}(\frac{sin\;x}{x})^n\;dx$ as a function of the positive integer n. We show that there exists an asymptotic series in ${\frac{1}{n}}$ and compute the first terms of this series together with an explicit error bound.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.32 no.2
• /
• pp.43-49
• /
• 1983

In this study, model simplification problem using singular perturbation technique is considered. The correctness and errors of simplified model which is obtained by the use of this technique, depends upon the order and the time scaling factor of the simplified model But, unfortunately, there is no explicit criteria for selections of these parameters. In this paper, error equations are derived and expanded by using the useful properties of $L_2$-norm. Then, new criteria for selecting the order of the simplified model and time scaling factor with respect to error bound are suggested. Since these criteria, newly proposed in this study, have strong concern about error bound, it can be used to choose the minimum order of the simplified model and time scaling factor with respect to given error bound. Conversely, if the order of the simplified model and time scaling factor are given, the error induced by the simplification can also be computed easily.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.332-335
• /
• 1995

A simple and effective method for improving Euclidean norm condition number for chemical processing system is presented. The singular value sensitivities of Freudenberg et al. (1982) is used to estimate the behavior of singular values of process transfer function matrix when design parameter is changed, then the condition number can be calculated straightforwardly. The method requires explicit dependencies of each transfer function matrix elements on design parameters. These dependencies can be obtained either by symbolic differentiation in the form of explicit function of design parameters, or by numerical perturbation studies for units with large and complicated models. Gerschgorin-type lower bound for minimum singular value is introduced to detect the large divergencies near singular point due to linearity of sensitivities. The case studies are performed to show the efficiency of the proposed method.

• Communications for Statistical Applications and Methods
• /
• v.15 no.1
• /
• pp.43-50
• /
• 2008

Multinomial logistic regression is a well known multiclass classification method in the field of statistical learning. More recently, the development of sparse multinomial logistic regression model has found application in microarray classification, where explicit identification of the most informative observations is of value. In this paper, we propose a sparse multinomial kernel logistic regression model, in which the sparsity arises from the use of a Laplacian prior and a fast exact algorithm is derived by employing a bound optimization approach. Experimental results are then presented to indicate the performance of the proposed procedure.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.28 no.1
• /
• pp.22-32
• /
• 2024

In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G³ Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.