• 대한전자공학회논문지SD
• /
• 제40권3호
• /
• pp.33-42
• /
• 2003

본 논문에서는 NST (new Svoboda-Tung) 알고리즘을 이용한 비동기식 제산기의 효율적 설계에 관해 기술한다. 본 제산기설계에서는 비동기 설계방식을 사용하여 제산연산이 필요할 때에만 동작함으로써 전력소모를 줄이도록 설계한다. 제산기는 비동기식 파이프라인 구조를 이용한 per-scale부, iteration step부, on-the-fly converter부의 세부분으로 구성된다. Per-scale부에서는 새로운 전용 감산기를 이용하여 적은 면적과 고성능을 갖도록 설계한다. Iteration step부에서는 4개의 division step을 갖는 비동기식 링 구조로 설계하고, 아울러 크리티컬 패스(critical path)에 해당하는 부분만을 2선식으로, 나머지 부분은 단선식으로 구성하는 구현방법을 채택하여 하드웨어의 오버헤드를 줄인다. On-the-fly converter부는 iteration step부와 병렬연산이 가능한 on-the-fly 알고리즘을 이용하여 고속연산이 되도록 설계한다. 0.6㎛ CMOS 공정을 이용하여 설계한 결과, 1,480 ×1,200㎛²의 면적에 12,956개의 트랜지스터가 사용되었고, 41.7㎱의 평균지연시간을 가졌다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.9-12
• /
• 2003

This paper describes a step-by-step method to minimize design iterations in a process of product design change. In the design process, two components are coupled if a change of a component can require the other components change, and design iterations are generated by the coupling. The design iteration is one of main factors that increase design effort. In this study, three matrices are used to solve the design iteration of automatic transmission lever, Requirement-Engineering matrix, Engineering-Components matrix, and DSM(Design Structure Matrix). Firstly, with the DSM, the product architecture and conceptual design process are proposed from product function analysis. Secondly, with the QFD, the Requirement-Engineering matrix and Engineering-Components matrix present the relationship among customer requirements, engineering issues, and product components. Lastly, the results of the QFD analysis are used in the DSM to solve the component interactions and to provide design

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.557-566
• /
• 2009

In this paper, we present the three-step mean value iterative scheme and prove that the iteration sequence converge strongly to a common element of the set of fixed points of a nonexpansive mappings and the set of the solutions of the variational inclusions under some mild conditions. The results presented in this paper extend, generalize and improve the results of Noor and Huang and some others.

• Journal of applied mathematics & informatics
• /
• 제4권2호
• /
• pp.341-378
• /
• 1997

We consider three classes of numerical methods for solv-ing the semi-explicit differential-algebraic equations of index 1 and higher. These methods use implicit multistep fixed stepsize methods and several iterative processes including simple iteration, full a2nd modified Newton iteration. For these methods we prove convergence theorems and derive error estimates. We consider different ways of choosing initial approximations for these iterative methods and in-vestigate their efficiency in theory and practice.

• Nonlinear Functional Analysis and Applications
• /
• 제27권4호
• /
• pp.785-795
• /
• 2022

In this paper, we introduce a Mann-like three step iteration method and show that it can be used to approximate the fixed point of a weak contraction mapping. Furthermore, we prove that this scheme is equivalent to the Mann iterative scheme. A comparison is made with the other third order iterative methods. Results are presented in a table to support our conclusion.

• 대한수학회논문집
• /
• 제19권1호
• /
• pp.63-74
• /
• 2004

Suppose that X is a real Banach space, K is a nonempty closed convex subset of X and T : $K\;\rightarrow\;K$ is a uniformly continuous ${\phi}$-hemicontractive operator or a Lipschitz ${\phi}-hemicontractive$ operator. In this paper we prove that under certain conditions the three-step iteration methods with errors converge strongly to the unique fixed point of T. Our results extend the corresponding results of Chang [1], Chang et a1. [2], Chidume [3]-[7], Chidume and Osilike [9], Deng [10], Liu and Kang [13], [14], Osilike [15], [16] and Tan and Xu [17].

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.661-672
• /
• 2009

In this paper, we introduce a modified three-step iteration scheme with errors for asymptotically nonexpansive mappings in the framework of uniformly convex Banach spaces. Weak and strong convergence theorems are established.

• Tribology and Lubricants
• /
• 제16권4호
• /
• pp.295-301
• /
• 2000

The dynamic simulation of slider in hard disk drive is performed using Factored Implicit Finite Difference method. The modified Reynolds equation with Fukui and Kaneko model is employed as a governing equation. Equations of motion for the slider of three degrees of freedom are solved simultaneously with the modified Reynolds equation. The transient responses of the slider for disk step bumps and slider impulse forces are shown for various cases and are compared for the iteration algorithm and new algorithm.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.127-133
• /
• 2012

We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

• 한국윤활학회:학술대회논문집
• /
• 한국윤활학회 1999년도 제30회 추계학술대회
• /
• pp.146-153
• /
• 1999

A numerical dynamic simulation is necessary to investigate the capacity of the HDD. The slider surface become more and more complicated to make the magnetized area smaller and readback signal stronger. So a numerical dynamic simulation must be preceded to develop a new slider in HDD. The dynamic simulations of air-lubricated slider bearing have been peformed using FIFD(Factored Implicit Finite Difference) method. The governing equation, Reynolds equation Is modified with Fukui and Kaneko model(FK model) which includes the first and the second-order slip. The equations of motion for the slider bearing are solved simultaneously with the modified Reynolds equation for the case of three degrees of freedom. The slider transient response for disk step bump and slider impulse force is given for various case and for iteration algorithm and new algorithm.