• Nuclear Engineering and Technology
• /
• v.44 no.2
• /
• pp.207-224
• /
• 2012

This article discusses selects of some outstanding problems in nuclear reactor analysis, with proposed approaches thereto and numerical test results, as follows: i) multi-group approximation in the transport equation, ii) homogenization based on isolated single-assembly calculation, and iii) critical spectrum in Monte Carlo depletion.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2012.04a
• /
• pp.439-440
• /
• 2012

New analysis methods complement classical approaches in the vehicle NVH development by reducing and accelerating iteration steps to obtain a target sound. Therefore, tools are required that allow an integrative approach of sound engineering and structural analysis and enable a precise simulation and modification based on measured data. The Response Modification Analysis (RMA) is such a hybrid solution, which provides indications of relevant transfer paths taking into account the sensitivity of response channels to modifications of reference channels.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.1045-1058
• /
• 2000

In usual synchronous parallel computing, workload balance is a crucial factor to reduce idle times of some processors that have finished their jobs earlier than others. However, it is difficult to achieve on a heterogeneous workstation clusters where the available computing power of each processor is unpredictable. As a way to overcome such a problem, the idea of asynchronous methods has grown out and is being increasingly used and studied, but there is none for eigenvalue problems yet. In this paper, we suggest a new asynchronous method to solve some singular matrix problems, that can also be used for finding a certain eigenvector of some matrices.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.981-992
• /
• 2012

Integro-differential equations arise in modeling various physical and engineering problems. Several numerical and analytical methods have been developed to solving such equations. We introduce the NHPM for solving nonlinear integro-differential equations. Several examples for solving integro-differential equations are presented to illustrate the efficiency of the proposed NHPM.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.119-133
• /
• 2011

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.61-74
• /
• 2011

In this paper, we introduce a new iteration method based on the hybrid method in mathematical programming and the descent-like method for finding a common element of the solution set for a variational inequality and the set of common fixed points of a nonexpansive semigroup in Hilbert spaces. We obtain a strong convergence for the sequence generated by our method in Hilbert spaces. The result in this paper modifies and improves some well-known results in the literature for a more general problem.

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

To the best of our knowledge, it would probably be the first time in the literature that we clarify the relationship between Yamada's method and viscosity iteration correctly. We design iterative methods based on the hybrid steepest descent algorithms for solving variational inclusions, equilibrium problems. Our results unify, extend and improve the corresponding results given by many others.

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

A regularized Newton method for nonlinear ill-posed problems is considered. In each Newton step an implicit iterative method with an appropriate stopping rule is proposed and analyzed. Under certain assumptions on the nonlinear operator, the convergence of the algorithm is proved and the algorithm is stable if the discrepancy principle is used to terminate the outer iteration. Numerical experiment shows the effectiveness of the method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.59-65
• /
• 1992

A modified primal-dual affine scaling algorithm for linear programming is presented. This modified algorithm generates an elipsoid containing all optimal dual solutions at each iteration, then checks whether or not a dual hyperplane intersects this ellipsoid. If the dual hyperplane has no intersection with this ellipsoid, its corresponding column must be optimal nonbasic. By condensing these columns, the size of LP problem can be reduced.

• Communications of the Korean Mathematical Society
• /
• v.27 no.1
• /
• pp.167-174
• /
• 2012

In this paper, we introduce an asymptotically $\phi$-hemicontractive mapping with a $\phi$-normalized duality mapping and obtain some strongly convergent result of a kind of multi-step iteration schemes for asymptotically $\phi$-hemicontractive mappings.