numerical analyses have shown that successful flow simulations and the accuracy of solution noticeably depend on the number of nodes used in computational meshing. a suitable meshing should have the capability of adapting with main flow parameters. because the number of total nodes that can be used in numerical simulation is limited, making such grid for complex flows is almost difficult, if it...

it is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. in this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. the non-uniform mesh is generated adaptively based on advancing front technique available in abaqus software. implementing severa...

some numerical and experimental investigations are made on the performance of five different hyperelastic constitutive models (second order polynomial, yeoh, arruda-boyce, ogden and marlow) in tension and compressionmodes. first, the results of the tensile and compression tests on a rubber sample were used to determine the parameters of the models by curve fitting methods. next, by using an alg...

Efficient and accurate space-charge computations are essential for the design of high-brightness charged particle sources. Recently a new adaptive meshing strategy based on multigrid was implemented in GPT and the capabilities were demonstrated. This new meshing scheme uses the solution of an intermediate step in the multigrid algorithm itself to define optimal mesh line positions. In this pape...

We describe a domain decomposition (DD) algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst [3, 4]. Our algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure.

We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst. Our algorithm has low communication , makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. In [4, 5], we introduced a gene...

We explore the current capabilities of the recently released Myricom X2OOO witch, using MPICH over the GM communication layer; for message passing on a 2-way SMP Pentium III Beawulf-Class cluster: Performance measurements on the network indicate that data transfer rates of appmximatety 190 Mbyteds for ping-pong tests, and 24OMbyteds forfill-duplex exchange tests, can be achieved for messages as...

Many numerical solutions of large scale simulation models require finer discretizations in some regions of the computational grid. When this region is not known in advance, adaptive meshing is the most convenient approach because it focuses the computational efforts on the most significant subdomain(s). However, leaving the tasks of implementing adaptive meshing capabilities to the programmer w...