Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLarge scale simulation of pressure induced phase-field fracture propagation using Utopia
106
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Non-linear phase field models are increasingly used for the simulation of fracture propagation models. The numerical simulation of fracture networks of realistic size requires the efficient parallel solution of large coupled non-linear systems. Although in principle efficient iterative multi-level methods for these types of problems are available, they are not widely used in practice due to the complexity of their parallel implementation. Here, we present Utopia, which is an open-source C++ library for parallel non-linear multilevel solution strategies. Utopia provides the advantages of high-level programming interfaces while at the same time a framework to access low-level data-structures without breaking code encapsulation. Complex numerical procedures can be expressed with few lines of code, and evaluated by different implementations, libraries, or computing hardware. In this paper, we investigate the parallel performance of our implementation of the recursive multilevel trust-region (RMTR) method based on the Utopia library. RMTR is a globally convergent multilevel solution strategy designed to solve non-convex constrained minimization problems. In particular, we solve pressure-induced phase-field fracture propagation in large and complex fracture networks. Solving such problems is deemed challenging even for a few fractures, however, here we are considering networks of realistic size with up to 1000 fractures.
rate research
Read More
An efficient method for the calculation of ferromagnetic resonant modes of magnetic structures is presented. Finite-element discretization allows flexible geometries and location dependent material parameters. The resonant modes can be used for a semi-analytical calculation of the power spectral density of the thermal white-noise, which is relevant for many sensor applications. The proposed method is validated by comparing the noise spectrum of a nano-disk with time-domain simulations.
We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that take advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depend partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations. We develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. In combination, these partitions are several orders of magnitude faster than the mesh-based partition. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.
This paper concerns the analysis and implementation of a novel iterative staggered scheme for quasi-static brittle fracture propagation models, where the fracture evolution is tracked by a phase field variable. The model we consider is a two-field variational inequality system, with the phase field function and the elastic displacements of the solid material as independent variables. Using a penalization strategy, this variational inequality system is transformed into a variational equality system, which is the formulation we take as the starting point for our algorithmic developments. The proposed scheme involves a partitioning of this model into two subproblems; phase field and mechanics, with added stabilization terms to both subproblems for improved efficiency and robustness. We analyze the convergence of the proposed scheme using a fixed point argument, and find that under a natural condition, the elastic mechanical energy remains bounded, and, if the diffusive zone around crack surfaces is sufficiently thick, monotonic convergence is achieved. Finally, the proposed scheme is validated numerically with several bench-mark problems.
Sensitivity analysis plays an important role in searching for constitutive parameters (e.g. permeability) subsurface flow simulations. The mathematics behind is to solve a dynamic constrained optimization problem. Traditional methods like finite difference and forward sensitivity analysis require computational cost that increases linearly with the number of parameters times number of cost functions. Discrete adjoint sensitivity analysis (SA) is gaining popularity due to its computational efficiency. This algorithm requires a forward run followed by a backward run who involves integrating adjoint equation backward in time. This was done by doing one forward solve and store the snapshot by checkpointing. Using the checkpoint data, the adjoint equation is numerically integrated. The computational cost of this algorithm only depends on the number of cost functions and does not depend on the number of parameters. The algorithm is highly powerful when the parameter space is large, and in our case of heterogeneous permeability the number of parameters is proportional to the number of grid cells. The aim of this project is to implement the discrete sensitivity analysis method in parallel to solve realistic subsurface problems. To achieve this goal, we propose to implement the algorithm in parallel using data structures such as TSAdjoint and TAO. This paper dealt with large-scale subsurface flow inversion problem with discrete adjoint method. This method can effectively reduce the computational cost in sensitivity analysis.
The multiscale patch scheme is built from given small micro-scale simulations of complicated physical processes to empower large macro-scale simulations. By coupling small patches of simulations over unsimulated spatial gaps, large savings in computational time are possible. Here we discuss generalising the patch scheme to the case of wave systems on staggered grids in 2D space. Classic macro-scale interpolation provides a generic coupling between patches that achieves arbitrarily high order consistency between the emergent macro-scale simulation and the underlying micro-scale dynamics. Eigen-analysis indicates that the resultant scheme empowers feasible computation of large macro-scale simulations of wave systems even with complicated underlying physics. As examples we use the scheme to simulate some wave scenarios via a turbulent shallow water model.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
