• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1285-1293
• /
• 2011

We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.565-575
• /
• 2013

Let H be a real Hilbert space and let T : H ${\rightarrow}$ H be a Lipschitz pseudocontractive mapping. We introduce a modified Ishikawa iterative algorithm and prove that if $F(T)=\{x{\in}H:Tx=x\}{\neq}{\emptyset}$, then our proposed iterative algorithm converges strongly to a fixed point of T. No compactness assumption is imposed on T and no further requirement is imposed on F(T).

• Communications for Statistical Applications and Methods
• /
• v.5 no.3
• /
• pp.581-589
• /
• 1998

An algorithm is proposed for the $L_1$-estimation with linear equality and inequality constraints in linear regression model. The algorithm employs a linear scaling transformation to obtain the optimal solution of linear programming type problem. And a special scheme is used to maintain the feasibility of the updated solution at each iteration. The convergence of the proposed algorithm is proved. In addition, the updating and orthogonal decomposition techniques are employed to improve the computational efficiency and numerical stability.

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

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.187-200
• /
• 2012

In this paper, we introduced a new extended extragradient iteration algorithm for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of equilibrium problems for a monotone and Lipschitz-type continuous mapping. And we show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Journal of electromagnetic engineering and science
• /
• v.11 no.1
• /
• pp.56-61
• /
• 2011

In this paper, we consider the topological derivative concept for developing a fast imaging algorithm of thin inclusions with dielectric contrast with respect to an embedding homogeneous domain with a smooth boundary. The topological derivative is evaluated by applying asymptotic expansion formulas in the presence of small, perfectly conducting cracks. Through the careful derivation, we can design a one-iteration imaging algorithm by solving an adjoint problem. Numerical experiments verify that this algorithm is fast, effective, and stable.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.875-877
• /
• 2003

This paper use fault location algorithm for single-phase-to-ground faults on the teed circuit of a parallel transmission line that use only local end voltage and current information. When Newton-Raphson iteration method is used, the Initial value may cause error or cause not suitable result. Suggested new calculation model uses NVP methodology, which is one of the fault tolerance technology to solve this problem. EMTP simulation result has shown effectiveness of the algorithm under various conditions.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.12
• /
• pp.75-81
• /
• 2004

AE-CORDIC improves the CORDIC operation speed with a rotation direction pre-computation algorithm. Its CORDIC iteration stages consist of non-predictable rotation direction states and predictable rotation stages. The non-predictable stages are replaced with lookup-table which has smaller hardware size than CORDIC iteration stages. The predictable stages can determine rotation direction with the input angle and simple encoder. In this paper, a rotation direction pre-computation algorithm with input angle encoder is proposed. and AE-CORDIC which have optimized Lookup-table is compared with the P-CORDIC algorithm. Hardware size, delay, and SQNR of the AE-CORDIC are verified with Samsung 0.18㎛ technology and Synopsys design compiler when input angle bit length is 16.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.954-963
• /
• 2012

As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention. In this paper, we multiple candidate matching pursuit (MuCaMP), which builds up candidate support set in every iteration and uses the minimum residual at last iteration. Using the restricted isometry property (RIP), we derive the sufficient condition for MuCaMP to recover the sparse signal exactly. The MuCaMP guarantees to reconstruct the K-sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{N+K}<\frac{\sqrt{N}}{\sqrt{K}+3\sqrt{N}}$. In addition, we show a recovery performance both noiseless and noisy measurements.

• Steel and Composite Structures
• /
• v.49 no.1
• /
• pp.1-17
• /
• 2023

Based on Ahmadzadeh-Varvani hardening rule (A-V model), multiaxial ratcheting effect of Z2CND18.12N austenitic stainless steel is simulated by ABAQUS with user subroutine UMAT. The results show that the predicted results of the origin multiaxial A-V model are lower than the experimental data, and it is difficult to control ratcheting strain rate. In order to improve the predicted capability of A-V model, the A-V model is modified. In this study. Moreover, under the assumption of the von Mises yield criterion and normal plasticity flow rule, we develop a numerical algorithm of plastic strain with the improved model to implement the finite element calculation of the model. Internal iteration in the numerical algorithm was implemented with the Euler backward method, which calculated the trial strain for each equilibrium iteration using the consistent tangent matrix. With a user subroutine, the proposed model is programmed into ABAQUS for a user - executable version. By simulating the uniaxial ratcheting of a round bar made of Z2CND18.12N austenitic stainless steel, we observe that the predicted results simulated by ABAQUS with UMAT are compared with the experimental data. The predicted results of the improved multiaxial A-V model are consistent well with the experimental data.