SUMMARYSeveral performance improvements for finite-element edge-based sparse matrix-vector multiplication algorithms on unstructured grids are presented and tested. Edge data structures for tetrahedral meshes and triangular interface elements are treated, focusing on nodal and edges renumbering strategies for improving processor and memory hierarchy use. Benchmark computations on Intel Itanium 2 and Pentium IV processors are performed. The results show performance improvements in CPU time ranging from 2 to 3.

A parallel edge-based solution of three dimensional viscoplastic flows governed by the steady Navier-Stokes equations is presented. The governing partial differential equations are discretized using the SUPG/PSPG stabilized finite element method on unstructured grids. The highly nonlinear algebraic system arising from the convective and material effects is solved by an inexact Newton-Krylov method. The locally linear Newton equations are solved by GMRES with nodal block diagonal preconditioner. Matrix-vector products within GMRES are computed edge-by-edge (EDE), diminishing flop counts and memory requirements. A comparison between EDE and element-by-element data structures is presented. The parallel computations were based in a message passing interface standard. Performance tests were carried out in representative three dimensional problems, the sudden expansion for power-law fluids and the flow of Bingham fluids in a lid-driven cavity. Results have shown that edge based schemes requires less CPU time and memory than elementbased solutions.

SUMMARYA distance field is a representation of the closest distance from a point to a given surface. Distance fields are widely used in applications ranging from computer vision, physics and computer graphics and have been the subject of research of many authors in the last decade. Most of the methods for computing distance fields are devoted to Cartesian grids while little attention has been paid to unstructured grids. Finite element methods are well known for their ability to deal with partial differential equations in unstructured grids. Therefore, we propose an extension of the fast marching method for computing a distance field in a finite element context employing the element interpolation to hold the Eikonal property ( ∇ = 1). A simple algorithm to develop the computations is also presented and its efficiency demonstrated through various unstructured grid examples. We observed that the presented algorithm has processing times proportional to the number of mesh nodes.

No abstract

No abstract