An efficient algorithm for solving spoked wheels

被引：2
|
作者：
Mariappan, DD
Vijay, S
Ramamurti, V [1 ]
机构：
[1] Indian Inst Technol, Dept Appl Mech, Machine Dynam Lab, Madras 600036, Tamil Nadu, India
[2] MIT, Dept Mech Engn, Cambridge, MA 02139 USA
来源：
ADVANCES IN ENGINEERING SOFTWARE | 2003年 / 34卷 / 01期
关键词：
spoked wheels; cyclic symmetry; finite element method; static and dynamic analysis;
D O I：
10.1016/S0965-9978(02)00093-5
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Spoked wheels commonly used in bicycles, mopeds and geared motorcycles are complicated members to analyze, in view of the, number of unknowns associated with the problem, especially when one realizes that the loading on-these wheels is asymmetric. A very elegant algorithm has been proposed in this paper for saving the core and time involved in the computations. Efficacy of the solution has been demonstrated by the results obtained. (C) 2002 Published by Elsevier Science Ltd.
引用
收藏
页码：25 / 30
页数：6
相关论文
共 50 条
  • [41] An efficient algorithm for solving the generalized trust region subproblem
    M. Salahi
    A. Taati
    Computational and Applied Mathematics, 2018, 37 : 395 - 413
  • [42] Efficient algorithm for solving stiff ordinary differential equations
    Stabrowski, M.M.
    Simulation Practice and Theory, 1997, 5 (04): : 333 - 344
  • [43] An efficient algorithm for solving the homogeneous set sandwich problem
    Tang, SM
    Yeh, FL
    Wang, YL
    INFORMATION PROCESSING LETTERS, 2001, 77 (01) : 17 - 22
  • [44] AN EFFICIENT ALGORITHM FOR SOLVING A SPECIAL-CLASS OF LPS
    KERN, W
    COMPUTING, 1986, 37 (03) : 219 - 226
  • [45] A new efficient algorithm for solving the simple temporal problem
    Xu, L
    Choueiry, BY
    TIME-ICTL 2003: 10TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING AND FOURTH INTERNATIONAL CONFERENCE ON TEMPORAL LOGIC, PROCEEDINGS, 2003, : 212 - 222
  • [46] An Efficient Algorithm For Solving Dynamic Complex DCOP Problems
    Khanna, Sankalp
    Sattar, Abdul
    Hansen, David
    Stantic, Bela
    2009 IEEE/WIC/ACM INTERNATIONAL JOINT CONFERENCES ON WEB INTELLIGENCE (WI) AND INTELLIGENT AGENT TECHNOLOGIES (IAT), VOL 2, 2009, : 339 - +
  • [47] An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem
    Takeaki Uno
    Algorithmica, 2010, 56 : 3 - 16
  • [48] An Efficient Evolutionary Algorithm for Solving Incrementally Structured Problems
    Ansel, Jason
    Pacula, Maciej
    Amarasinghe, Saman
    O'Reilly, Una-May
    GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 1699 - 1706
  • [49] An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem
    Uno, Takeaki
    ALGORITHMICA, 2010, 56 (01) : 3 - 16
  • [50] An efficient algorithm for solving the system optimisation problem in transportation
    Han Yun-xiang
    Huang Xiao-qiong
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2020, 51 (05) : 878 - 885
12345