All issues

We consider an application of the Message Passing Interface (MPI) technology for parallelization of the program code which solves equation of the linear elasticity theory. The solution of this equation describes the propagation of elastic waves in demormable rigid bodies. The solution of such direct problem of seismic wave propagation is of interest in seismics and geophysics. Our implementation of solver uses grid-characteristic method to make simulations. We consider technique to reduce time of communication between MPI processes during the simulation. This is important when it is necessary to conduct modeling in complex problem formulations, and still maintain the high level of parallelism effectiveness, even when thousands of processes are used. A solution of the problem of effective communication is extremely important when several computational grids with arbirtrary geometry of contacts between them are used in the calculation. The complexity of this task increases if an independent distribution of the grid nodes between processes is allowed. In this paper, a generalized approach is developed for processing contact conditions in terms of nodes reinterpolation from a given section of one grid to a certain area of the second grid. An efficient way of parallelization and establishing effective interprocess communications is proposed. For provided example problems we provide wave fileds and seismograms for both 2D and 3D formulations. It is shown that the algorithm can be realized both on Cartesian and on structured (curvilinear) computational grids. The considered statements demonstrate the possibility of carrying out calculations taking into account the surface topographies and curvilinear geometry of curvilinear contacts between the geological layers. Application of curvilinear grids allows to obtain more accurate results than when calculating only using Cartesian grids. The resulting parallelization efficiency is almost 100% up to 4096 processes (we used 128 processes as a basis to find efficiency). With number of processes larger than 4096, an expected gradual decrease in efficiency is observed. The rate of decline is not great, so at 16384 processes the parallelization efficiency remains at 80%.

The paper presents results of numerical modeling of stress-strain state of jack-up rigs used for shelf hydrocarbon reservoirs exploitation. The work studied the equilibrium stress state of a jack-up rig standing on seafloor and mechanical behavior of the rig under seismic loading. Surface elastic wave caused by a distant earthquake acts a reason for the loading. Stability of jack-up rig is the main topic of the research, as stability can be lost due to redistribution of stresses and strains in the elements of the rig due to seismic loading. Modeling results revealed that seismic loading can indeed lead to intermittent growth of stresses in particular elements of the rig’s support legs resulting into stability loss. These results were obtained using the finite element-based numerical scheme. The paper contains the proof of modeling results convergence obtained from analysis of one problem — the problem of stresses and strains distributions for the contact problem of a rigid cylinder indenting on elastic half space. The comparison between numerical and analytical solutions proved the used numerical scheme to be correct, as obtained results converged. The paper presents an analysis of the different factors influencing the mechanical behavior of the studied system. These factors include the degree of seismic loading, mechanical properties of seafloor sediments, and depth of support legs penetration. The results obtained from numerical modeling made it possible to formulate preliminary conclusions regarding the need to take site-specific conditions into account whenever planning the use of jack-up rigs, especially, in the regions with seismic activity. The approach presented in the paper can be used to evaluate risks related to offshore hydrocarbon reservoirs exploitation and development, while the reported numerical scheme can be used to solve some contact problems of theory of elasticity with the need to analyze dynamic processes.

The grid-characteristic method is successfully used for solving hyperbolic systems of partial differential equations (for example, transport / acoustic / elastic equations). It allows to construct correctly algorithms on contact boundaries and boundaries of the integration domain, to a certain extent to take into account the physics of the problem (propagation of discontinuities along characteristic curves), and has the property of monotonicity, which is important for considered problems. In the cases of two-dimensional and three-dimensional problems the method makes use of a coordinate splitting technique, which enables us to solve the original equations by solving several one-dimensional ones consecutively. It is common to use up to 3-rd order one-dimensional schemes with simple splitting techniques which do not allow for the convergence order to be higher than two (with respect to time). Significant achievements in the operator splitting theory were done, the existence of higher-order schemes was proved. Its peculiarity is the need to perform a step in the opposite direction in time, which gives rise to difficulties, for example, for parabolic problems.

In this work coordinate splitting of the 3-rd and 4-th order were used for the two-dimensional hyperbolic problem of the linear elasticity. This made it possible to increase the final convergence order of the computational algorithm. The paper empirically estimates the convergence in L1 and L∞ norms using analytical solutions of the system with the sufficient degree of smoothness. To obtain objective results, we considered the cases of longitudinal and transverse plane waves propagating both along the diagonal of the computational cell and not along it. Numerical experiments demonstrated the improved accuracy and convergence order of constructed schemes. These improvements are achieved with the cost of three- or fourfold increase of the computational time (for the 3-rd and 4-th order respectively) and no additional memory requirements. The proposed improvement of the computational algorithm preserves the simplicity of its parallel implementation based on the spatial decomposition of the computational grid.