• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.683-687
• /
• 2007

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and Closed-Form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-Form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a Self-Tuning Weighted Least Square AOA algorithm that is a modified version of the conventional Closed-Form solution. In order to estimate the error covariance matrix as a weight, a two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.485-489
• /
• 2006

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and closed-form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a self-tuning weighted least square AOA algorithm that is a modified version of the conventional closed-form solution. In order to estimate the error covariance matrix as a weight, two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• Journal of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.349-372
• /
• 2015

This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.465-472
• /
• 2010

The purpose of this article is to introduce a new generalized class of the Wiener-Hopf equations and a new generalized class of the variational inequalities. Using the projection technique, we show that the generalized Wiener-Hopf equations are equivalent to the generalized variational inequalities. We use this alternative equivalence to suggest and analyze an iterative scheme for finding the solution of the generalized Wiener-Hopf equations and the solution of the generalized variational inequalities. The results presented in this paper may be viewed as significant and improvement of the previously known results. In special, our results improve and extend the resent results of M.A. Noor and Z.Y.Huang[M.A. Noor and Z.Y.Huang, Wiener-Hopf equation technique for variational inequalities and nonexpansive mappings, Appl. Math. Comput.(2007), doi:10.1016/j.amc.2007.02.117].

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.3
• /
• pp.305-319
• /
• 2000

Numerical solution lot frictional contact problems of nonlinearly deformable bodies having large deformation is presented. The contact conditions on the possible contact points are expressed by using the contact error vector, and the iterative scheme is used to reduce the contact error vector monotonically toward zero. At each iteration the solution consists of two steps : The first step is to revise the contact force by using the contact error vector given by the previous geometry, and the second step is to compute the displacement and the contact error vector by solving the equilibrium equation with the contact force given at the first step. Convergence of the iterative scheme to the correct solution is analyzed, and the numerical simulations we performed with a rigid-plastic membrane and a nonlinear elastic beam.

• Journal of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.61-88
• /
• 2020

In this paper, we investigate the existence of mild solutions for a class of fractional impulsive evolution equation with periodic boundary condition by means of the method of upper and lower solutions and monotone iterative method. Using the theory of Kuratowski measure of noncompactness, a series of results about mild solutions are obtained. Finally, two examples are given to illustrate our results.

• The Pure and Applied Mathematics
• /
• v.29 no.4
• /
• pp.255-275
• /
• 2022

In this paper, we introduce a new system of set-valued variational inclusion problems in semi-inner product spaces. We use resolvent operator technique to propose an iterative algorithm for computing the approximate solution of the system of set-valued variational inclusion problems. The results presented in this paper generalize, improve and unify many previously known results in the literature.

• Journal of Ocean Engineering and Technology
• /
• v.12 no.1
• /
• pp.120-127
• /
• 1998

An Elliptic model for calculating the combined refraction/diffraction of monochromatic linear waves is developed, including a term which allows for the dissipation of wave energy. Conjugate gradient method is employed as a solution technique. Wave height variations are calculated for localized circular and rectangular dissipation areas. It is shown that the numerical results agree very well with analytical solution in the case of circular damping region. The localized dissipation area creates a shadow region of low wave energy and the recovery of wave height by diffraction occurs very slowly with distance behind the damping region.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.163-175
• /
• 2014

This paper will focus on improving the performance of orthogonal frequency division multiplexing (OFDM) in Rayleigh fading environments. The proposed technique will use a previously published method that has been shown to improve OFDM performance in independent fading, based on ordered sub-carrier selection. Then, a simple non-iterative method for finding the optimal bit-loading allocation was proposed. It was also based on ordered sub-carrier selection. We compared both of these algorithms to an optimal bit-loading solution to determine their effectiveness in a correlated fading environment. The correlated fading was simulated using the JTC channel models. Our intent was not to create an optimal solution, but to create a low complexity solution that can be used in a wireless environment in which the channel conditions change rapidly and that require a simple algorithm for fast bit loading.

• Kyungpook Mathematical Journal
• /
• v.62 no.4
• /
• pp.699-713
• /
• 2022

This paper proposes a hybrid successive over-relaxation iterative method for the numerical solution of a nonlinear diffusion in a one-dimensional porous medium. The considered mathematical model is discretized using a computational complexity reduction scheme called half-sweep finite differences. The local truncation error and the analysis of the stability of the scheme are discussed. The proposed iterative method, which uses explicit group technique and modified successive over-relaxation, is formulated systematically. This method improves the efficiency of obtaining the solution in terms of total iterations and program elapsed time. The accuracy of the proposed method, which is measured using the magnitude of absolute errors, is promising. Numerical convergence tests of the proposed method are also provided. Some numerical experiments are delivered using initial-boundary value problems to show the superiority of the proposed method against some existing numerical methods.