A modified algorithm of linear matching method for limit analysis

被引:0
|
作者
Jun-Hyok Ri
Hyon-Sik Hong
机构
[1] State Academy of Sciences,Institute of Mechanics
来源
关键词
Linear matching method; Elastic compensation method; Limit analysis; Finite element analysis; ANSYS UPF;
D O I
暂无
中图分类号
学科分类号
摘要
Linear matching method has been widely used for the numerical analysis of limit and shakedown. It has been proved theoretically that linear matching method could offer the monotonically reducing sequence of upper bound. Nevertheless, it still remains open whether linear matching method can obtain the conversed and reliable lower bound or not. Thus, an elastic compensation method is used generally for the evaluation of lower bound, but limit analysis using linear matching method and elastic compensation method needs double iterative computations. Moreover, the convergence can be checked only after the computation is finished because linear matching method and elastic compensation method cannot be performed simultaneously. From this, we propose a simple method in order to improve the numerical solution of lower bound by linear matching method. The Young’s modulus varying spatially is determined in every iteration such that not only the stress state lies on the yielding surface but also the strain state does not exceed a certain value of reference strain, leading to the evaluation of lower bound based on the strain state but not the stress one. The proposed method can improve the numerical solution of lower bound by linear matching method without any affection on the upper bound. ANSYS UserMat is used for implementing the current method. The limit analysis is performed like the general elastic finite element analysis in ANSYS. Some numerical examples are considered in order to confirm the effectiveness of proposed approach. Numerical examples showed the validity and improvement of numerical accuracy of our approach. It should be mentioned that our approach can predict the lower bound and upper one simultaneously within the framework of only linear matching method without using the elastic compensation method.
引用
收藏
页码:1399 / 1410
页数:11
相关论文
共 50 条
  • [41] A linear time randomized approximation algorithm for Euclidean matching
    Imanparast, Mandi
    Hashemi, Seyed Naser
    JOURNAL OF SUPERCOMPUTING, 2019, 75 (05): : 2648 - 2664
  • [42] A linear time randomized approximation algorithm for Euclidean matching
    Mahdi Imanparast
    Seyed Naser Hashemi
    The Journal of Supercomputing, 2019, 75 : 2648 - 2664
  • [43] A Stereo Matching Algorithm Guided by Multiple Linear Regression
    Han X.
    Liu Y.
    Yang H.
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2019, 31 (01): : 84 - 93
  • [44] A linear time algorithm for consecutive permutation pattern matching
    Kubica, M.
    Kulczynski, T.
    Radoszewski, J.
    Rytter, W.
    Walen, T.
    INFORMATION PROCESSING LETTERS, 2013, 113 (12) : 430 - 433
  • [45] Modified Matching Pursuit algorithm for application in sleep screening
    Sommermeyer, D.
    Schwaibold, M.
    Schoeller, B.
    Grote, L.
    Hedner, J.
    4TH EUROPEAN CONFERENCE OF THE INTERNATIONAL FEDERATION FOR MEDICAL AND BIOLOGICAL ENGINEERING, 2009, 22 (1-3): : 196 - 199
  • [46] A linear algorithm for exact pattern matching in planar subdivisions
    de Andrade Neto, PR
    Guedes, ALP
    SIBGRAPI 2005: XVIII Brazilian Symposium on Computer Graphics and Image Processing, Conference Proceedings, 2005, : 120 - 127
  • [47] A linear systolic algorithm and architecture for convex bipartite matching
    Ranganathan, N
    Chandra, R
    3RD INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 1996, : 379 - 384
  • [48] A new algorithm for linear regular tree pattern matching
    Shankar, P
    Gantait, A
    Yuvaraj, AR
    Madhavan, M
    THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 125 - 142
  • [49] Analysis of limit forces on the vehicle wheels using an algorithm of Dynamic Square Method
    Brukalski, M.
    SCIENTIFIC CONFERENCE ON AUTOMOTIVE VEHICLES AND COMBUSTION ENGINES (KONMOT 2016), 2016, 148
  • [50] Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method
    Wang, Guangmin
    Jiang, Bing
    Zhu, Kejun
    Wan, Zhongping
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2010, 21 (02) : 239 - 243