Search

This paper proposes an iteration-based algorithm for the optimum design of a high frequency transformer for solid-state transformer (SST) applications. This algorithm minimizes the total owning cost (TOC) of a distribution type solid-state transformer. The unique features of this algorithm compared with the available algorithms in the literature are as follows: it iterates eight design variables, four constraints are defined for selecting the valid designs, and it works with different core materials and AC test voltages. The algorithm uses various user-defined data inputs to calculate loss capitalization values for TOC calculation. In every iteration, TOC is estimated, and calculated values of design constraints are compared with their threshold limits. A case study is conducted on a high-frequency transformer (HFT) incorporated in 1000-kVA, 11-kV/415-V, Dyn11 three-phase wound core SST. This is to determine the optimum design parameters. In this case study, the algorithm was iterated with 2,100,000 design data inputs, generating 258,272 designs that satisfied all design constraints. The optimum design with minimum TOC is selected from the generated 258,272 designs. The optimum design is validated using finite element analysis in ANSYS software. Comparing the results of both analyses, the deviation is less than 5%. Hence, the algorithm's reliability is proved. [ABSTRACT FROM AUTHOR]

The generalized Schwarz algorithm for a class of elliptic quasi-variational inequalities related to impulse control problems is studied in this paper. The principal result is to prove the error estimate in L ∞ -norm for m subdomains with overlapping nonmatching grids. This approach combines the geometrical convergence and the uniform convergence. [ABSTRACT FROM AUTHOR]

This paper which depended on the foundation of back strip method has established mathematic model to simulate stratum burial history, which considered the computation of stratum skeleton depth based on max depth and the equation-depth point on the procedure to recover stratum by stripping each layer, and put forward the enhanced restoration method taking layers group as studying object. Finally, the method has been applied to build the computer model and program automatic back strip algorithm successfully. Experiments have proved that the method is accurate, applicable, and extensible under the conditions of various complex strata. [ABSTRACT FROM AUTHOR]

Abstract  The models for finite element analysis usually have a number of complex geometric features such as holes, slots, and curved surfaces, etc. The exact description of these features is crucial to the accuracy of finite element analysis. This paper presents an algorithm for the adaptive generation of the initial hexahedral element mesh based on the geometric features of the solid model. This algorithm is a modified grid-based method, in which a new geometry-adaptive hexahedral mesh generation method and a new mesh boundary matching method called threading method are established and employed. Firstly, an initial grid structure, which is uniformly sized or locally refined and encompasses the solid model completely, is generated based on the geometric features of the solid model. Then, an initial indention mesh is generated after removing all the elements in the exterior of the solid model using the even-odd rule. The surface of the indention mesh, which is adaptively generated based on the geometric features, is so complicated and different in size that the match of the edges and surface to the surface of the solid model becomes inconvenient. In this case, the closest position tracing approach used widely is difficult to realize an accurate match. The threading method proposed in this paper can accurately match the boundaries of the indention mesh to the boundaries of the solid model. Especially, it is fit for the generation of the geometry-adaptive mesh and avoids the recurrent search process of characteristic boundary nodes in the closest position tracing method. So the efficiency of the finite element mesh generation is enhanced remarkably. The principles and procedures of the algorithm are illustrated through the geometry-adaptive hexahedral mesh generation of a typical three-dimensional solid model. The effectiveness and robustness of the algorithm are tested by several applications in the complex solid models. [ABSTRACT FROM AUTHOR]

In this paper, a second-order hyperbolic equation is solved by a two-grid algorithm combined with the expanded mixed finite element method. The error estimate of the expanded mixed finite element method with discrete-time scheme is demonstrated. Moreover, we present a two-grid method and analyze its convergence. It is shown that the algorithm can achieve asymptotically optimal approximation as long as the mesh sizes satisfy H = O (h 1 2) . Finally, some numerical experiments are provided to illustrate the efficiency and accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

Thermal deformation is one of the principal factors that influence the machining accuracy of machine tools, and it can be improved by thermal error compensation. This paper presents a method of thermal error modeling using multisource information fusion, which can further improve the thermal error compensation accuracy. To set up a fusion model with optimal performance, two or more thermal error models should be established, from which a few models should be chosen to complement each other, and then combined into a synthesis model. In this paper, a dynamic thermal error model and a finite element model are combined to build a fusion model for lathe z-direction thermal error according to a fusion algorithm. The inputs for the fusion model are the values detected by the thermal sensors and the infrared imaging. An experiment carried out on a lathe verifies the validity of this modeling method. The results show that the multisource fusion model of thermal error can not only improve the prediction accuracy of thermal error over that of a single model, but also possesses better robustness. [ABSTRACT FROM AUTHOR]

In the current study, the problems of elastic and elastoplastic torsion were formulated by finite element method. The finite element code was parallelized on both shared and distributed memory architectures. An assembling method with high parallelism ability and consuming minimum memory was proposed to obtain compressed global stiffness matrix directly. Parallel programming principles were expressed in two shared memory and distributed memory approaches; moreover, parallel well-known mathematical libraries were briefly expressed. In this paper, the main focus was on a lucid explanation of parallelization mechanisms in detail on two memory architectures such as some settings of Linux operating system for large-scale problems. To verify the ability of the proposed method and its parallel performance, several benchmark examples were represented with different mesh sizes and were compared with their respective analytical solutions. Considering the obtained results, the proposed sparse assembling algorithm decreased required memory significantly (about 103.5 to 105.5 times) and the obtained speedup was about 3.4 for the elastoplastic torsion problem in a simple multicore computer. [ABSTRACT FROM AUTHOR]

The element energy projection (EEP) method for computation of superconvergent resulting in a one-dimensional finite element method (FEM) is successfully used to self-adaptive FEM analysis of various linear problems, based on which this paper presents a substantial extension of the whole set of technology to nonlinear problems. The main idea behind the technology transfer from linear analysis to nonlinear analysis is to use Newton's method to linearize nonlinear problems into a series of linear problems so that the EEP formulation and the corresponding adaptive strategy can be directly used without the need for specific super-convergence formulation for nonlinear FEM. As a result, a unified and general self-adaptive algorithm for nonlinear FEM analysis is formed. The proposed algorithm is found to be able to produce satisfactory finite element results with accuracy satisfying the user-preset error tolerances by maximum norm anywhere on the mesh. Taking the nonlinear ordinary differential equation of second-order as the model problem, this paper describes the related fundamental idea, the implementation strategy, and the computational algorithm. Representative numerical examples are given to show the efficiency, stability, versatility, and reliability of the proposed approach. [ABSTRACT FROM AUTHOR]

In the present paper, a recent deterministic continuum-strategy two-player discrete-time dynamic leader-follower game with fixed finite time duration and closed-loop information structure is studied. The types of the considered payoff functions can be widely used in different applications (mainly in conflicts of consuming a limited resource, where one player, called the leader, is a superior authority choosing a strategy choice first, and another player, called the follower, chooses after). In case of certain payoff convexity, explicit conditions are given, when it can be known in advance that an equilibrium exists and consists of only two possible choices of both players at each step. The sub-game equilibrium from a given step may depend on the former selections of the players. Thus the continuum-strategy problem has been reduced to a general finite game of two possible choices corresponding to both players. Such type of games could be solved in a standard way with dynamic programming using a computer. Nevertheless, the game can be further simplified, and then an equilibrium can be directly determined, such decreasing the computational demand to a great extent. A solution algorithm and practical examples are also given to support the real-life application of the results. [ABSTRACT FROM AUTHOR]

Rapid prototyping technology makes the manufacturing of functionally graded material (FGM) objects possible. The FGM production process requires concurrent applications of digital design and manufacturing methods. For this reason, it is imperative to construct and capture information and other critical data regarding the geometry and materials about FGM objects for use in the manufacturing process. This paper proposes a simplex-clear data format for modeling FGM objects. This proposed data format captures both the geometry and material information of an FGM object. It also presents a finite element-based slicing algorithm which slices the FGM object into layers and captures each layer's information for rapid prototyping manufacturing of the object. An example is given at the end of the paper to validate the data format and demonstrate the adaptive slicing algorithm. [ABSTRACT FROM AUTHOR]

Analysis of transverse vibration of the gear found in a high-speed gearbox considered as an annular plate reflecting gear geometry is the subject of this paper. How gear angular velocity affects the deformation of normal modes of transverse vibration of the system under consideration is analysed. Models considered were discretized by the finite elements method. Numerical computations have been performed in the ANSYS environment. The algorithm to identify the proper distorted mode shapes is presented. The Campbell diagram for the system under consideration is elaborated. The problems discussed here can be useful for engineers dealing with dynamics of rotating machine systems. [ABSTRACT FROM AUTHOR]

Abstract  This paper presents a new mesh optimization approach aiming to improve the mesh quality on the boundary. The existing mesh untangling and smoothing algorithms (Vachal et al. in J Comput Phys 196: 627–644, 2004; Knupp in J Numer Methods Eng 48: 1165–1185, 2002), which have been proved to work well to interior mesh optimization, are enhanced by adding constrains of surface and curve shape functions that approximate the boundary geometry from the finite element mesh. The enhanced constrained optimization guarantees that the boundary nodes to be optimized always move on the approximated boundary. A dual-grid hexahedral meshing method is used to generate sample meshes for testing the proposed mesh optimization approach. As complementary treatments to the mesh optimization, appropriate mesh topology modifications, including buffering element insertion and local mesh refinement, are performed in order to eliminate concave and distorted elements on the boundary. Finally, the optimization results of some examples are given to demonstrate the effectivity of the proposed approach. [ABSTRACT FROM AUTHOR]

Abstract  The existence of holes in meshes makes it difficult for mesh operations, especially when comes to model rebuilding, rapid prototyping and finite element analysis. Existing hole-filling algorithms are capable of filling holes on small and smooth regions of a model. For large holes with complex boundaries or in curved region, they may not result in satisfactory results. This paper proposes an algorithm which first split the holes into flatter ones and then split the complex holes based the concept of edge expansion. It incrementally splits a complex hole into simple ones by respecting the 3D shape of its boundary and the neighboring meshes, and then fills each resulting simple hole with planar triangulation. The proposed algorithm works well for a variety of complex holes and can better preserve the detailed features of the original mesh. [ABSTRACT FROM AUTHOR]

A sub-cycling integration algorithm (or named multi-time-steps integration algorithm), which has been successfully applied to FEM dynamical analysis, was firstly presented by Belytschko et al. (Comput Methods Appl Mech Eng 17/18:259–275, 1979). However, the problem of how to apply this type of algorithm to flexible multi-body dynamics (FMD) problems still lacks investigation up to now. Similar to the region-partitioning method used in FEM, this paper presents a central-difference-based sub-cycling integral method by decomposing the variables of an FMD equation into several groups and adopting different integral step sizes to each group of the variables. Based on the condensed form of an FMD equation, a group of common update formulae and a sub-step update formula, which constitute the sub-cycling together, are established in the paper. Furthermore, an implementation flowchart of the sub-cycling is presented. Stability of the sub-cycling will be analyzed and numerical examples will be performed to verify availability and precision of the sub-cycling in part II of the paper. [ABSTRACT FROM AUTHOR]

This paper focuses on the generation of a three-dimensional (3D) mesh sizing function for geometry-adaptive finite element (FE) meshing. The mesh size at a point in the domain of a solid depends on the geometric complexity of the solid. This paper proposes a set of tools that are sufficient to measure the geometric complexity of a solid. Discrete skeletons of the input solid and its surfaces are generated, which are used as tools to measure the proximity between geometric entities and feature size. The discrete skeleton and other tools, which are used to measure the geometric complexity, generate source points that determine the size and local sizing function at certain points in the domain of the solid. An octree lattice is used to store the sizing function as it reduces the meshing time. The size at every lattice-node is calculated by interpolating the size of the source points. The algorithm has been tested on many industrial models, and it can be extended to consider other non-geometric factors that influence the mesh size, such as physics, boundary conditions, etc. [ABSTRACT FROM AUTHOR]

In order to generate efficient tool path with given precision requirements, scallop height should be kept under a given limit, while the tool path should be as short as possible to reduce machining time. Traditional methods generate CC curves one by one, which makes the final tool path far from being globally optimal. This paper presents an optimal tool path generation model for a ball-end tool which strives to globally optimize a tool path with various objectives and constraints. Two scalar functions are constructed over the part surface to represent the path intervals and the feedrate (with directions). Using the finite element method (FEM), the tool path length minimization model and the machining time minimization model are solved numerically. The proposed method is also suitable for tool path generation on mesh surfaces. Simulation results show that the generated tool path can be direction parallel or contour parallel with different boundary conditions. Compared to most of the conventional tool path generation methods, the proposed method is able to generate more effective tool paths due to the global optimization strategy. [ABSTRACT FROM AUTHOR]

This paper presents a method to find all intersections between curved lines such as structural line elements and finite element meshes with intentions to generate smaller, non-compatible, line cells (e.g. bar elements) between crossings. The intersection finding algorithm works for two and three-dimensional meshes constituted by linear, quadratic or higher order elements. Using the proposed algorithm, meshes can then be automatically prepared for finite element analyses with techniques for embedding elements within others or analyses that require lines within solids. The application of the method is demonstrated by a number of numerical examples illustrating its capabilities in handling complex geometries, relative speed and convenience. [ABSTRACT FROM AUTHOR]

This paper presents a new isogeometric mortar contact formulation based on an extended finite element interpolation to capture physical pressure discontinuities at the contact boundary. The so called two-half-pass algorithm is employed, which leads to an unbiased formulation and, when applied to the mortar setting, has the additional advantage that the mortar coupling term is no longer present in the contact forces. As a result, the computationally expensive segmentation at overlapping master-slave element boundaries, usually required in mortar methods (although often simplified with loss of accuracy), is not needed from the outset. For the numerical integration of general contact problems, the so-called refined boundary quadrature is employed, which is based on adaptive partitioning of contact elements along the contact boundary. The contact patch test shows that the proposed formulation passes the test without using either segmentation or refined boundary quadrature. Several numerical examples are presented to demonstrate the robustness and accuracy of the proposed formulation. [ABSTRACT FROM AUTHOR]

This paper introduces a methodology for creating geometrically consistent subsurface simulation models, and subsequently tetrahedral finite element (FE) meshes, from geometric entities generated in gOcad software. Subsurface simulation models have an intrinsic heterogeneous characteristic due to the different geomechanics properties of each geological layer. This type of modeling should represent geometry of natural objects, such as geological horizons and faults, which have faceted representations. In addition, in subsurface simulation modeling, lower-dimension degenerated parts, such as dangling surfaces, should be represented. These requirements pose complex modeling problems, which, in general, are not treated by a generic geometric modeler. Therefore, this paper describes four important modeling capabilities that are implemented in a subsurface simulation modeler: surface re-triangulation, surface intersection, automatic volume recognition, and tetrahedral mesh generation. Surface re-triangulation is used for regenerating the underlying geometric support of surfaces imported from gOcad and of surface patches resulting from intersection. The same re-triangulation algorithm is used for generating FE surface meshes. The proposed modeling methodology combines, with some adaptation, meshing algorithms previously published by the authors. Two novel techniques are presented, the first for surface intersection and the second for automatic volume recognition. The main contribution of the present work is the integration of such techniques through a methodology for the solution of mesh generation problems in subsurface simulation modeling. An example illustrates the capabilities of the proposed methodology. Shape quality of generated triangular surface and tetrahedral meshes, as well as the efficiency of the 3D mesh generator, is demonstrated by means of this example. [ABSTRACT FROM AUTHOR]

Compressed sensing ensures the accurate reconstruction of sparse signals from far fewer samples than required in the classical Shannon-Nyquist theorem. In this paper, a generalized hard thresholding pursuit (GHTP) algorithm is presented that can recover unknown vectors without the sparsity level information. We also analyze the convergence of the proposed algorithm. Numerical experiments are given for synthetic and real-world data to illustrate the validity and the good performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

A review of the recent development of the machining fixture configuration/layout is presented in this paper. The literature review is mainly focused on the recently developed optimal fixture configuration under the dynamic conditions of the workpiece. In this review paper, the fixture design, fixture analysis, fixture synthesis, fixture layout design, optimization of fixture layout design, various optimization algorithms, and case studies of two- and three-dimensional workpiece geometries under dynamic conditions have been emphasized specially. The further scopes of the research are finally summarized. [ABSTRACT FROM AUTHOR]

Mesh cleaning is the procedure of removing duplicate nodes, sequencing the indices of remaining nodes, and then updating the mesh connectivity for a topologically invalid Finite Element mesh. To the best of our knowledge, there has been no previously reported work specifically focused on the cleaning of large Finite Element meshes. In this paper we specifically present a generic and straightforward algorithm, MeshCleaner, for cleaning large Finite Element meshes. The presented mesh cleaning algorithm is composed of (1) the stage of compacting and reordering nodes and (2) the stage of updating mesh topology. The basic ideas for performing the above two stages efficiently both in sequential and in parallel are introduced. Furthermore, one serial and two parallel implementations of the algorithm MeshCleaner are developed on multi-core CPU and/or many-core GPU. To evaluate the performance of our algorithm, three groups of experimental tests are conducted. Experimental results indicate that the algorithm MeshCleaner is capable of cleaning large meshes very efficiently, both in sequential and in parallel. The presented mesh cleaning algorithm MeshCleaner is generic, simple, and practical. [ABSTRACT FROM AUTHOR]

BRDF continues to be used as a fundamental tool for representing material appearance in computer graphics. In this paper we present a practical adaptive method for acquisition of anisotropic BRDF, based on sparse adaptive measurement of the complete four-dimensional BRDF space by means of one-dimensional slices, which form a sparse four-dimensional structure in the BRDF space, and can be measured by continuous movements of a light source and sensor. Such a sampling approach is advantageous especially for gonioreflectometer-based measurement devices where the mechanical travel of a light source and a sensor imposes a significant time constraint. In order to evaluate our method, we have performed adaptive measurements of three materials and we simulated adaptive measurements of thirteen others. This method has one quarter the reconstruction error of that resulting from regular non-adaptive BRDF measurements using the same number of measured samples. Our method is almost twice as good as a previous adaptive method, and it requires from two to five times fewer samples to achieve the same results as alternative approaches. [ABSTRACT FROM AUTHOR]

Shot peen forming is often used to form the aerodynamic configurations of aircraft integral wing panels. The component is traditionally regarded as perfectly constrained target in peen forming process. However, weak-stiffness of the component results in concomitant macroscopic bending and stretching deformations, and releasing of peening stresses. Subsequent peening stresses are induced by shot impacts based on the current released stresses. In this paper, a intermittently peening-releasing finite element simulation model is used to study peening stress evolution in lowrigidity plate. An algorithm is proposed to calculate the increment of subsequent peening stress by connecting current stresses to the peening stresses in perfectly constrained target.With the algorithm, the peen forming deformations of freely constrained plates are calculated by equivalently simulating the peen forming process. And strip peen forming deformations are calculated and compared with experimental data. The comparison shows the peening deformation of a low-rigidity component should be treated as an incremental process and the algorithm can be used to predict the deformation with good accuracy. [ABSTRACT FROM AUTHOR]

In this paper, heat transfer problems with sharp spatial gradients are analyzed using the Generalized Finite Element Method with global-local enrichment functions ( GFEM). With this approach, scale-bridging enrichment functions are generated on the fly, providing specially-tailored enrichment functions for the problem to be analyzed with no a-priori knowledge of the exact solution. In this work, a decomposition of the linear system of equations is formulated for both steady-state and transient heat transfer problems, allowing for a much more computationally efficient analysis of the problems of interest. With this algorithm, only a small portion of the global system of equations, i.e., the hierarchically added enrichments, need to be re-computed for each loading configuration or time-step. Numerical studies confirm that the condensation scheme does not impact the solution quality, while allowing for more computationally efficient simulations when large problems are considered. We also extend the GFEM to allow for the use of hexahedral elements in the global domain, while still using tetrahedral elements in the local domain, to allow for automatic localized mesh refinement without the use of constrained approximations. Simulations are run with the use of linear and quadratic hexahedral and tetrahedral elements in the global domain. Convergence studies indicate that the use of a different partition of unity (PoU) in the global (hexahedral elements) and local (tetrahedral elements) domains does not adversely impact the solution quality. [ABSTRACT FROM AUTHOR]

In this paper, a new type of hybrid finite element method (FEM), hybrid fundamental-solution-based FEM (HFS-FEM), is developed for analyzing plane piezoelectric problems by employing fundamental solutions (Green's functions) as internal interpolation functions. A modified variational functional used in the proposed model is first constructed, and then the assumed intra-element displacement fields satisfying a priori the governing equations of the problem are constructed by using a linear combination of fundamental solutions at a number of source points located outside the element domain. To ensure continuity of fields over inter-element boundaries, conventional shape functions are employed to construct the independent element frame displacement fields defined over the element boundary. The proposed methodology is assessed by several examples with different boundary conditions and is also used to investigate the phenomenon of stress concentration in infinite piezoelectric medium containing a hole under remote loading. The numerical results show that the proposed algorithm has good performance in numerical accuracy and mesh distortion insensitivity compared with analytical solutions and those from ABAQUS. In addition, some new insights on the stress concentration have been clarified and presented in the paper. [ABSTRACT FROM AUTHOR]

Many applications in computational science and engineering concern composite materials, which are characterized by large discontinuities in the material properties. Such applications require fine-scale finite-element meshes, which lead to large linear systems that are challenging to solve with current direct and iterative solutions algorithms. In this paper, we consider the simulation of asphalt concrete, which is a mixture of components with large differences in material stiffness. The discontinuities in material stiffness give rise to many small eigenvalues that negatively affect the convergence of iterative solution algorithms such as the preconditioned conjugate gradient (PCG) method. This paper considers the deflated preconditioned conjugate gradient (DPCG) method in which the rigid body modes of sets of elements with homogeneous material properties are used as deflation vectors. As preconditioner we consider several variants of the algebraic multigrid smoothed aggregation method. We evaluate the performance of the DPCG method on a parallel computer using up to 64 processors. Our test problems are derived from real asphalt core samples, obtained using CT scans. We show that the DPCG method is an efficient and robust technique for solving these challenging linear systems. [ABSTRACT FROM AUTHOR]

In this paper, the constitutive relations of the finite element method are constructed and used for solving two- and three-dimensional problems of the asymmetric theory of elasticity. Different variants of finite elements are considered. The numerical experiments are carried out to evaluate the reliability and computational efficiency of the finite element algorithm based on the comparison between the numerical and analytical solutions, numerical estimation of the convergence and checking of the degree of accuracy, to which the natural boundary conditions are satisfied. The obtained solutions to the two- and three-dimensional problems are interpreted from the viewpoint of their applicability to a design of experiments capable of revealing the facts of couple-stress effects in material under elastic deformation and identification of material constants for the asymmetric theory of elasticity. The capabilities of the finite element algorithm to interpret experimental data and estimate the errors occurring in real experiments have been tested by solving several example problems. [ABSTRACT FROM AUTHOR]

This paper presents physics-based models as a key component of prognostic and diagnostic algorithms of health monitoring systems. While traditionally overlooked in condition-based maintenance strategies, these models potentially offer a robust alternative to experimental or other stochastic modeling data. Such a strategy is particularly useful in aerospace applications, presented in this paper in the context of a helicopter transmission model. A lumped parameter, finite element model of a widely used helicopter transmission is presented as well as methods of fault seeding and detection. Fault detection through diagnostic vibration parameters is illustrated through the simulation of a degraded rolling-element bearing supporting the transmission's input shaft. Detection in the time domain and frequency domain is discussed. The simulation shows such modeling techniques to be useful tools in health monitoring analysis, particularly as sources of information for algorithms to compare with real-time or near real-time sensor data. [ABSTRACT FROM AUTHOR]

The immersed finite element method (IFEM) is a novel numerical approach to solve fluid-structure interaction types of problems that utilizes non-conforming meshing concept. The fluid and the solid domains are represented independently. The original algorithm of the IFEM follows the interpolation process as illustrated in the original immersed boundary method where the fluid velocity and the interaction force are explicitly coupled. However, the original approach presents many numerical difficulties when the fluid and solid physical properties have large mismatches, such as when the density difference is large and when the solid is a very stiff material. Both situations will lead to divergent or unstable solutions if not handled properly. In this paper, we develop a semi-implicit formulation of the IFEM algorithm so that several terms of the interfacial forces are implicitly evaluated without going through the force distribution process. Based on the 2-D and 3-D examples that we study in this paper, we show that the semi-implicit approach is robust and is capable of handling these highly discontinuous physical properties quite well without any numerical difficulties. [ABSTRACT FROM AUTHOR]

A contact algorithm in the context of the combined discrete element (DE) and finite element (FE) method is proposed. The algorithm, which is based on the node-to-surface method used in finite element method, treats each spherical discrete element as a slave node and the surfaces of the finite element domain as the master surfaces. The contact force on the contact interface is processed by using a penalty function method. Afterward, a modification of the combined DE/FE method is proposed. Following that, the corresponding numerical code is implemented into the in-house developed code. To test the accuracy of the proposed algorithm, the impact between two identical bars and the vibration process of a laminated glass plate under impact of elastic sphere are simulated in elastic range. By comparing the results with the analytical solution and/or that calculated by using LS-DYNA, it is found that they agree with each other very well. The accuracy of the algorithm proposed in this paper is proved. [ABSTRACT FROM AUTHOR]

An algorithm combining three-dimensional (3D) discrete and finite element methods is proposed. This new approach is conducted by decomposing the calculation domain into a finite element (FE) calculation domain and a discrete element (DE) calculation domain; the interaction between the two sub-domains is processed by using a penalty function method. Following the established model that combines spherical DEs and FEs, the corresponding numerical code is developed. The vibration process of two cantilever beams under dynamic force is simulated. By comparing the results calculated with different penalty factors set and also with that calculated by the finite element code LS-DYNA, it is found that the calculated results are unanimous and the precision is almost the same as LS-DYNA, as long as the penalty factor is large enough. Moreover, the vibration processes of two plates under impact of rigid spheres are simulated and the accuracy of the model proposed in this paper is further proved in the field of contact mechanics by comparing the simulating results with that calculated by using LS-DYNA. Finally, the impact fracture behavior of a laminated glass plate is simulated, with the influence of model parameters taken into consideration. And the numerical experiments show that the combined model can be used to predict some macroscopical physical quantities, such as the impact force of impactor. [ABSTRACT FROM AUTHOR]

In this paper, we present a new and automatic node projection algorithm to generate hexahedral meshes in extrusion geometries. It is designed to preserve the shape of the cap surfaces in the inner layers of a sweeping mesh. The algorithm is based on least-squares approximation of affine mappings. We report that the functionals that have been traditionally used to compute the affine mapping generate four undesired effects on the inner layers of nodes. Namely, the flattening, skewing, offset scaling, and flipping of the inner layer meshes. To overcome these drawbacks we first analyze several properties of a new functional that depends on two vector parameters. Second, we introduce the concept of the pseudo-area and pseudo-normal vectors defined by a loop of nodes. In addition, we prove several geometrical properties of these vectors. Third, based on the properties of the new functional and on the definition of the pseudo-normal vector, we detail a new projection algorithm that automatically selects the functional vector parameters. The aim of this paper is to provide the implementation details to developers, although we also present the background of the algorithm. Finally, several mesh examples are discussed to assess the properties of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Abstract  High fidelity finite element modeling of continuum mechanics problems often requires using all quadrilateral or all hexahedral meshes. The efficiency of such models is often dependent upon the ability to adapt a mesh to the physics of the phenomena. Adapting a mesh requires the ability to both refine and/or coarsen the mesh. The algorithms available to refine and coarsen triangular and tetrahedral meshes are very robust and efficient. However, the ability to locally and conformally refine or coarsen all quadrilateral and all hexahedral meshes presents many difficulties. Some research has been done on localized conformal refinement of quadrilateral and hexahedral meshes. However, little work has been done on localized conformal coarsening of quadrilateral and hexahedral meshes. A general method which provides both localized conformal coarsening and refinement for quadrilateral meshes is presented in this paper. This method is based on restructuring the mesh with simplex manipulations to the dual of the mesh. In addition, this method appears to be extensible to hexahedral meshes in three dimensions. [ABSTRACT FROM AUTHOR]

Abstract  One of the demands for three dimensional (3D) finite element analyses is the development of an automatic hexahedral mesh generator. For this problem, several methods have been proposed by many researchers. However, reliable automatic hexahedral mesh generation has not been developed at present. In this paper, a new strategy of fully automatic hexahedral mesh generation is proposed. In this strategy, the prerequisite for generating a hexahedral mesh is a quadrilateral surface mesh. From the given surface mesh, combinatorial dual cycles (sheet loops for the whisker-weaving algorithm) are generated to produce a hexahedral mesh. Since generating a good quality hexahedral mesh does not depend only on the quality of quadrilaterals of the surface mesh but also on the quality of the sheet loops generated from it, a surface mesh modification method to remove self-intersections from sheet loops is developed. Next, an automatic hexahedral mesh generator by the improved whisker-weaving algorithm is developed in this paper. By creating elements and nodes on 3D real space during the weaving process, it becomes possible to generate a hexahedral mesh with fewer bad-quality elements. Several examples will be presented to show the validity of the proposed mesh generation strategy. [ABSTRACT FROM AUTHOR]

Abstract  In this paper, adaptive finite element method is developed for the estimation of distributed parameter in elliptic equation. Both upper and lower error bound are derived and used to improve the accuracy by appropriate mesh refinement. An efficient preconditioned project gradient algorithm is employed to solve the nonlinear least-squares problem arising in the context of parameter identification problem. The efficiency of our error estimators is demonstrated by some numerical experiments. [ABSTRACT FROM AUTHOR]

This paper presents our new development of parallel finite element algorithms for elastic–plastic problems. The proposed method is based on dividing the original structure under consideration into a number of substructures which are treated as isolated finite element models via the interface conditions. Throughout the analysis, each processor stores only the information relevant to its substructure and generates the local stiffness matrix. A parallel substructure oriented preconditioned conjugate gradient method, which is combined with MR smoothing and diagonal storage scheme are employed to solve linear systems of equations. After having obtained the displacements of the problem under consideration, a substepping scheme is used to integrate elastic–plastic stress–strain relations. The procedure outlined controls the error of the computed stress by choosing each substep size automatically according to a prescribed tolerance. The combination of these algorithms shows a good speedup when increasing the number of processors and the effective solution of 3D elastic–plastic problems whose size is much too large for a single workstation becomes possible. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to detect damage (stiffness degradation) of laminated composite plates from noisy impact response data. The combined finite element method (FEM) with five degrees of freedom (DOF) and the advanced noise filtering algorithm described in this paper may allow us not only to detect the deteriorated elements but also to find their locations and the extents. A first order shear deformation theory (FSDT) is used to predict the structural behavior and to detect damage of laminated composite plates. The filtering procedure is designed by means of a wavelet decomposition together with a selection of the measuring points, and the optimization criterion is constructed on an estimate of the probability of detection using genetic algorithms. All these techniques are applied for the first time to composites. The effects of filtered noise associated with the uncertainty of measurements due to the complex nature of composites are considered for different layup sequences, number of layers, and length–thickness ratios. Several numerical results show that the noise filtering system is computationally efficient in identifying stiffness degradation for complex structures such as laminated composites. [ABSTRACT FROM AUTHOR]

Local and parallel finite element algorithms based on two-grid discretization for Navier-Stokes equations in two dimension are presented. Its basis is a coarse finite element space on the global domain and a fine finite element space on the subdomain. The local algorithm consists of finding a solution for a given nonlinear problem in the coarse finite element space and a solution for a linear problem in the fine finite element space, then droping the coarse solution of the region near the boundary. By overlapping domain decomposition, the parallel algorithms are obtained. This paper analyzes the error of these algorithms and gets some error estimates which are better than those of the standard finite element method. The numerical experiments are given too. By analyzing and comparing these results, it is shown that these algorithms are correct and high efficient. [ABSTRACT FROM AUTHOR]

A new method, to parallel the dominating computing work of structural dynamic response analysis, is presented in this paper. Then, based on “ShenWei I” supercomputer, MSC.NASTRAN and PATRAN, a parallel and integrated system is implemented. The system tightly couples advantages of the FEA code and high performance of the supercomputer. The system can improve the structural scale and velocity of dynamic response analysis greatly. Finally two examples are presented to demonstrate the validity and efficiency of the system. [ABSTRACT FROM AUTHOR]

In this paper a three-dimensional Voronoi cell finite element model is developed for analyzing heterogeneous materials containing a dispersion of ellipsoidal inclusions or voids in the matrix. The paper starts with a description of 3D tessellation of a domain with ellipsoidal heterogeneities, to yield a 3D mesh of Voronoi cells containing the heterogeneities. A surface based tessellation algorithm is developed to account for the shape and size of the ellipsoids in point based tessellation methods. The 3D Voronoi cell finite element model, using the assumed stress hybrid formulation, is developed for determining stresses and displacements in a linear elastic material domain. Special stress functions that introduce classical Lamé functions in ellipsoidal coordinates are implemented to enhance solution convergence. Numerical methods for implementation of algorithms and yielding stable solutions are discussed. Numerical examples are conducted with inclusions and voids to demonstrate the effectiveness of the model. [ABSTRACT FROM AUTHOR]

This paper considers isotropic and orthotropic nonlinear constitutive relations for brittle materials in the case of plane stresses. Numerical solution algorithms based on the finite-element method are developed. The resulting material models are incorporated in the PIONER software. The correctness of crack path determination is examined by solving a test problem of crack propagation. The isotropic model gives mesh-dependent results, whereas the orthotropic model provides an adequate solution. It is shown that solutions obtained for the isotropic model are close to those obtained by eliminating failed elements. [ABSTRACT FROM AUTHOR]

3D elastoplastic frictional contact problems with orthotropic friction law belong to the unspecified boundary problems with nonlinearities in both material and geometric forms. One of the difficulties in solving the problem lies in the determination of the tangential slip states at the contact points. A great amount of computational efforts is needed so as to obtain high accuracy numerical results. Based on a combination of the well known mathematical programming method and iterative method, a finite element model is put forward in this paper. The problems are finally reduced to linear complementarity problems. A specially designed smoothing algorithm based on NCP-function is then applied for solving the problems. Numerical results are given to demonstrate the validity of the model and the algorithm proposed. [ABSTRACT FROM AUTHOR]

In this paper, we develop a general technique for truncating Petri net unfoldings, parameterized according to the level of information about the original unfolding one wants to preserve. Moreover, we propose a new notion of completeness of a truncated unfolding. A key aspect of our approach is an algorithm-independent notion of cut-off events, used to truncate a Petri net unfolding. Such a notion is based on a cutting context and results in the unique canonical prefix of the unfolding. Canonical prefixes are complete in the new, stronger sense, and we provide necessary and sufficient conditions for its finiteness, as well as upper bounds on its size in certain cases. A surprising result is that after suitable generalization, the standard unfolding algorithm presented in [8], and the parallel unfolding algorithm proposed in [12], despite being non-deterministic, generate the canonical prefix. This gives an alternative correctness proof for the former algorithm, and a new (much simpler) proof for the latter one. [ABSTRACT FROM AUTHOR]

In this paper, we construct a second order algorithm based on the spectral deferred correction method for the time-dependent magnetohydrodynamics flows at a low magnetic Reynolds number. We present a complete theoretical analysis to prove that this algorithm is unconditionally stable, consistent and second order accuracy. Finally, two numerical examples are given to illustrate the convergence and effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

Mesh matching is an effective way to convert the non-conforming interfaces between two hexahedral meshes into conforming ones, which is very important for achieving high-quality finite element analysis. However, the existing mesh matching algorithm is neither efficient nor effective enough to handle complex interfaces and self-intersecting sheets. In this paper, the algorithm is improved in three aspects: (1) by introducing a more precise criteria for chord matching and the concept of partition chord set, complex interfaces with internal loops can be handled more effectively; (2) by proposing a new solution, self-intersecting sheet can be inflated and extracted locally; and (3) by putting forward a mesh quality evaluation method, the sheet extraction operation during mesh matching can be done more efficiently. Our improved mesh matching algorithm is fully automatic, and its effectiveness is demonstrated by several examples in different matching situations. [ABSTRACT FROM AUTHOR]

In this paper, we study a two level method based on Newton's iteration for the nonlinear system arising from the Galerkin finite element approximation to the equations of motion described by the Kelvin-Voigt viscoelastic fluid flow model. The two-grid algorithm is based on three steps. In the first step, the nonlinear system is solved on a coarse mesh $\mathcal {T}_{H}$ to obtain an approximate solution u. In the second step, the nonlinear system is linearized around u based on Newton's iteration and the linear system is solved on a finer mesh $\mathcal {T}_{h}$. Finally, in the third step, a correction to the results obtained in the second step is achieved by solving a linear problem with a different right hand side on $\mathcal {T}_{h}$. Optimal error estimates in L( L)-norm, when $h=\mathcal {O} (H^{2-\delta })$ and in L()-norm, when $h=\mathcal {O}(H^{5-2\delta })$ for velocity and in L( L)-norm, when $h=\mathcal {O}(H^{5-2\delta })$ for pressure are established, where δ > 0 is arbitrarily small for two dimensions and $\delta =\frac {1}{2}$ for three dimensions. [ABSTRACT FROM AUTHOR]

In this paper, a coupled hydro-mechanical formulation is developed for deformable porous media subjected to crack interfaces in the framework of extended finite element method. Governing equations of the porous medium consist of the momentum balance of the bulk together with the momentum balance and continuity equations of the fluid phase, known as [InlineEquation not available: see fulltext.] formulation. The discontinuity in fractured porous medium is modeled for both opening and closing modes that results in the fluid flow within the fracture, and/or contact behavior at the crack edges. The fluid flow through the fracture is assumed to be viscous and is modeled by employing the Darcy law in which the permeability of fracture is obtained using the cubic law. The contact condition in fractured porous medium is handled by taking the advantage from two different algorithms of LATIN method and penalty algorithm. The effect of contact on fluid phase is employed by considering no leak-off from/into the porous medium. The nonlinearity of coupled equations produced due to opening and closing modes is carried out using an iterative algorithm in the Newton-Raphson procedure. Finally, several numerical examples are solved to illustrate the performance of proposed X-FEM method for hydro-mechanical behavior of fractured porous media with opening and closing modes. [ABSTRACT FROM AUTHOR]

In the current paper we present a fast, reliable technique for simulating wave propagation in complex structures made of heterogeneous materials. The proposed approach, the spectral cell method, is a combination of the finite cell method and the spectral element method that significantly lowers preprocessing and computational expenditure. The spectral cell method takes advantage of explicit time-integration schemes coupled with a diagonal mass matrix to reduce the time spent on solving the equation system. By employing a fictitious domain approach, this method also helps to eliminate some of the difficulties associated with mesh generation. Besides introducing a proper, specific mass lumping technique, we also study the performance of the low-order and high-order versions of this approach based on several numerical examples. Our results show that the high-order version of the spectral cell method together requires less memory storage and less CPU time than other possible versions, when combined simultaneously with explicit time-integration algorithms. Moreover, as the implementation of the proposed method in available finite element programs is straightforward, these properties turn the method into a viable tool for practical applications such as structural health monitoring [-], quantitative ultrasound applications [], or the active control of vibrations and noise [, ]. [ABSTRACT FROM AUTHOR]