A coupled hydro-mechanical analysis for prediction of hydraulic fracture propagation in saturated porous media using EFG mesh-less method

The details of the Element Free Galerkin (EFG) method are presented with the method being applied to a study on hydraulic fracturing initiation and propagation process in a saturated porous medium using coupled hydro-mechanical numerical modelling. In this EFG method, interpolation (approximation) is based on nodes without using elements and hence an arbitrary discrete fracture path can be modelled.The numerical approach is based upon solving two governing partial differential equations of equilibrium and continuity of pore water simultaneously. Displacement increment and pore water pressure increment are discretized using the same EFG shape functions. An incremental constrained Galerkin weak form is used to create the discrete system of equations and a fully implicit scheme is used for discretization in the time domain. Implementation of essential boundary conditions is based on the penalty method. In order to model discrete fractures, the so-called diffraction method is used.Examples are presented and the results are compared to some closed-form solutions and FEM approximations in order to demonstrate the validity of the developed model and its capabilities. The model is able to take the anisotropy and inhomogeneity of the material into account. The applicability of the model is examined by simulating hydraulic fracture initiation and propagation process from a borehole by injection of fluid. The maximum tensile strength criterion and Mohr-Coulomb shear criterion are used for modelling tensile and shear fracture, respectively. The model successfully simulates the leak-off of fluid from the fracture into the surrounding material. The results indicate the importance of pore fluid pressure in the initiation and propagation pattern of fracture in saturated soils. © 2013 Elsevier Ltd.

A multi-moment finite volume formulation for shallow water equations on unstructured mesh

A novel and accurate finite volume method has been presented to solve the shallow water equations on unstructured grid in plane geometry. In addition to the volume integrated average (VIA moment) for each mesh cell, the point values (PV moment) defined on cell boundary are also treated as the model variables. The volume integrated average is updated via a finite volume formulation, and thus is numerically conserved, while the point value is computed by a point-wise Riemann solver. The cell-wise local interpolation reconstruction is built based on both the VIA and the PV moments, which results in a scheme of almost third order accuracy. Efforts have also been made to formulate the source term of the bottom topography in a way to balance the numerical flux function to satisfy the so-called C-property. The proposed numerical model is validated by numerical tests in comparison with other methods reported in the literature. (C) 2010 Elsevier Inc. All rights reserved.

The use of transvaginal synthetic mesh for anterior vaginal wall prolapse repair: a randomized controlled trial

The aim of the study was to compare the efficacy and safety of transvaginal trocar-guided polypropylene mesh insertion with traditional colporrhaphy for treatment of anterior vaginal wall prolapse.This is a randomized controlled trial in which women with advanced anterior vaginal wall prolapse, at least stage II with Ba a parts per thousand yenaEuro parts per thousand+1 cm according to the Pelvic Organ Prolapse Quantification (POP-Q) classification, were randomly assigned to have either anterior colporrhaphy (n = 39) or repair using trocar-guided transvaginal mesh (n = 40). the primary outcome was objective cure rate of the anterior compartment (point Ba) assessed at the 12-month follow-up visit, with stages 0 and I defined as anatomical success. Secondary outcomes included quantification of other vaginal compartments (POP-Q points), comparison of quality of life by the prolapse quality of life (P-QOL) questionnaire, and complication rate between the groups after 1 year. Study power was fixed as 80 % with 5 % cutoff point (p < 0.05) for statistical significance.The groups were similar regarding demographic and clinical preoperative parameters. Anatomical success rates for colporrhaphy and repair with mesh placement groups were 56.4 vs 82.5 % (95 % confidence interval 0.068-0.54), respectively, and the difference between the groups was statistically significant (p = 0.018). Similar total complication rates were observed in both groups, with tape exposure observed in 5 % of the patients. There was a significant improvement in all P-QOL domains as a result of both procedures (p < 0.001), but they were not distinct between groups (p > 0.05).Trocar-guided transvaginal synthetic mesh for advanced anterior POP repair is associated with a higher anatomical success rate for the anterior compartment compared with traditional colporrhaphy. Quality of life equally improved after both techniques. However, the trial failed to detect differences in P-QOL scores and complication rates between the groups.

Stochastic Mesh-Based Multiview Reconstruction

A method for reconstruction of 3D polygonal models from multiple views is presented. The method uses sampling techniques to construct a texture-mapped semi-regular polygonal mesh of the object in question. Given a set of views and segmentation of the object in each view, constructive solid geometry is used to build a visual hull from silhouette prisms. The resulting polygonal mesh is simplified and subdivided to produce a semi-regular mesh. Regions of model fit inaccuracy are found by projecting the reference images onto the mesh from different views. The resulting error images for each view are used to compute a probability density function, and several points are sampled from it. Along the epipolar lines corresponding to these sampled points, photometric consistency is evaluated. The mesh surface is then pulled towards the regions of higher photometric consistency using free-form deformations. This sampling-based approach produces a photometrically consistent solution in much less time than possible with previous multi-view algorithms given arbitrary camera placement.

Computer aided parallelisation tools (CAPTools) — conceptual overview and performance on the parallelisation of structured mesh codes

Computer Aided Parallelisation Tools (CAPTools) is a toolkit designed to automate as much as possible of the process of parallelising scalar FORTRAN 77 codes. The toolkit combines a very powerful dependence analysis together with user supplied knowledge to build an extremely comprehensive and accurate dependence graph. The initial version has been targeted at structured mesh computational mechanics codes (eg. heat transfer, Computational Fluid Dynamics (CFD)) and the associated simple mesh decomposition paradigm is utilised in the automatic code partition, execution control mask generation and communication call insertion. In this, the first of a series of papers [1–3] the authors discuss the parallelisations of a number of case study codes showing how the various component tools may be used to develop a highly efficient parallel implementation in a few hours or days. The details of the parallelisation of the TEAMKE1 CFD code are described together with the results of three other numerical codes. The resulting parallel implementations are then tested on workstation clusters using PVM and an i860-based parallel system showing efficiencies well over 80%.

Three-dimensional free surface modelling in an unstructured mesh environment for metal processing applications

In the casting of metals, tundish flow, welding, converters, and other metal processing applications, the behaviour of the fluid surface is important. In aluminium alloys, for example, oxides formed on the surface may be drawn into the body of the melt where they act as faults in the solidified product affecting cast quality. For this reason, accurate description of wave behaviour, air entrapment, and other effects need to be modelled, in the presence of heat transfer and possibly phase change. The authors have developed a single-phase algorithm for modelling this problem. The Scalar Equation Algorithm (SEA) (see Refs. 1 and 2), enables the transport of the property discontinuity representing the free surface through a fixed grid. An extension of this method to unstructured mesh codes is presented here, together with validation. The new method employs a TVD flux limiter in conjunction with a ray-tracing algorithm, to ensure a sharp bound interface. Applications of the method are in the filling and emptying of mould cavities, with heat transfer and phase change.

Converting best manual practice into generic automatable strategies for unstructured mesh parallelisation

The manual effort required to convert sequential computational mechanics programs into a useful, scalable parallel form is considerable. Tools that can assist in the conversion process are clearly required. Computer aided parallelisation tools (CAPTools) have been developed to generate efficient parallel code for real world structured grid application codes such as Computational Fluid Dynamics. Automatable single-program multi-data (SPMD) overlapping domain decomposition (DD) techniques established for structured grid codes have been adapted by the authors to manually parallelise unstructured mesh applications. Inspector loops have been used to provide generic techniques for the run-time support necessary to extend the capabilities of CAPTools to automatic implementation of SPMD DD techniques in the parallelisation of unstructured mesh codes. Copyright © 1999 John Wiley & Sons, Ltd.

Multilevel mesh partitioning for optimizing domain shape

Multilevel algorithms are a successful class of optimization techniques that address the mesh partitioning problem for mapping meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimization method that refines the partition at each graph level. To date, these algorithms have been used almost exclusively to minimize the cut-edge weight in the graph with the aim of minimizing the parallel communication overhead. However, it has been shown that for certain classes of problems, the convergence of the underlying solution algorithm is strongly influenced by the shape or aspect ratio of the subdomains. Therefore, in this paper, the authors modify the multilevel algorithms to optimize a cost function based on the aspect ratio. Several variants of the algorithms are tested and shown to provide excellent results.

Staggered-mesh computation for aerodynamic sound

For the numerical solution of the linearized Euler equations, an optimized computational scheme is considered. It is based on fully staggered (in space and time) regular meshes and on a simple mirroring procedure at the stepwise solid walls. There is no need to define ghost points into the solid ohjects that reflect the sound waves. Test results demonstrate the accuracy of the method that may be used for aeroacoustic problems with complex geometries.

A scalable strategy for the parallelization of multiphysics unstructured mesh-iterative codes on distributed-memory systems

Realizing scalable performance on high performance computing systems is not straightforward for single-phenomenon codes (such as computational fluid dynamics [CFD]). This task is magnified considerably when the target software involves the interactions of a range of phenomena that have distinctive solution procedures involving different discretization methods. The problems of addressing the key issues of retaining data integrity and the ordering of the calculation procedures are significant. A strategy for parallelizing this multiphysics family of codes is described for software exploiting finite-volume discretization methods on unstructured meshes using iterative solution procedures. A mesh partitioning-based SPMD approach is used. However, since different variables use distinct discretization schemes, this means that distinct partitions are required; techniques for addressing this issue are described using the mesh-partitioning tool, JOSTLE. In this contribution, the strategy is tested for a variety of test cases under a wide range of conditions (e.g., problem size, number of processors, asynchronous / synchronous communications, etc.) using a variety of strategies for mapping the mesh partition onto the processor topology.

An automatable generic strategy for dynamic load balancing in parallel structured mesh CFD codes

Parallel computing is now widely used in numerical simulation, particularly for application codes based on finite difference and finite element methods. A popular and successful technique employed to parallelize such codes onto large distributed memory systems is to partition the mesh into sub-domains that are then allocated to processors. The code then executes in parallel, using the SPMD methodology, with message passing for inter-processor interactions. In order to improve the parallel efficiency of an imbalanced structured mesh CFD code, a new dynamic load balancing (DLB) strategy has been developed in which the processor partition range limits of just one of the partitioned dimensions uses non-coincidental limits, as opposed to coincidental limits. The ‘local’ partition limit change allows greater flexibility in obtaining a balanced load distribution, as the workload increase, or decrease, on a processor is no longer restricted by the ‘global’ (coincidental) limit change. The automatic implementation of this generic DLB strategy within an existing parallel code is presented in this chapter, along with some preliminary results.

Automatic and effective multi-dimensional parallelisation of structured mesh based codes

The most common parallelisation strategy for many Computational Mechanics (CM) (typified by Computational Fluid Dynamics (CFD) applications) which use structured meshes, involves a 1D partition based upon slabs of cells. However, many CFD codes employ pipeline operations in their solution procedure. For parallelised versions of such codes to scale well they must employ two (or more) dimensional partitions. This paper describes an algorithmic approach to the multi-dimensional mesh partitioning in code parallelisation, its implementation in a toolkit for almost automatically transforming scalar codes to parallel form, and its testing on a range of ‘real-world’ FORTRAN codes. The concept of multi-dimensional partitioning is straightforward, but non-trivial to represent as a sufficiently generic algorithm so that it can be embedded in a code transformation tool. The results of the tests on fine real-world codes demonstrate clear improvements in parallel performance and scalability (over a 1D partition). This is matched by a huge reduction in the time required to develop the parallel versions when hand coded – from weeks/months down to hours/days.

Multilevel mesh partitioning for optimising aspect ratio

Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cut-edge weight, however it has been shown that for certain classes of solution algorithm, the convergence of the solver is strongly influenced by the subdomain aspect ratio. In this paper therefore, we modify the multilevel algorithms in order to optimise a cost function based on aspect ratio. Several variants of the algorithms are tested and shown to provide excellent results.