Adaptive finite element mesh triangulation using self-organizing neural networks

被引:9
|
作者
Jilani, H. [2 ]
Bahreininejad, A. [1 ]
Ahmadi, M. T. [2 ]
机构
[1] Tarbiat Modares Univ, Dept Ind Engn, Tehran, Iran
[2] Tarbiat Modares Univ, Dept Civil Engn, Tehran, Iran
关键词
Finite element; Mesh generation; Neural networks; Triangulation; Self-organizing map;
D O I
10.1016/j.advengsoft.2009.06.008
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The finite element method is a computationally intensive method. Effective use of the method requires setting up the computational framework in an appropriate manner, which typically requires expertise. The computational cost of generating the mesh may be much lower, comparable, or in some cases higher than the cost associated with the numeric solver of the partial differential equations, depending on the application and the specific numeric scheme at hand. The aim of this paper is to present a mesh generation approach using the application of self-organizing artificial neural networks through adaptive finite element computations. The problem domain is initially constructed using the self-organizing neural networks. This domain is used as the background mesh which forms the input for finite element analysis and from which adaptive parameters are calculated through adaptivity analysis. Subsequently, self-organizing neural network is used again to adjust the location of randomly selected mesh nodes as is the coordinates of all nodes within a certain neighborhood of the chosen node. The adjustment is a movement of the selected nodes toward a specific input point on the mesh. Thus, based on the results obtained from the adaptivity analysis, the movement of nodal points adjusts the element sizes in a way that the concentration of elements will occur in the regions of high stresses. The methods and experiments developed here are for two-dimensional triangular elements but seem naturally extendible to quadrilateral elements. Crown Copyright (C) 2009 Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:1097 / 1103
页数:7
相关论文
共 50 条
  • [31] Optimization of self-organizing polynomial neural networks
    Maric, Ivan
    EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (11) : 4528 - 4538
  • [32] A study on the self-organizing polynomial neural networks
    Oh, SK
    Ahn, TC
    Pedrycz, W
    JOINT 9TH IFSA WORLD CONGRESS AND 20TH NAFIPS INTERNATIONAL CONFERENCE, PROCEEDINGS, VOLS. 1-5, 2001, : 1690 - 1695
  • [33] Projection learning for self-organizing neural networks
    Potlapalli, H
    Luo, RC
    IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 1996, 43 (04) : 485 - 491
  • [34] Self-organizing neural networks by construction and pruning
    Lee, JS
    Lee, H
    Kim, JY
    Nam, D
    Park, CH
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2004, E87D (11) : 2489 - 2498
  • [35] Crack identification in magnetoelectroelastic materials using neural networks, self-organizing algorithms and boundary element method
    Hattori, Gabriel
    Saez, Andres
    COMPUTERS & STRUCTURES, 2013, 125 : 187 - 199
  • [36] A SELF-ORGANIZING NEURAL NETWORK APPROACH FOR AUTOMATIC MESH GENERATION
    AHN, CH
    LEE, SS
    LEE, HJ
    LEE, SY
    IEEE TRANSACTIONS ON MAGNETICS, 1991, 27 (05) : 4201 - 4204
  • [37] Lithofacies Classification Using the Multilayer Perceptron and the Self-organizing Neural Networks
    Ouadfeul, Sid-Ali
    Aliouane, Leila
    NEURAL INFORMATION PROCESSING, ICONIP 2012, PT V, 2012, 7667 : 737 - 744
  • [38] An analysis of Kansei structure on shoes using self-organizing neural networks
    Ishihara, S
    Ishihara, K
    Nagamachi, M
    Matsubara, Y
    INTERNATIONAL JOURNAL OF INDUSTRIAL ERGONOMICS, 1997, 19 (02) : 93 - 104
  • [39] An analysis of Kansei structure on shoes using self-organizing neural networks
    Onomichi Junior College, 1600 Hisayamada, Onomichi 722, Japan
    不详
    不详
    INT. J. IND. ERGON., 2 (93-104):
  • [40] Identification and classification of GPCR ligands using self-organizing neural networks
    Selzer, P
    Ertl, P
    QSAR & COMBINATORIAL SCIENCE, 2005, 24 (02): : 270 - 276