Open Access
ARTICLE
G Devaraj1, Shashi Narayan1, Debasish Roy1,2
CMES-Computer Modeling in Engineering & Sciences, Vol.102, No.1, pp. 1-54, 2014, DOI:10.3970/cmes.2014.102.001
Abstract This work sets forth a 'hybrid' discretization scheme utilizing bivariate simplex splines as kernels in a polynomial reproducing scheme constructed over a conventional Finite Element Method (FEM)-like domain discretization based on Delaunay triangulation. Careful construction of the simplex spline knotset ensures the success of the polynomial reproduction procedure at all points in the domain of interest, a significant advancement over its precursor, the DMS-FEM. The shape functions in the proposed method inherit the global continuity (Cp-1) and local supports of the simplex splines of degree p. In the proposed scheme, the triangles comprising the domain discretization also serve as background… More >
Open Access
ARTICLE
Weiwei Zhang1, Yufeng Nie1, Li Cai1, Nan Qi2
CMES-Computer Modeling in Engineering & Sciences, Vol.102, No.1, pp. 55-82, 2014, DOI:10.3970/cmes.2014.102.055
Abstract In this paper, we derive an adaptive mesh generation method for discretizing the incompressible flow using node-based local grids. The flow problem is described by the Stokes equations which are solved by a stabilized low-order P1-P1 (linear velocity, linear pressure) mixed finite element method. The proposed node-based adaptive mesh generation method consists of four components: mesh size modification, a node placement procedure, a node-based local mesh generation strategy and an error estimation technique, which are combined so as to guarantee obtaining a conforming refined/coarsened mesh. The nodes are considered as particles with interaction forces, which are generated by dynamic simulation… More >
Open Access
ARTICLE
T. Ghisu1, B. Arca2, G. Pellizzaro2, P. Duce2
CMES-Computer Modeling in Engineering & Sciences, Vol.102, No.1, pp. 83-102, 2014, DOI:10.3970/cmes.2014.102.083
Abstract Level-set approaches are efficient and versatile methods for solving interface tracking problems and have been used in recent years to describe wildland fire propagation. Being based on an Eulerian description of the spread problem, their numerical implementation offers improved computational agility and better portability to parallel computing environments with respect to vector-based simulators. The use of a continuous representation of the fire perimeter in place of the binary formulation used in Cellular Automata avoids the commonly observed distortion of the fire shape. This work presents an algorithm for fire-spread simulation based on a level-set formulation. The results are compared to… More >
Login
Register
Submit a Paper
Propose a Special lssue