The efficiency of the application of the heap lists to the algorithm of mesh generation
Journal Title: Computer Assisted Methods in Engineering and Science - Year 2010, Vol 17, Issue 2
Abstract
The paper presents an analysis of the efficiency of the application of heap lists data structures to the 2D triangular mesh generation algorithms. Such efficiency is especially important for the frontal methods for which the size of the generated mesh is controlled by a prescribed function in the considered domain. In the presented approach two advancing front procedures are presented: first for points insertion and the second for the Delaunay triangulation. If the heap lists are applied to the minimal size of frontal segment selection, a better quality mesh is obtained.
Authors and Affiliations
Jan Kucwaj
Hybrid Monte Carlo method in the reliability analysis of structures
The paper develops the idea of [8], i.e., the application of Artificial Neural Networks (ANNs) in probabilistic reliability analysis of structures achieved by means of Monte Carlo (MC) simulation. In this method, a feed-...
Method of fundamental solutions and random numbers for the torsion of bars with multiply connected cross sections
The torsion of bars with multiply connected cross section by means of the method of fundamental solutions (MFS) is considered. Random numbers were used to determine the minimal errors for MFS. Five cases of cross section...
Soft methods in the prediction and identification analysis of axially compressed R/C columns
Two problems are presented in the paper concerning axial loading of R/C columns: I) prediction of critical loads, II) identification of concrete strength. The problems were analyzed by two methods: A) Gaussian Processes...
Improved two-dimensional cracked finite element for crack fault diagnosis
In this paper the two-dimensional finite element with an embedded edge crack proposed by Potirniche et al. (2008) is improved further for crack depth ratios ranging up to 0.9 and for predicting the natural frequency of a...
On improved evolutionary algorithms application to the physically based approximation of experimental data
In this paper an evolutionary algorithms (EA) application to the physically based approximation (PBA) of experimental and/or numerical data is considered. Such an approximation may simultaneously use the whole experiment...