• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.9-26
• /
• 2001

In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.10 s.241
• /
• pp.1139-1147
• /
• 2005

The shape optimal design of the plate-fin type heat sink with vortex generator is performed to minimize the pressure loss subjected to the desired maximum temperature numerically. Evaluation of the performance function, in general, is required much computational cost in fluid/thermal systems. Thus, global approximate optimization techniques have been introduced into the optimization of fluid/thermal systems. In this study, Kriging method Is used to obtain the optimal solutions associated with the computational fluid dynamics (CFD). The results show that when the temperature .rise is less than 40 K, the optimal design variables are $B_1=2.44\;mm,\;B_2=2.09\;mm$, and t=7.58 mm. Kriging method can dramatically reduce computational time by 1/6 times compared to SQP method so that the efficiency of Kriging method can be validated.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.643-652
• /
• 2005

It has been known that the exponentiated exponential distribution can be used as a possible alternative to the gamma distribution or the Weibull distribution in many situations. But the maximum likelihood method does not admit explicit solutions when the sample is multiply censored. So we derive the approximate maximum likelihood estimators for the location and scale parameters in the exponentiated exponential distribution that are explicit function of order statistics. We also compare the proposed estimators in the sense of the mean squared error for various censored samples.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1065-1092
• /
• 2018

This manuscript is involved with a category of second-order impulsive functional integro-differential equations with nonlocal conditions in Banach spaces. Sufficient conditions for existence and approximate controllability of mild solutions are acquired by making use of the theory of cosine family, Banach contraction principle and Leray-Schauder nonlinear alternative fixed point theorem. An illustration is additionally furnished to prove the attained principles.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.97-109
• /
• 1998

In this paper, we propose a new approach to solve stochastic fluid flow models applied to the analysis of ceil loss of an ATM multiplexer. Existing stochastic fluid flow models have been analyzed by using linear differential equations. In case of large state space, however. analyzing stochastic fluid flow model without numerical errors is not easy. To avoid this numerical errors and to analyze stochastic fluid flow model with large state space. we develope a new computational algorithm. Instead of solving differential equations directly, this approach uses iterative and numerical method without calculating eigenvalues. eigenvectors and boundary coefficients. As a result, approximate solutions and upper and lower bounds are obtained. This approach can be applied to stochastic fluid flow model having general Markov chain structure as well as to the superposition of heterogeneous ON-OFF sources it can be extended to Markov process having non-exponential sojourn times.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.639-650
• /
• 2018

Finding a solution for the Legendre equation is difficult. Especially if it is as a part of the Laplace equation solving in the electric fields. In this paper, first a problem of the generalized differential transform method (GDTM) is solved by the Sturm-Liouville equation, then the Legendre equation is solved by using it. To continue, the approximate solution is compared with the nth-degree Legendre polynomial for obtaining the inner and outer potential of a sphere. This approximate is more accurate than the previous solutions, and is closer to an ideal potential in the intervals.

• Geomechanics and Engineering
• /
• v.3 no.1
• /
• pp.17-28
• /
• 2011

This paper presents an analytical solution for steady state flow into a close-ended cylindrical permeameter. The soil medium is considered to be uniform, isotropic, and of infinite thickness. Laplace equation is solved by considering rotational symmetry and by using curvilinear coordinates obtained from conformal mapping. The deduced shape factors, which are compared to approximate relationships obtained from both numerical and physical modelling, and idealizations involving ellipsoidal cavities, are proposed for use in field measurements. It is shown that some of the shape factors obtained are significantly different from published values and show a much higher dependence of the rate of flow on the aspect ratio, than deduced from approximate solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.14-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1284-1288
• /
• 1990

We proposed the equations which enable us to calculate more easily the far-field radiation characteristics fo linear antennas with arbitarary current distributions. We derived the equations as series forms by approximating the current distribution on antenna as piecewise sinusoidal functions. The solutions of the approximate equations approach the exact values with increasing number of segments, but we have noticed by several examples that only a few number of segments are enough for practical problems.