• Journal of the Korean Data and Information Science Society
• /
• v.26 no.1
• /
• pp.31-39
• /
• 2015

This paper deals with a method for estimating variance components on the basis of projections under the assumption of random effects model. It discusses how to use projections for getting sums of squares to estimate variance components. The use of projections makes the vector subspace generated by the model matrix to be decomposed into subspaces that are orthogonal each other. To partition the vector space by the model matrix stepwise procedure is used. It is shown that the suggested method is useful for obtaining Type I sum of squares requisite for the ANOVA method.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.669-684
• /
• 1999

We are interested in the problem of fitting a curve to a set of points in the plane in such a way that the sum of the squares of the orthogonal distances to given data points ins minimized. In[1] the prob-lem of fitting circles and ellipses was considered and numerically solved with general purpose methods. Especially in [2] H. Spath proposed a special purpose algorithm (Spath's ODF) for parabolas y-b=$c($\chi$-a)^2$ and for rotated ones. In this paper we present another parabola fitting algorithm which is slightly different from Spath's ODF. Our algorithm is mainly based on the steepest descent provedure with the view of en-suring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.121-142
• /
• 2002

We are interested in the curve fitting problems in such a way that the sum of the squares of the orthogonal distances to the given data points is minimized. Especially, the fitting an ellipse to the given data points is a problem that arises in many application areas, e.g. computer graphics, coordinate metrology, etc. In [1] the problem of fitting ellipses was considered and numerically solved with general purpose methods. In this paper we present another new ellipse fitting algorithm. Our algorithm if mainly based on the steepest descent procedure with the view of ensuring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• The Korean Journal of Applied Statistics
• /
• v.5 no.2
• /
• pp.283-292
• /
• 1992

Updating algorithms are studied for the basic statistics (mean, variance). For a linear model, a recursive formulae for least squares estimators of regression coefficients, residual sum of squares and variance-covariance matrix are also studied. Hotelling's $T^2$ statistics can be calculated recursively using the recursive formulae of mean vector and variance-covariance matrix without computing the sample variance-covariance matrix at each stage.

• Honam Mathematical Journal
• /
• v.35 no.3
• /
• pp.351-372
• /
• 2013

In this paper, we study a distinction the two generating functions : ${\varphi}^k(q)=\sum_{n=0}^{\infty}r_k(n)q^n$ and ${\varphi}^{*,k}(q)={\varphi}^k(q)-{\varphi}^k(q^2)$ ($k$ = 2, 4, 6, 8, 10, 12, 16), where $r_k(n)$ is the number of representations of $n$ as the sum of $k$ squares. We also obtain some congruences of representation numbers and divisor function.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.941-947
• /
• 2009

Let q be a power of 16. Every polynomial $P\in\mathbb{F}_q$[t] is a strict sum $P=A^2+A+B^3+C^3+D^3+E^3$. The values of A,B,C,D,E are effectively obtained from the coefficients of P. The proof uses the new result that every polynomial $Q\in\mathbb{F}_q$[t], satisfying the necessary condition that the constant term Q(0) has zero trace, has a strict and effective representation as: $Q=F^2+F+tG^2$. This improves for such q's and such Q's a result of Gallardo, Rahavandrainy, and Vaserstein that requires three polynomials F,G,H for the strict representation $Q=F^2$+F+GH. Observe that the latter representation may be considered as an analogue in characteristic 2 of the strict representation of a polynomial Q by three squares in odd characteristic.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.507-552
• /
• 2016

For a complex number q and a divisor function ${\sigma}_1(n)$ we define $$C(q):=q{\prod_{n=1}^{\infty}}(1-q^n)^{16}(1-q^{2n})^4,\\D(q):=q^2{\prod_{n=1}^{\infty}}(1-q^n)^8(1-q^{2n})^4(1-q^{4n})^8,\\L(q):=1-24{\sum_{n=1}^{\infty}}{\sigma}_1(n)q^n$$ moreover we obtain the number of representations of $n{\in}{\mathbb{N}}$ as sum of 24 squares, which are possible for us to deduce $L(q^4)C(q)$ and $L(q^4)D(q)$.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 1998.11a
• /
• pp.253-258
• /
• 1998

Staggered nested designs are the most popular class of unbalanced nested designs in practical fields. The most important features of the staggered nested design are that it has a very simple open-ended structure and each sum of squares in the analysis of variance has almost the same degrees of freedom. Based on the features, a class of unbalanced nested designs which is generalized of the staggered nested design is proposed. Some of the generalized staggered nested designs are shown to be more efficient than the staggered nested design in estimating some of variance components and their linear combinations.

• Journal of the Korean Data and Information Science Society
• /
• v.10 no.1
• /
• pp.163-172
• /
• 1999

We propose a cross-validatory method for the choice of the number of principal components in principal component regression based on the magnitudes of correlations with y. There are two different manners in choosing principal components, one is the order of eigenvalues(Shin and Moon, 1997) and the other is that of correlations with y. We apply our method to various data sets and compare results of those two methods.

• Journal of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.67-80
• /
• 2019

For positive integers a, b, c, and an integer n, the number of integer solutions $(x,y,z){\in}{\mathbb{Z}}^3$ of $a{\frac{x(x-1)}{2}}+b{\frac{y(y-1)}{2}}+c{\frac{z(z-1)}{2}}=n$ is denoted by t(a, b, c; n). In this article, we prove some relations between t(a, b, c; n) and the numbers of representations of integers by some ternary quadratic forms. In particular, we prove various conjectures given by Z. H. Sun in [6].