• Journal of the Korean Statistical Society
• /
• v.29 no.3
• /
• pp.361-373
• /
• 2000

A simple and efficient algorithm is introduced for generalized least squares estimation under nonnegativity constraints in the components of the parameter vector. This algorithm gives the exact solution to the estimation problem within a finite number of pivot operations. Besides an illustrative example, an empirical study is conducted for investigating the performance of the proposed algorithm. This study indicates that most of problems are solved in a few iterations, and the number of iterations required for optimal solution increases linearly to the size of the problem. Finally, we will discuss the applicability of the proposed algorithm extensively to the estimation problem having a more general set of linear inequality constraints.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.471-479
• /
• 2008

Let $R\;{\in}\;C^{m{\times}m}$ and $S\;{\in}\;C^{n{\times}n}$ be nontrivial unitary involutions, i.e., $R^*\;=\;R\;=\;R^{-1}\;{\neq}\;I_m$ and $S^*\;=\;S\;=\;S^{-1}\;{\neq}\;I_m$. We say that $G\;{\in}\;C^{m{\times}n}$ is a generalized reflexive matrix if RGS = G. The set of all m ${\times}$ n generalized reflexive matrices is denoted by $GRC^{m{\times}n}$. In this paper, an efficient method for the least squares solution $X\;{\in}\;GRC^{m{\times}n}$ of the matrix equation AXB = D with arbitrary coefficient matrices $A\;{\in}\;C^{p{\times}m}$, $B\;{\in}\;C^{n{\times}q}$and the right-hand side $D\;{\in}\;C^{p{\times}q}$ is developed based on the canonical correlation decomposition(CCD) and, an explicit formula for the general solution is presented.

• Structural Engineering and Mechanics
• /
• v.21 no.3
• /
• pp.315-332
• /
• 2005

The Element-free Galerkin Method has become a very popular tool for the simulation of mechanical problems with moving boundaries. The internally applied Moving Least Squares interpolation uses in general Gaussian or cubic weighting functions and has compact support. Due to the approximative character of this interpolation the obtained shape functions do not fulfill the interpolation conditions, which causes additional numerical effort for the application of the boundary conditions. In this paper a new weighting function is presented, which was designed for meshless shape functions to fulfill these essential conditions with very high accuracy without any additional effort. Furthermore this interpolation gives much more stable results for varying size of the influence radius and for strongly distorted nodal arrangements than existing weighting function types.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.149-158
• /
• 2024

A least squares problem without correspondences is expressed as the following optimization: Π∈P^min_{m, x∈ℝn} ║Ax-Πy║, where A ∈ ℝ^m×n and y ∈ ℝ^m are given. In general, solving such an optimization problem is highly challenging. In this paper we use the rearrangement inequalities to find the closed form of solutions for certain cases. Moreover, despite the stringent constraints, we successfully tackle the nonlinear least squares problem without correspondences by leveraging rearrangement inequalities.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2001.05a
• /
• pp.92-97
• /
• 2001

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.421-429
• /
• 2008

We consider a general semiparametric additive risk model that consists of three components. They are parametric, purely and smoothly nonparametric components. In parametric component, time dependent term is known up to proportional constant. In purely nonparametric component, time dependent term is an unknown function, and time dependent term in smoothly nonparametric component is an unknown but smoothly function. As an estimation method of this model, we use the weighted least square estimation by Huffer and McKeague (1991). We provide an illustrative example as well as a simulation study that compares the performance of our method with the ordinary least square method.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.697-712
• /
• 2011

We present in this paper two versions of a general correction procedure applied to a classical linear iterative method. This gives us the possibility, under certain assumptions, to obtain an extension of it to inconsistent linear least-squares problems. We prove that some well known extended projection type algorithms from image reconstruction in computerized tomography fit into one or the other of these general versions and are derived as particular cases of them. We also present some numerical experiments on two phantoms widely used in image reconstruction literature. The experiments show the importance of these extension procedures, reflected in the quality of reconstructed images.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.315-326
• /
• 2009

The unknown parameters in regression models are usually estimated by using various existing methods. There are several existing methods, such as the least squares method, which is the most common one, the least absolute deviation method, the regression quantile method, and the asymmetric least squares method. For the nonlinear time series regression models, which do not satisfy the general conditions, we will compare them in two ways: 1) a theoretical comparison in the asymptotic sense and 2) an empirical comparison using Monte Carlo simulation for a small sample size.

• The Korean Journal of Applied Statistics
• /
• v.19 no.1
• /
• pp.97-110
• /
• 2006

Since it is well-established that even high quality data tend to contain outliers, one would expect fat? greater reliance on robust regression techniques than is actually observed. But most of all robust regression estimators suffers from the computational difficulties and the lower efficiency than the least squares under the normal error model. The weighted self-tuning estimator (WSTE) recently suggested by Lee (2004) has no more computational difficulty and it has the asymptotic normality and the high break-down point simultaneously. Although it has better properties than the other robust estimators, WSTE does not have full efficiency under the normal error model through the weighted least squares which is widely used. This paper introduces a new approach as called the reweighted WSTE (RWSTE), whose scale estimator is adaptively estimated by the self-tuning constant. A Monte Carlo study shows that new approach has better behavior than the general weighted least squares method under the normal model and the large data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.3
• /
• pp.288-295
• /
• 2013

In this paper, we compare the existing channel estimation technique for 4S (Ship to Ship, Ship to Shore) maritime communications under AWGN channel model, Rician fading channel model, and Rayleigh fading channel model respectively. In general, the received signal is corrupted by multipath and ISI (Inter Symbol Interference). The estimation of a time-varying multipath fading channel is a difficult task for the receiver. Its performance can be improved if an appropriate channel estimation filter is used. The simulation is performed in MATLAB. In this simulation, we use the popular estimation algorithms, LMS (Least Mean Square) and RLS (Recursive Least-Squares) are compared with respect to AWGN, Rician and Rayleigh channels.