Search results

1) The OE-MLPG penalty meshfree method is developed to solve cracked structure.(2) Smartening the numerical meshfree method by combining the particle swarm optimization (PSO) optimization algorithms and Voronoi computational geometric algorithm. (3). Selection of base functions, finding optimal penalty factor and distribution of appropriate nodal points to the accuracy of calculation in the meshless local Petrov–Galekrin (MLPG) meshless method.

Using appropriate shape functions and distribution of nodal points in local domains and sub-domains and choosing an approximation or interpolation method has an effective role in the application of meshless methods for the analysis of computational fracture mechanics problems, especially problems with geometric discontinuity and cracks. In this research, computational geometry technique, based on the Voronoi diagram (VD) and Delaunay triangulation and PSO algorithm, are used to distribute nodal points in the sub-domain of analysis (crack line and around it on the crack plane).

By doing this process, the problems caused by too closeness of nodal points in computationally sensitive areas that exist in general methods of nodal point distribution are also solved. Comparing the effect of the number of sentences of basic functions and their order in the definition of shape functions, performing the mono-objective PSO algorithm to find the penalty factor, the coefficient, convergence, arrangement of nodal points during the three stages of VD implementation and the accuracy of the answers found indicates, the efficiency of V-E-MLPG method with Ns = 7 and ß = 0.0037–0.0075 to estimation of 3D-stress intensity factors (3D-SIFs) in computational fracture mechanics.

The present manuscript is a continuation of the studies (Ref. [33]) carried out by the authors, about; feasibility assessment, improvement and solution of challenges, introduction of more capacities and capabilities of the numerical MLPG method have been used. In order to validate the modeling and accuracy of calculations, the results have been compared with the findings of reference article [34] and [35].

The purpose of this paper is to assess the performance of the stabilised moving least squares (MLS) scheme in the meshless local Petrov–Galerkin (MLPG) method for heat conduction method.

In the current work, the authors extend the stabilised MLS approach to the MLPG method for heat conduction problem. Its performance has been compared with the MLPG method based on the standard MLS and local coordinate MLS. The patch tests of MLS and modified MLS schemes have been presented along with the one- and two-dimensional examples for MLPG method of the heat conduction problem.

In the stabilised MLS, the condition number of moment matrix is independent of the nodal spacing and it is nearly constant in the global domain for all grid sizes. The shifted polynomials based MLS and stabilised MLS approaches are more robust than the standard MLS scheme in the MLPG method analysis of heat conduction problems.

The MLPG method based on the stabilised MLS scheme.

In this study, the stationary flow of a polymeric fluid governed by the upper convected Maxwell law is computed in a 2‐D convergent geometry. A finite element method is used to obtain non‐linear discretized equations, solved by an iterative Picard (fixed point) algorithm. At each step, two sub‐systems are successively solved. The first one represents a Newtonian fluid flow (Stokes equations) perturbed by known pseudo‐body forces expressing fluid elasticity. It is solved by minimization of a functional of the velocity field, while the pressure is eliminated by penalization. The second sub‐system reduces to the tensorial differential evolution equation of the extra‐stress tensor for a given velocity field. It is solved by the so‐called ‘non‐consistent Petrov‐Galerkin streamline upwind’ method. As with other decoupled techniques applied to this problem, our simulation fails for relatively low values of the Weissenberg viscoelastic number. The value of the numerical limit point depends on the mesh refinement. When convergence is reached, the numerical solutions for velocity, pressure and stress fields are similar to those obtained by other authors with very costly mixed methods.

This paper aims to present a computationally efficient finite element model for the simulation of isothermal immiscible two-phase flow in a rigid porous media with a particular application to CO₂ sequestration in underground formations. Focus is placed on developing a numerical procedure, which is effectively mesh-independent and suitable to problems at regional scales.

The averaging theory is utilized to describe the governing equations of the involved unsaturated multiphase flow. The level-set (LS) method and the extended finite element method (XFEM) are utilized to simulate flow of the CO₂ plume. The LS is employed to trace the plume front. A streamline upwind Petrov-Galerkin method is adopted to stabilize possible occurrence of spurious oscillations due to advection. The XFEM is utilized to model the high gradient in the saturation field front, where the LS function is used for enhancing the weighting and the shape functions.

The capability of the proposed model and its features are evaluated by numerical examples, demonstrating its accuracy, stability and convergence, as well as its advantages over standard and upwind techniques. The study showed that a good combination between a mathematical model and a numerical model enables the simulation of complicated processes occurring in complicated and large geometry using minimal computational efforts.

A new computational model for two-phase flow in porous media is introduced with basic requirements for accuracy, stability, and convergence, which are met using relatively coarse meshes.

Finite element discretizations of low‐frequency, time‐harmonic magnetic problems lead to sparse, complex symmetric systems of linear equations. The question arises which Krylov subspace methods are appropriate to solve such systems. The quasi minimal residual method combines a constant amount of work and storage per iteration step with a smooth convergence history. These advantages are obtained by building a quasi minimal residual approach on top of a Lanczos process to construct the search space. Solving the complex systems by transforming them to equivalent real ones of double dimension has to be avoided as such real systems have spectra that are less favourable for the convergence of Krylov‐based methods. Numerical experiments are performed on electromagnetic engineering problems to compare the quasi minimal residual method to the bi‐conjugate gradient method and the generalized minimal residual method.

The purpose of this study is to investigate the accuracy and applicability of the Flowfield Dependent Variation (FDV) method for large-eddy simulations (LES) of decaying isotropic turbulence.

In an earlier paper, the FDV method was successfully demonstrated for simulations of laminar flows with speeds varying from low subsonic to high supersonic Mach numbers. In the current study, the FDV method, implemented in a finite element framework, is used to perform LESs of decaying isotropic turbulence. The FDV method is fundamentally derived from the Lax–Wendroff Scheme (LWS) by replacing the explicit time derivatives in LWS with a weighted combination of explicit and implicit time derivatives. The increased implicitness and the inherent numerical dissipation of FDV contribute to the scheme’s numerical stability and monotonicity. Understanding the role of numerical dissipation that is inherent to the FDV method is essential for the maturation of FDV into a robust scheme for LES of turbulent flows. Accordingly, three types of LES of decaying isotropic turbulence were performed. The first two types of LES utilized explicit subgrid scale (SGS) models, namely, the constant-coefficient Smagorinsky and dynamic Smagorinsky models. In the third, no explicit SGS model was employed; instead, the numerical dissipation inherent to FDV was used to emulate the role played by explicit SGS models. Such an approach is commonly known as Implicit LES (ILES). A new formulation was also developed for quantifying the FDV numerical viscosity that principally arises from the convective terms of the filtered Navier–Stokes equations.

The temporal variation of the turbulent kinetic energy and enstrophy and the energy spectra are presented and analyzed. At all grid resolutions, the temporal profiles of kinetic energy showed good agreement with t^(−1.43) theoretical scaling in the fully developed turbulent flow regime, where t represents time. The energy spectra also showed reasonable agreement with the Kolmogorov’s k^(−5/3) power law in the inertial subrange, with the spectra moving closer to the Kolmogorov scaling at higher-grid resolutions. The intrinsic numerical viscosity and the dissipation rate of the FDV scheme are quantified, both in physical and spectral spaces, and compared with those of the two SGS LES runs. Furthermore, at a finite number of flow realizations, the numerical viscosities of FDV and of the Streamline Upwind/Petrov–Galerkin (SUPG) finite element method are compared. In the initial stages of turbulence development, all three LES cases have similar viscosities. But, once the turbulence is fully developed, implicit LES is less dissipative compared to the two SGS LES runs. It was also observed that the SUPG method is significantly more dissipative than the three LES approaches.

Just as any computational method, the limitations are based on the available computational resources.

Solving problems involving turbulent flows is by far the biggest challenge facing engineers and scientists in the twenty-first century, this is the road that the authors have embarked upon in this paper and the road ahead of is very long.

Understanding turbulence is a very lofty goal and a challenging one as well; however, if the authors succeed, the rewards are limitless.

The derivation of an explicit expression for the numerical viscosity tensor of FDV is an important contribution of this study, and is a crucial step forward in elucidating the fundamental properties of the FDV method. The comparison of viscosities for the three LES cases and the SUPG method has important implications for the application of ILES approach for turbulent flow simulations.

The purpose of this study is to propose an isogeometric analysis (IGA) approach for solving the Reynolds equation in textured piston ring cylinder liner (PRCL) contacts.

The texture region is accurately and conveniently expressed by non-uniform rational B-splines (NURBS) besides hydrodynamic pressure and the oil film density ratio is represented in this mathematical form. A quadratic programming method combined with a Lagrange multiplier method is developed to address the cavitation issue.

The comparison with the results solved by an analytical method has verified the effectiveness of the proposed approach. In the study of the PRCL contact with two-dimensional circular dimple textures, the solution of the IGA approach shows high smoothness and accuracy, and it well satisfies the complementarity condition in the case of cavitation presence.

This paper proposes an IGA approach for solving the Reynolds equation in textured PRCL contacts. Its novelty is reflected in three aspects. First, NURBS functions are simultaneously used to express the solution domain, texture shape, hydrodynamic pressure and oil density ratio. Second, the streamline upwind/Petrov–Galerkin method is adopted to create a weak form for the Reynolds equation that takes the oil density ratio as a first-order unknown variable. Third, a quadratic programming approach is developed to impose the complementarity conditions between the hydrodynamic pressure and the oil density ratio.

A class of exact solutions to the elastohydrodynamic problem to be used as test cases is presented. A numerical solution to the elastohydrodynamic problem according to the Petrov—Galerkin method is developed. The appearance of spurious numerical undulations in the film profile is examined. A comparison between analytical and numerical results is employed to determine which numerical schemes limit the outcome of numerical oscillations without compromising the solution accuracy.

In the present work, we focus on developing an in-house parallel meshless local Petrov-Galerkin (MLPG) code for the analysis of heat conduction in two-dimensional and three-dimensional regular as well as complex geometries.

The parallel MLPG code has been implemented using open multi-processing (OpenMP) application programming interface (API) on the shared memory multicore CPU architecture. Numerical simulations have been performed to find the critical regions of the serial code, and an OpenMP-based parallel MLPG code is developed, considering the critical regions of the sequential code.

Based on performance parameters such as speed-up and parallel efficiency, the credibility of the parallelization procedure has been established. Maximum speed-up and parallel efficiency are 10.94 and 0.92 for regular three-dimensional geometry (343,000 nodes). Results demonstrate the suitability of parallelization for larger nodes as parallel efficiency and speed-up are more for the larger nodes.

Few attempts have been made in parallel implementation of the MLPG method for solving large-scale industrial problems. Although the literature suggests that message-passing interface (MPI) based parallel MLPG codes have been developed, the OpenMP model has rarely been touched. This work is an attempt at the development of OpenMP-based parallel MLPG code for the very first time.

A boundary element method (BEM) formulation for the solution of transient conduction‐convection problems is developed in this paper. A time‐dependent fundamental solution for moving heat source problems is utilized for this purpose. This reduces the governing parabolic partial differential equations to a boundary‐only form and obviates the need for any internal discretization. Such a formulation is also expected to be stable at high Peclet numbers. Numerical examples are included to establish the validity of the approach and to demonstrate the salient features of the BEM algorithm.