Arash Mehraban¹, Henry Tufo¹, Stein Sture², Richard Regueiro^2,*

CMES-Computer Modeling in Engineering & Sciences, Vol.129, No.3, pp. 1283-1303, 2021, DOI:10.32604/cmes.2021.017476

Abstract Higher-order displacement-based finite element methods are useful for simulating bending problems and potentially addressing mesh-locking associated with nearly-incompressible elasticity, yet are computationally expensive. To address the computational expense, the paper presents a matrix-free, displacement-based, higher-order, hexahedral finite element implementation of compressible and nearly-compressible (ν → 0.5) linear isotropic elasticity at small strain with p-multigrid preconditioning. The cost, solve time, and scalability of the implementation with respect to strain energy error are investigated for polynomial order p = 1, 2, 3, 4 for compressible elasticity, and p = 2, 3, 4 for nearly-incompressible elasticity, on different number of CPU cores for… More >

Huawen Shu, Minghai Xu, Xinyue Duan^*, Yongtong Li, Yu Sun, Ruitian Li, Peng Ding

CMES-Computer Modeling in Engineering & Sciences, Vol.123, No.2, pp. 509-523, 2020, DOI:10.32604/cmes.2020.08806

Abstract A finite volume method based unstructured grid is presented to solve the two dimensional viscous and incompressible flow. The method is based on the pressure-correction concept and solved by using a semi-staggered grid technique. The computational procedure can handle cells of arbitrary shapes, although solutions presented in this paper were only involved with triangular and quadrilateral cells. The pressure or pressure-correction value was stored on the vertex of cells. The mass conservation equation was discretized on the dual cells surrounding the vertex of primary cells, while the velocity components and other scale variables were saved on the central of primary… More >

A. Rama Mohan Rao¹, T.V.S.R. Appa Rao², B. Dattaguru³

CMES-Computer Modeling in Engineering & Sciences, Vol.5, No.3, pp. 213-234, 2004, DOI:10.3970/cmes.2004.005.213

Abstract This paper presents an algorithm for automatic partitioning of unstructured meshes for parallel finite element computations employing float-encoded genetic algorithms (FEGA). The problem of mesh partitioning is represented in such a way that the number of variables considered in the genome (chromosome) construction is constant irrespective of the size of the problem. In order to accelerate the computational process, several acceleration techniques like constraining the search space, local improvement after initial global partitioning have been attempted. Finally, micro float-encoded genetic algorithms have been developed to accelerate the computational process. More >

O. Hassan¹, K. Morgan, J. Jones, B. Larwood, N. P. Weatherill

CMES-Computer Modeling in Engineering & Sciences, Vol.5, No.5, pp. 383-394, 2004, DOI:10.3970/cmes.2004.005.383

Abstract A numerical procedure for the simulation of 3D problems involving the scattering of electromagnetic waves is presented. As practical problems of interest in this area often involve domains of complex geometrical shape, an unstructured mesh based method is adopted. The solution algorithm employs an explicit finite element procedure for the solution of Maxwell's curl equations in the time domain using unstructured tetrahedral meshes. A PML absorbing layer is added at the artificial far field boundary that is created by the truncation of the physical domain prior to the numerical solution. The complete solution procedure is parallelised and several large scale… More >

M. Dumbser¹, D.S. Balsara²

CMES-Computer Modeling in Engineering & Sciences, Vol.54, No.3, pp. 301-334, 2009, DOI:10.3970/cmes.2009.054.301

Abstract In this article we use the new, unified framework of high order one-step P_NP_M schemes recently proposed for inviscid hyperbolic conservation laws by Dumbser, Balsara, Toro, and Munz (2008) in order to solve the viscous and resistive magnetohydrodynamics (MHD) equations in two and three space dimensions on unstructured triangular and tetrahedral meshes. The P_NP_M framework uses piecewise polynomials of degree N to represent data in each cell and piecewise polynomials of degree M ≥ N to compute the fluxes and source terms. This new general machinery contains usual high order finite volume schemes (N = 0) and discontinuous Galerkin finite… More >