• Title/Summary/Keyword: Local Solution

Search Result 1,347, Processing Time 0.03 seconds

A quasistatic crack propagation model allowing for cohesive forces and crack reversibility

  • Philip, Peter
    • Interaction and multiscale mechanics
    • /
    • v.2 no.1
    • /
    • pp.31-44
    • /
    • 2009
  • While the classical theory of Griffith is the foundation of modern understanding of brittle fracture, it has a number of significant shortcomings: Griffith theory does not predict crack initiation and path and it suffers from the presence of unphysical stress singularities. In 1998, Francfort and Marigo presented an energy functional minimization method, where the crack (or its absence) as well as its path are part of the problem's solution. The energy functionals act on spaces of functions of bounded variations, where the cracks are related to the discontinuity sets of such functions. The new model presented here uses modified energy functionals to account for molecular interactions in the vicinity of crack tips, resulting in Barenblatt cohesive forces, such that the model becomes free of stress singularities. This is done in a physically consistent way using recently published concepts of Sinclair. Here, for the consistency of the model, it becomes necessary to allow for crack reversibility and to consider local minimizers of the energy functionals. The latter is achieved by introducing different time scales. The model is solved in its global as well as in its local version for a simple one-dimensional example, showing that local minimization is necessary to yield a physically reasonable result.

A Study on the Solution of Excessive Accelerations on the Bridge for Gyeongbu High-speed Railway (경부고속철도 교량의 과도한 가속도의 저감방안에 대한 연구)

  • Kwark, Jong-Won;Chin, Won-Jong;Choi, Eun-Suk;Cho, Jeong-Rae;Lee, Jung-Woo
    • Proceedings of the KSR Conference
    • /
    • 2007.05a
    • /
    • pp.477-485
    • /
    • 2007
  • When Korean High Speed Train (KTX) runs over a high-speed railway bridge, the high-speed railway bridge gives quite large acceleration response. Local vibration at the large cross section, the impact from equally spaced sleepers, the vibration due to elastomeric bearings, and the vibration from the train itself are the causes of this acceleration response. Maximum peaks of the accelerations measured at the bridges are sometimes going over the limit value. Although it is smaller than 0.35G, the limit from the Korean Bridge Design Manual(BRDM), this acceleration response should be reduced for the safety of running trains with high speed. In this paper, to reduce the acceleration response by controlling excessive local vibration at the large cross section, vibration reduction method is studied. The result shows that the effect of elastomeric bearings on the vibration of the bridge is very large and that the vibration reduction device is effective against wing mode local vibration PSC box girder bridge for the high-speed railway, which usually has very large cross section, although it has little effect on global vibration modes such as flexural and twisting modes. The test of the vibration reduction device on the bridge in service has been performed in this study.

  • PDF

Frost Formation on a Cylinder under Heat Pump Condition (히트펌프 조건의 원형관에서의 착상에 관한 연구)

  • Yoon, Shin-Hyuk;Cho, Keum-Nam;Hayase, Gaku
    • Proceedings of the SAREK Conference
    • /
    • 2009.06a
    • /
    • pp.804-809
    • /
    • 2009
  • The present study measured frost pattern on a cylinder to propose empirical correlation equations for the local and average frost thickness, frost density and frost mass. The key parameters were diameter of the cylinders (7mm, 20mm), cooling surface temperature of the circular tube, absolute humidity of air, air temperature and air velocity. A 50% ethylene glycol aqueous solution was applied as a coolant. The frost thicknesses at both front and rear were larger than those at the other parts, while they were increased as diameter of the cylinder was increased. The local frost thicknesses at high air velocity were more uniform than those at low air velocity. The values predicted by Kim et al. under the freezer condition showed larger by the maximum of $30{\sim}50%$ than the measured data under heat pump condition. The empirical correlations for the local and average frost thickness and frost mass were proposed. The correlation equations for the frost thickness and frost mass under the heat pump condition in the present study might predict more accurate than the other correlation equations. The proposed correlations might be applied for the freezer condition within the maximum 15% deviation from the previous correlations under freezer condition.

  • PDF

A Minimum Expected Length Insertion Algorithm and Grouping Local Search for the Heterogeneous Probabilistic Traveling Salesman Problem (이종 확률적 외판원 문제를 위한 최소 평균거리 삽입 및 집단적 지역 탐색 알고리듬)

  • Kim, Seung-Mo;Choi, Ki-Seok
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.3
    • /
    • pp.114-122
    • /
    • 2010
  • The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.

Improvement on Large-Eddy Simulation Technique of Turbulent Flow (난류유동의 Large-Eddy Simulation 기법의 알고리즘 향상에 관한 연구)

  • 앙경수
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.7
    • /
    • pp.1691-1701
    • /
    • 1995
  • Two aspects of Large-Eddy Simulation(LES) are investigated in order to improve its performance. The first one is on how to determine the model coefficient in conjunction with a dynamic subgrid-scale model, and the second one is on a wall-layer model(WLM) which allows one to skip near-wall regions to save a large number of grid points otherwise required. Especially, a WLM suitable for a separated flow is considered. Firstly, an averaging technique to calculate the model coefficient of dynamic subgrid-scale modeling(DSGSM) is introduced. The technique is based on the concept of local averaging, and useful to stabilize numerical solution in conjunction with LES of complex turbulent flows using DSGSM. It is relatively simple to implement, and takes very low overhead in CPU time. It is also able to detect the region of negative model coefficient where the "backscattering" of turbulence energy occurs. Secondly, a wall-layer model based on a local turbulence intensity is considered. It locally determines wall-shear stresses depending on the local flow situations including separation, and yields better predictions in separated regions than the conventional WLM. The two techniques are tested for a turbulent obstacle flow, and show the direction of further improvements.rovements.

A Probabilistic Filtering Technique for Improving the Efficiency of Local Search (국지적 탐색의 효율향상을 위한 확률적 여과 기법)

  • Kang, Byoung-Ho;Ryu, Kwang-Ryel
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.3
    • /
    • pp.246-254
    • /
    • 2007
  • Local search algorithms start from a certain candidate solution and probe its neighborhood to find ones with improved quality. This paper proposes a method of probabilistically filtering out bad-looking neighbors based on a simple low-cost preliminary evaluation heuristics. The probabilistic filtering enables us to save time wasted on fully evaluating those solutions that will eventually be trashed, and thus improves the search efficiency by allowing us to spend more time on examining better looking solutions. Experiments with two large-scaled real-world problems, which are a traffic signal control problem in traffic network and a load balancing problem in production scheduling, have shown that the proposed method finds better quality solutions, given the same amount of CPU time.

A Study on a New Function Optimization Method Using Probabilistic Tabu Search Strategy (확률적 타부 탐색 전략을 이용한 새로운 함수 최적화 방법에 관한 연구)

  • Kim, Hyung-Su;Hwang, Gi-Hyun;Park, June-Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.11
    • /
    • pp.532-540
    • /
    • 2001
  • In this paper, we propose a probabilistic tabu search strategy for function optimization. It is composed of two procedures, one is Basic search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify search region. In basic search procedure, we use Belief space and Near region to create neighbors. Belief space is made of high-rank neighbors to effectively restrict searching space, so it can improve searching time and local or global searching capability. When a solution is converged in a local area, Restarting procedure works to search other regions. In this time, we use Probabilistic Tabu Strategy(PTS) to adjust parameters such as a reducing rate, initial searching region etc., which makes enhance the performance of searching ability in various problems. In order to show the usefulness of the proposed method, the PTS is applied to the minimization problems such as De Jong functions, Ackley function, and Griewank functions etc., the results are compared with those of GA or EP.

  • PDF

A Study about Additional Reinforcement in Local Updating and Global Updating for Efficient Path Search in Ant Colony System (Ant Colony System에서 효율적 경로 탐색을 위한 지역갱신과 전역갱신에서의 추가 강화에 관한 연구)

  • Lee, Seung-Gwan;Chung, Tae-Choong
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.237-242
    • /
    • 2003
  • Ant Colony System (ACS) Algorithm is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP). In this paper, we introduce ACS of new method that adds reinforcement value for each edge that visit to Local/Global updating rule. and the performance results under various conditions are conducted, and the comparision between the original ACS and the proposed method is shown. It turns out that our proposed method can compete with tile original ACS in terms of solution quality and computation speed to these problem.

Shape optimal design of elastic structures by the domain adaptive method (領域適應法을 利용한 彈性體 形狀의 最適設計)

  • 정균양
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.11 no.2
    • /
    • pp.234-242
    • /
    • 1987
  • The solution of shape design problems based on variational analysis has been approached by using the domain adaptive method. The objective of the structural shape design is to minimize the weight within a bound on local stress measure, or to minimize the maximum local stress measure within a bound on the weight. A derived optimality condition in both design problems requires that the unit mutual energy has constant value along the design boundary. However, the condition for constant stress on the design boundary was used in computation since the computed mutual energy oscillates severely on the boundary. A two step iteration scheme using domain adaptation was presented as a computational method to slove the example designs of elastic structures. It was also shown that remeshing by grid adaptation was effective to reduce oscillatory behavior on the design boundary.

Local Flow Speed Measurement Using Tunable AC Thermal Anemometry

  • Chung Won Seok;Kwon Ohmyoung;Lee Joon Sik;Choi Young Ki;Park Seungho
    • Journal of Mechanical Science and Technology
    • /
    • v.19 no.7
    • /
    • pp.1449-1459
    • /
    • 2005
  • This paper shows the results of local flow speed measurement using tunable AC thermal anemometry, which is suitable for the accurate measurement of wide range flow speed. The measurement accuracy is verified through the comparison between the measurement data and the analytic solution of the sensor temperature oscillation in stationary fluid. The relation between the phase lag and the flow speed is experimentally investigated at various conditions. The measurement sensitivity for low flow speed improves in a low frequency region and that for high flow speed improves in a high frequency region. Also, the sensitivity increases with decreasing thermal conductivity of the surrounding fluid. The local flow speed could be measured as low as 1.5 mm/s and the highest measurement resolution was 0.05 mm/s in the range of 4.5 $\~$5.0 mm/s at 1 Hz in this experiment.