• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.135-143
• /
• 2011

As a zero set of some multivariate splines, the piecewise algebraic variety is a kind of generalization of the classical algebraic variety. This paper presents an algorithm for isolating real roots of the zero-dimensional piecewise algebraic variety which is based on interval evaluation and the interval zeros of univariate interval polynomials in Bernstein form. An example is provided to show the proposed algorithm is effective.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.837-849
• /
• 2018

In this paper, we study the closedness such as seminomality and t-closedness, and Noetherian-like properties such as piecewise Noetherianness and Noetherian spectrum, of Hurwitz polynomial rings and Hurwitz series rings. To do so, we construct an isomorphism between a Hurwitz polynomial ring (resp., a Hurwitz series ring) and a factor ring of a polynomial ring (resp., a power series ring) in a countably infinite number of indeterminates.

• Journal of the Korean Mathematical Society
• /
• v.40 no.6
• /
• pp.1075-1083
• /
• 2003

The purpose of this paper is to investigate the piecewise wise polynomial approximation for the curved boundary. We analyze the error of an approximated solution due to this approximation and then compare the approximation errors for the cases of polygonal and piecewise polynomial approximations for the curved boundary. Based on the results of analysis, p-version numerical methods for solving Dirichlet's problems are applied to any smooth curved domain.

• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.623-643
• /
• 2016

In this paper, we study piecewise Noetherian (resp., piecewise w-Noetherian) properties in several settings including flat (resp., t-flat) overrings, Nagata rings, integral domains of finite character (resp., w-finite character), pullbacks of a certain type, polynomial rings, and D + XK[X] constructions.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.320-322
• /
• 2008

We present efficient algorithms for solving the piecewise-cubic approximation problems in the plane. Given a set D of n points in the plane, we find a piecewise-cubic polynomial curve passing through only the points of a subset S of D and approximating the other points using the uniform metric. The goal is to minimize the size of S for a given error tolerance $\varepsilon$, called the min-# problem, or to minimize the error tolerance $\varepsilon$ for a given size of S, called the min-$\varepsilon$ problem. We give algorithms with running times O($n^2$ logn) and O($n^3$) for both problems, respectively.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.7
• /
• pp.967-970
• /
• 2003

A new modified singular value decomposition method, piecewise polynomial truncated SVD (PPTSVD), which was originally developed to identify discontinuity of the earth's radial density function, has been used for large solvent peak suppression and noise elimination in nuclear magnetic resonance (NMR) signal processing. PPTSVD consists of two algorithms of truncated SVD (TSVD) and L₁ problems. In TSVD, some unwanted large solvent peaks and noise are suppressed with a certain soft threshold value, whereas signal and noise in raw data are resolved and eliminated in L₁ problems. These two algorithms were systematically programmed to produce high quality of NMR spectra, including a better solvent peak suppression with good spectral line shapes and better noise suppression with a higher signal to noise ratio value up to 27% spectral enhancement, which is applicable to multidimensional NMR data processing.

• ETRI Journal
• /
• v.6 no.2
• /
• pp.18-26
• /
• 1984

Among the various forms of interpolating polynomial for approximation, this paper is a study about the characteristics of piecewise Lagrange interpolating polynomials. And throughout the study, an attempt is made to construct the two-dimensional ap proximating function over Rectangular Grid and Triangular Grid by using the one-dim ensional interpolating polynomials.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.45-72
• /
• 2022

In this work, we study Bernstein-Walsh-type estimations for the derivative of an arbitrary algebraic polynomial in regions with piecewise smooth boundary without cusps of the complex plane. Also, estimates are given on the whole complex plane.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.276-284
• /
• 2000

Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.21-25
• /
• 2009

In this paper, we study the problem to fit a piecewise-quadratic polynomial curve to points in the plane. The curve consists of quadratic polynomial segments and two points are connected by a segment. But it passes through a subset of points, and for the points not to be passed, the error between the curve and the points is estimated in $L^{\infty}$ metric. We consider two optimization problems for the above problem. One is to reduce the number of segments of the curve, given the allowed error, and the other is to reduce the error between the curve and the points, while the curve has the number of segments less than or equal to the given integer. For the number n of given points, we propose $O(n^2)$ algorithm for the former problem and $O(n^3)$ algorithm for the latter.