• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.11a
• /
• pp.9-16
• /
• 2004

Performing adjustments where the observation equations involve more than a single measurement are General Least Squares(GLS) and Total Least Squares(TLS). This paper introduces theory of the GLS and TLS and compared experimentally accuracy and efficiency of those through 2D conformal coordinate transformation and 2D affine coordinate transformation. In conclusion, in case of 2D coordinate transformation, GLS can produce a little more accurate and efficient than TLS. In survey fields, The GLS and TLS can be used cooperatively for adjusting the actual coordinate measurements.

• Honam Mathematical Journal
• /
• v.37 no.3
• /
• pp.299-315
• /
• 2015

In this paper, we study the first-order system least-squares (FOSLS) spectral method for parabolic partial differential equations. There were lots of least-squares approaches to solve elliptic partial differential equations using finite element approximation. Also, some approaches using spectral methods have been studied in recent. In order to solve the parabolic partial differential equations in parallel, we consider a parallel numerical method based on a hybrid method of the frequency-domain method and first-order system least-squares method. First, we transform the parabolic problem in the space-time domain to the elliptic problems in the space-frequency domain. Second, we solve each elliptic problem in parallel for some frequencies using the first-order system least-squares method. And then we take the discrete inverse Fourier transforms in order to obtain the approximate solution in the space-time domain. We will introduce such a hybrid method and then present a numerical experiment.

• East Asian mathematical journal
• /
• v.35 no.5
• /
• pp.569-587
• /
• 2019

In this paper, we consider a split least-squares characteristic mixed element method for Sobolev equations with a convection term. First, to manipulate both convection term and time derivative term efficiently, we apply a characteristic mixed element method to get the system of equations in the primal unknown and the flux unknown and then get a least-squares minimization problem and a least-squares characteristic mixed element scheme. Finally, we obtain a split least-squares characteristic mixed element scheme for the given problem whose system is uncoupled in the unknowns. We prove the optimal order in $L^2$ and $H^1$ normed spaces for the primal unknown and the suboptimal order in $L^2$ normed space for the flux unknown.

• East Asian mathematical journal
• /
• v.38 no.3
• /
• pp.293-319
• /
• 2022

In this paper, we introduce a higher order split least-squares characteristic mixed element scheme for Sobolev equations. First, we use a characteristic mixed element method to manipulate both convection term and time derivative term efficiently and obtain the system of equations in the primal unknown and the flux unknown. Second, we define a least-squares minimization problem and a least-squares characteristic mixed element scheme. Finally, we obtain a split least-squares characteristic mixed element scheme for the given problem whose system is uncoupled in the unknowns. We establish the convergence results for the primal unknown and the flux unknown with the second order in a time increment.

• 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 applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1233-1245
• /
• 2008

In this paper, an iterative method is proposed to solve the least-squares problem of matrix equation AXB+CYD=E over unknown matrix pair [X, Y]. By this iterative method, for any initial matrix pair [$X_1,\;Y_1$], a solution pair or the least-norm least-squares solution pair of which can be obtained within finite iterative steps in the absence of roundoff errors. In addition, we also consider the optimal approximation problem for the given matrix pair [$X_0,\;Y_0$] in Frobenius norm. Given numerical examples show that the algorithm is efficient.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.15-19
• /
• 2003

The Total Least Squares (TLS) method is introduced in comparison with the conventional Least Squares (LS) method. The principles and mathematical models for both methods are summarized and the comparison results from their applications to a simple geometric example, fitting a straight line to a set of 2D points are presented. As conceptually reasoned, the results clearly indicate that LS is more susceptible of producing wrong parameters with worse precision rather than TLS. For many applications in surveying, can adjustment computation and parameter estimation based on TLS provide better results.

• Journal of the Korean Data and Information Science Society
• /
• v.13 no.2
• /
• pp.271-284
• /
• 2002

In this paper we consider the robust inference for the parameter of linear regression model based on weighted least squares. First we consider the sequential test of multiple outliers. Next we suggest the way to assign a weight to each observation $(x_i,\;y_i)$ and recommend the robust inference for linear model. Finally, to check the performance of confidence interval for the slope using proposed method, we conducted a Monte Carlo simulation and presented some numerical results and examples.

• 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.