• 제목/요약/키워드: Computation problem

검색결과 1,291건 처리시간 0.029초

고유치 솔버 Davidson Method 의 병렬화 (A Parallel Algorithm of Davidson Method for Eigenproblems)

  • 김형중
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1997년도 하계학술대회 논문집 A
    • /
    • pp.12-14
    • /
    • 1997
  • The analysis of eigenvalue and eigenvector is a crucial procedure for many electromagnetic computation problems. However, eigenpair computation is timing-consuming task. Thus, its parallelization is required for designing large-scale and precision three-dimensional electromagnetic machines. In this paper, the Davidson method is parallelized on a cluster of workstations. Performance of the parallelization scheme is reported. This scheme is applied to a ridged waveguide design problem.

  • PDF

ADAPTATION OF THE MINORANT FUNCTION FOR LINEAR PROGRAMMING

  • Leulmi, S.;Leulmi, A.
    • East Asian mathematical journal
    • /
    • 제35권5호
    • /
    • pp.597-612
    • /
    • 2019
  • In this study, we propose a new logarithmic barrier approach to solve linear programming problem using the projective method of Karmarkar. We are interested in computation of the direction by Newton's method and of the step-size using minorant functions instead of line search methods in order to reduce the computation cost. Our new approach is even more beneficial than classical line search methods. We reinforce our purpose by many interesting numerical simulations proved the effectiveness of the algorithm developed in this work.

초등학교 학생들의 계산 능력과 수감각(Number Sense) 연구 (A Study on the Computation and Number-Sense Ability of Elementary School Students)

  • 방정숙
    • 한국학교수학회논문집
    • /
    • 제8권4호
    • /
    • pp.423-444
    • /
    • 2005
  • 초등 수학교육에서 수감각을 적절히 활용하는 것이 매우 중요함에도 불구하고 이에 대한 연구는 상대적으로 부족한 실정이다. 이에 본 연구는 초등학교 6학년 학생들을 대상으로 기본적인 계산 능력과 수감각 수행 능력을 분석하였다. 특히, 수감각 연구에 초점을 두어, 수감각의 주요 구성요소별로 다양한 문제 상황에서 자연스럽게 수감각을 활용하는지, 어떤 수감각을 활용하는 지 등을 면밀하게 분석하였고, 이를 토대로 수감각 개발에 관한 시사점을 도출하였다.

  • PDF

전자장문제를 위한 Davidson 방번의 병렬화 (A Parallel Algorithm of Davidson Method for Solving and Electomagnetic Problem)

  • 김형중;주욱
    • 산업기술연구
    • /
    • 제17권
    • /
    • pp.255-260
    • /
    • 1997
  • The analysis of eigenvalue and eigenvector is a crucial procedure for many electromagnetic computation problems. Although it is always the case in practice that only selected eigenpairs are needed, computation of eigenpair still seems to be a time-consuming task. In order to compute the eigenpair more quickly, there are two resorts: one is to select a good algorithm with care and another is to use parallelization technique to improve the speed of the computing. In this paper, one of the best eigensolver, the Davidson method, is parallelized on a cluster of workstations. We apply this scheme to a ridged waveguide design problem and obtain promising linear speedup and scalability.

  • PDF

인터벌 연산 기반의 곡면간 교차선 계산에 관한 연구 (A Study on Intersection Computation in Interval Arithmetic)

  • 고광희
    • 한국CDE학회논문집
    • /
    • 제15권3호
    • /
    • pp.178-188
    • /
    • 2010
  • This paper addresses the problem of determining if two surfaces intersect tangentially or transversally in a mathematically consistent manner and approximating an intersection curve. When floating point arithmetic is used in the computation, due to the limited precision, it often happens that the decision for tangential and transversal intersection is not clear cut. To handle this problem, in this paper, interval arithmetic is proposed to use, which provides a mathematically consistent way for such decision. After the decision, the intersection is traced using the validated ODE solver, which runs in interval arithmetic. Then an iterative method is used for computing the accurate intersection point at a given arc-length of the intersection curve. The computed intersection points are then approximated by using a B-spline curve, which is provided as one instance of intersection curve for further geometric processing. Examples are provided to demonstrate the proposed method.

진화연산과 신경망이론을 이용한 전력계통의 최적환경 및 경제운용 (Optimal Environmental and Economic Operation using Evolutionary Computation and Neural Networks)

  • 이상봉;김규호;유석구
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권12호
    • /
    • pp.1498-1506
    • /
    • 1999
  • In this paper, a hybridization of Evolutionary Strategy (ES) and a Two-Phase Neural Network(TPNN) is applied to the optimal environmental and economic operation. As the evolutionary computation, ES is to search for the global optimum based on natural selection and genetics but it shows a defect of reducing the convergence rate in the latter part of search, and often does not search the exact solution. Also, neural network theory as a local search technique can be used to search a more exact solution. But it also has the defect that a solution frequently sticks to the local region. So, new algorithm is presented as hybrid methods by combining merits of two methods. The hybrid algorithm has been tested on Emission Constrained Economic Dispatch (ECED) problem and Weighted Emission Economic Dispatch (WEED) problem for optimal environmental and economic operation. The result indicated that the hybrid approach can outperform the other computational efficiency and accuracy.

  • PDF

A Possibilistic C-Means Approach to the Hough Transform for Line Detection

  • Frank Chung-HoonRhee;Shim, Eun-A
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.476-479
    • /
    • 2003
  • The Rough transform (HT) is often used for extracting global features in binary images, for example curve and line segments, from local features such as single pixels. The HT is useful due to its insensitivity to missing edge points and occlusions, and robustness in noisy images. However, it possesses some disadvantages, such as time and memory consumption due to the number of input data and the selection of an optimal and efficient resolution of the accumulator space can be difficult. Another problem of the HT is in the difficulty of peak detection due to the discrete nature of the image space and the round off in estimation. In order to resolve the problem mentioned above, a possibilistic C-means approach to clustering [1] is used to cluster neighboring peaks. Several experimental results are given.

  • PDF

Optimization-based humanoid robot navigation using monocular camera within indoor environment

  • Han, Young-Joong;Kim, In-Seok;Hong, Young-Dae
    • ETRI Journal
    • /
    • 제40권4호
    • /
    • pp.446-457
    • /
    • 2018
  • Robot navigation allows robot mobility. Therefore, mobility is an area of robotics that has been actively investigated since robots were first developed. In recent years, interest in personal service robots for homes and public facilities has increased. As a result, robot navigation within the home environment, which is an indoor environment, is being actively investigated. However, the problem with conventional navigation algorithms is that they require a large computation time for their building mapping and path planning processes. This problem makes it difficult to cope with an environment that changes in real-time. Therefore, we propose a humanoid robot navigation algorithm consisting of an image processing and optimization algorithm. This algorithm realizes navigation with less computation time than conventional navigation algorithms using map building and path planning processes, and can cope with an environment that changes in real-time.

COMPUTATION OF THE DYNAMIC FORCE COMPONENT ON A VERTICAL CYLINDER DUE TO SECOND ORDER WAVE DIFFRACTION

  • Bhatta, Dambaru
    • Journal of applied mathematics & informatics
    • /
    • 제26권1_2호
    • /
    • pp.45-60
    • /
    • 2008
  • Here we consider the evaluation of the the dynamic component of the second order force due to wave diffraction by a circular cylinder analytically and numerically. The cylinder is fixed, vertical, surface piercing in water of finite uniform depth. The formulation of the wave-structure interaction is based on the assumption of a homogeneous, ideal, incompressible, and inviscid fluid. The nonlinearity in the wave-structure interaction problem arises from the free surface boundary conditions, namely, dynamic and kinematic free surface boundary conditions. We expand the velocity potential and free surface elevation functions in terms of a small parameter and then consider the second order diffraction problem. After deriving the pressure using Bernoulli's equation, we obtain the analytical expression for the dynamic component of the second order force on the cylinder by integrating the pressure over the wetted surface. The computation of the dynamic force component requires only the first order velocity potential. Numerical results for the dynamic force component are presented.

  • PDF

다익스트라 알고리즘을 이용한 배전계통의 향상된 사고복구 기법 (Improved Service Restoration technique by Using Dijkstra Algorithm in Distribution Systems)

  • 김낙경;김재철;전영재;김훈
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제50권2호
    • /
    • pp.67-75
    • /
    • 2001
  • This paper presents a fast and effective methodology for service restoration in large-scale distribution systems. The service restoration problem is formulated as a constrained optimization problem and requires the fast computation time and superior solution because the more unfaulted out-of-service area should be restored as soon as possible. The proposed methodology is designed to consider the fast computation time and priority service restoration by dijkstra algorithm and fuzzy theory in large-scale distribution systems. Simulation results demonstrate the validity and effectiveness of the proposed on a 26-bus and 140-bus system.

  • PDF