• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.545-558
• /
• 2013

In this paper, the formulas for calculating the extremal ranks and inertias of the Hermitian least squares solutions to matrix equation AX = B are established. In particular, the necessary and sufficient conditions for the existences of the positive and nonnegative definite solutions to this matrix equation are given. Meanwhile, the least squares problem of the above matrix equation with Hermitian R-symmetric and R-skew symmetric constraints are also investigated.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.651-655
• /
• 1996

Lagrange's famous Four Square Theorem [L] says that every positive integer can be represented by the sum of four squares. This marvelous theorem was generalized by Mordell [M1] and Ko [K1] as follows : every positive definite integral quadratic form of two, three, four, and five variables is represented by the sum of five, six, seven, and eight squares, respectively. And they tried to extend this to positive definite integral quadratic forms of six or more variables.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.1091-1102
• /
• 2003

The Weibull variate is commonly used as a lifetime distribution in reliability applications. Estimation of parameters is revisited in the two-parameter Weibull distribution. The method of product spacings, the method of quantile estimates and the method of least squares are applied to this distribution. A comparative study between a simple minded estimate, the maximum likelihood estimate, the product spacings estimate, the quantile estimate, the least squares estimate, and the adjusted least squares estimate is presented.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.757-770
• /
• 1999

We analyse in this paper the possibility of using preconditioning techniques as for square non-singular systems, also in the case of inconsistent least-squares problems. We find conditions in which the minimal norm solution of the preconditioned least-wquares problem equals that of the original prblem. We also find conditions such that thd Kaczmarz-Extendid algorithm with relaxation parameters (analysed by the author in [4]), cna be adapted to the preconditioned least-squares problem. In the last section of the paper we present numerical experiments, with two variants of preconditioning, applied to an inconsistent linear least-squares model probelm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.5
• /
• pp.339-344
• /
• 2000

This paper is concerned with the simplification of complex linear time-invariant systems. A simple technique is suggested using the well-known least squares method in the frequency domain. Given a high-order transfer function in the s- or z-domain, the squared-gain function corresponding to a low-order model is computed by the least squares method. Then, the low-order transfer function is obtained through the factorization. Three examples are given to illustrate the efficiency of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.409-417
• /
• 2003

There are two rotation matrix parameters in a model, pro-posed by Prentice in 1989, for pairs of rotations in 3 dimensional space. For the least squares estimates of the two parameters, an algorithm was also presented, but it turned out that the algorithm could fail to get the least squares estimates. This article provides another algorithm for the least squares estimates and its performance is demonstrated by simulation results.

• Journal of the Korean Statistical Society
• /
• v.4 no.1
• /
• pp.39-56
• /
• 1975

Ever since Gauss discussed the least-squares method in 1812 and Bertrand translated Gauss's work in French, the least-squares method has been used for various economic analysis. The justification of the least-squares method was given by Markov in 1912 in connection with the previous discussion by Gauss and Bertrand. The main argument concerned the problem of obtaining the best linear unbiased estimates. In some modern language, the argument can be explained as follow.

• The Mathematical Education
• /
• v.15 no.1
• /
• pp.18-21
• /
• 1976

Lagrange proved that any positive integer is the sum of at most four squares. We consider a elliptic function f$_{\alpha}$(v│$\tau$) of periods 1. $\tau$ derived from $\theta$-functions. From the important number-theoretical interpretation (equation omitted) we obtain $A_4$(n) the number of representations entations of n as a sum of 4-squares.m of 4-squares.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.155-161
• /
• 2006

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.