• Title/Summary/Keyword: Point method

Search Result 15,408, Processing Time 0.037 seconds

Warm-Start of Interior Point Methods for Multicommodity Network Flow Problem (다수상품 유통문제를 위한 내부점 방법에서의 Warm-Start)

  • 임성묵;이상욱;박순달
    • Korean Management Science Review
    • /
    • v.21 no.1
    • /
    • pp.77-86
    • /
    • 2004
  • In this paper, we present a methodology for solving the multicommodity network flow problems using interior point methods. In our method, the minimum cost network flow problem extracted from the given multicommodity network flow problem is solved by primal-dual barrier method in which normal equations are solved partially using preconditioned conjugate gradient method. Based on the solution of the minimum cost network flow problem, a warm-start point is obtained from which Castro's specialized interior point method for multicommodity network flow problem starts. In the computational experiments, the effectiveness of our methodology is shown.

THE METHOD OF ASYMPTOTIC INNER BOUNDARY CONDITION FOR SINGULAR PERTURBATION PROBLEMS

  • Andargie, Awoke;Reddy, Y.N.
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.3_4
    • /
    • pp.937-948
    • /
    • 2011
  • The method of Asymptotic Inner Boundary Condition for Singularly Perturbed Two-Point Boundary value Problems is presented. By using a terminal point, the original second order problem is divided in to two problems namely inner region and outer region problems. The original problem is replaced by an asymptotically equivalent first order problem and using the stretching transformation, the asymptotic inner condition in implicit form at the terminal point is determined from the reduced equation of the original second order problem. The modified inner region problem, using the transformation with implicit boundary conditions is solved and produces a condition for the outer region problem. We used Chawla's fourth order method to solve both the inner and outer region problems. The proposed method is iterative on the terminal point. Some numerical examples are solved to demonstrate the applicability of the method.

Fatigue life estimation using the multi-axial multi-point Load Counting method under Variable Amplitude Loading (가변진폭하중에서 다축-다점 하중 Counting method를 이용한 피로수명평가)

  • 이원석;이현우
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.913-920
    • /
    • 1996
  • In this study, the counting method for multi-axial and multi-point load states was proposed. Using this counting method, the load spectrum is generated from the service load history which is measured for boom structure of excavator. Loading state for loading points of boom structure is described as a multi-dimensional state space. From this load spectrum, the stress spectrum was generated by FEM analysis using the superposition of the unit load. The cumulated damage at the severe damage point of In nm structure by the failure example is calculated by Palmgren-Miner's rule. As a result of this study, the fatigue life estimation using the multi-axial and multi-point load counting method is useful.

  • PDF

Generating a Rectangular Net from Unorganized Point Cloud Data Using an Implicit Surface Scheme (음 함수 곡면기법을 이용한 임의의 점 군 데이터로부터의 사각망 생성)

  • Yoo, D.J.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.4
    • /
    • pp.274-282
    • /
    • 2007
  • In this paper, a method of constructing a rectangular net from unorganized point cloud data is presented. In the method an implicit surface that fits the given point data is generated by using principal component analysis(PCA) and adaptive domain decomposition method(ADDM). Then a complete and quality rectangular net can be obtained by extracting voxel data from the implicit surface and projecting exterior faces of extracted voxels onto the implicit surface. The main advantage of the proposed method is that a quality rectangular net can be extracted from randomly scattered 3D points only without any further information. Furthermore the results of this works can be used to obtain many useful information including a slicing data, a solid STL model and a NURBS surface model in many areas involved in treatment of large amount of point data by proper processing of implicit surface and rectangular net generated previously.

Optimum Alignment of Marine Engine Shaftings by the Finite Element Method (有限要素法에 의한 舶用機關軸系裝置의 最適配置에 關한 硏究)

  • Jeon, Hio-Jung;Park, Jin-Gil;Choi, Jae-Sung
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.2 no.1
    • /
    • pp.3-14
    • /
    • 1978
  • The authors have developed a calculating method of propeller shaft alignment by the finite element method. The propeller shaft is divided into finite elements which can be treated as uniform section bars. For each element, the nodal point equation is derived from the stiffness matrix, the external force vector and the section force vector. Then the overall nodal point equation is derived from the element nodal point equation. The deflection, offset, bending moment and shearing force of each nodal point are calculated from the overall nodal point equation by the digital computer. Reactions and deflections of supporting points of straight shaft are calculated and also the reaction influence number is derived. With the reaction influence number the optimum alignment condition that satisfies all conditions is calculated by the simplex method of linear programming. All results of calculation are compared with those of Det norske Veritas, which has developed a computor program based on the three-moment theorem of the strength of materials. The authors finite element method has shown good results and will be used effectively to design the propeller shaft alignment.

  • PDF

FUNCTIONAL ITERATIVE METHODS FOR SOLVING TWO-POINT BOUNDARY VALUE PROBLEMS

  • Lim, Hyo Jin;Kim, Kyoum Sun;Yun, Jae Heon
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.5_6
    • /
    • pp.733-745
    • /
    • 2013
  • In this paper, we first propose a new technique of the functional iterative methods VIM (Variational iteration method) and NHPM (New homotopy perturbation method) for solving two-point boundary value problems, and then we compare their numerical results with those of the finite difference method (FDM).

Development of Radiation Dose Assessment Algorithm for Arbitrary Geometry Radiation Source Based on Point-kernel Method (Point-kernel 방법론 기반 임의 형태 방사선원에 대한 외부피폭 방사선량 평가 알고리즘 개발)

  • Ju Young Kim;Min Seong Kim;Ji Woo Kim;Kwang Pyo Kim
    • Journal of Radiation Industry
    • /
    • v.17 no.3
    • /
    • pp.275-282
    • /
    • 2023
  • Workers in nuclear power plants are likely to be exposed to radiation from various geometrical sources. In order to evaluate the exposure level, the point-kernel method can be utilized. In order to perform a dose assessment based on this method, the radiation source should be divided into point sources, and the number of divisions should be set by the evaluator. However, for the general public, there may be difficulties in selecting the appropriate number of divisions and performing an evaluation. Therefore, the purpose of this study is to develop an algorithm for dose assessment for arbitrary shaped sources based on the point-kernel method. For this purpose, the point-kernel method was analyzed and the main factors for the dose assessment were selected. Subsequently, based on the analyzed methodology, a dose assessment algorithm for arbitrary shaped sources was developed. Lastly, the developed algorithm was verified using Microshield. The dose assessment procedure of the developed algorithm consisted of 1) boundary space setting step, 2) source grid division step, 3) the set of point sources generation step, and 4) dose assessment step. In the boundary space setting step, the boundaries of the space occupied by the sources are set. In the grid division step, the boundary space is divided into several grids. In the set of point sources generation step, the coordinates of the point sources are set by considering the proportion of sources occupying each grid. Finally, in the dose assessment step, the results of the dose assessments for each point source are summed up to derive the dose rate. In order to verify the developed algorithm, the exposure scenario was established based on the standard exposure scenario presented by the American National Standards Institute. The results of the evaluation with the developed algorithm and Microshield were compare. The results of the evaluation with the developed algorithm showed a range of 1.99×10-1~9.74×10-1 μSv hr-1, depending on the distance and the error between the results of the developed algorithm and Microshield was about 0.48~6.93%. The error was attributed to the difference in the number of point sources and point source distribution between the developed algorithm and the Microshield. The results of this study can be utilized for external exposure radiation dose assessments based on the point-kernel method.

Errors in Potentiometric End-Point of Redox Titrations Determined by Zero Second Derivative Method (산화환원 전위차적정에 있어 수치미분법으로 얻은 영 2 차미분 종말점의 오차)

  • Q. Won Choi;Kyong Ryul Kim
    • Journal of the Korean Chemical Society
    • /
    • v.22 no.3
    • /
    • pp.128-132
    • /
    • 1978
  • The potentiometric end-point of redox titrations determined by nulling the second derivative of the titration curve by numerical differentiation method is analyzed by using an electronic digital computer. The error involved in the method is shown to be dependent on the location of the equivalence point in the titrant addition increment that encompasses the latter. The error increases as the equivalence point moves away from the mid-point of the increment toward a maximum value that is as great as a half of the increment. Therefore, when the numerical differentiation method is used to null the second derivative, the end-point should be compared with the steepest point of the titration curve or diluted titrant should be used in the vicinity of the end-point.

  • PDF

Sweet Spot Search of Antenna Beam using the Modified Genetic Algorithm (변형된 유전자 알고리즘을 이용한 안테나 빔의 스위트 스폿 탐색)

  • Eom, Ki-Hwan;Jung, Kyung-Kwon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.6
    • /
    • pp.47-54
    • /
    • 2005
  • In this paper, we propose a method that search the sweet spot of antenna beam, and keep it for fast speed transmission in millimeter wave on point-to-point link. We use TDD(Time Division Duplex) as transfer method, and it transfers the control data of antenna. The proposed method is the modified genetic algorithm which selects a superior initial group through slave-processing in order to resolve the local solution of genetic algorithm. The efficiency of the proposed method is verified by means of simulations with white Gaussian noise and not on point-to-point link.

Palette-based Color Attribute Compression for Point Cloud Data

  • Cui, Li;Jang, Euee S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3108-3120
    • /
    • 2019
  • Point cloud is widely used in 3D applications due to the recent advancement of 3D data acquisition technology. Polygonal mesh-based compression has been dominant since it can replace many points sharing a surface with a set of vertices with mesh structure. Recent point cloud-based applications demand more point-based interactivity, which makes point cloud compression (PCC) becomes more attractive than 3D mesh compression. Interestingly, an exploration activity has been started to explore the feasibility of PCC standard in MPEG. In this paper, a new color attribute compression method is presented for point cloud data. The proposed method utilizes the spatial redundancy among color attribute data to construct a color palette. The color palette is constructed by using K-means clustering method and each color data in point cloud is represented by the index of its similar color in palette. To further improve the compression efficiency, the spatial redundancy between the indices of neighboring colors is also removed by marking them using a flag bit. Experimental results show that the proposed method achieves a better improvement of RD performance compared with that of the MPEG PCC reference software.