Based on existing algorithms, a newly developed contact search algorithm is proposed. The new algorithm consists of global search, local searching, local tracking and penetration calculation processes. It requires no ...Based on existing algorithms, a newly developed contact search algorithm is proposed. The new algorithm consists of global search, local searching, local tracking and penetration calculation processes. It requires no iteration steps. It can deal with not only general tool surfaces with vertical walls, but also tool surfaces meshed with elements having very poor aspect ratios. It is demonstrated that the FE code employing this new contact search algorithm becomes more reliable, efficient and accurate for sheet metal forming simulation than conventional ones.展开更多
A new node-pairs contact algorithm is proposed to deal with a composite material or bi-material interface crack face contact and friction problem (e.g., resistant coating and thermal barrier coatings) subjected to c...A new node-pairs contact algorithm is proposed to deal with a composite material or bi-material interface crack face contact and friction problem (e.g., resistant coating and thermal barrier coatings) subjected to complicated load conditions. To decrease the calculation scale and calculation errors, the local Lagrange multipliers are solved only on a pair of contact nodes using the Jacobi iteration method, and the constraint modification of the tangential multipliers are required. After the calculation of the present node-pairs Lagrange multiplier, it is turned to next contact node-pairs until all node-pairs have finished. Compared with an ordinary contact algorithm, the new local node-pairs contact algorithm is allowed a more precise element on the contact face without the stiffness matrix singularity. The stress intensity factors (SIFs) and the contact region of an infinite plate central crack are calculated and show good agreement with those in the literature. The contact zone near the crack tip as well as its influence on singularity of stress fields are studied. Furthermore, the frictional contacts are also considered and found to have a significant influence on the SIFs. The normalized mode-II stress intensity factors KII for the friction coefficient decrease by 16% when f changes from 1 to 0.展开更多
The grid-based multi-velocity field technique has become increasingly popular for simulating the Material Point Method(MPM)in contact problems.However,this traditional technique has some shortcomings,such as(1)early c...The grid-based multi-velocity field technique has become increasingly popular for simulating the Material Point Method(MPM)in contact problems.However,this traditional technique has some shortcomings,such as(1)early contact and contact penetration can occur when the contact conditions are unsuitable,and(2)the method is not available for contact problems involving rigid-nonrigid materials,which can cause numerical instability.This study presents a new hybrid contact approach for the MPM to address these limitations to simulate the soil and structure interactions.The approach combines the advantages of point-point and point-segment contacts to implement contact detection,satisfying the impenetrability condition and smoothing the corner contact problem.The proposed approach is first validated through a disk test on an inclined slope.Then,several typical cases,such as granular collapse,bearing capacity,and deformation of a flexible retaining wall,are simulated to demonstrate the robustness of the proposed approach compared with FEM or analytical solutions.Finally,the proposed method is used to simulate the impact of sand flow on a deformable structure.The results show that the proposed contact approach can well describe the phenomenon of soil-structure interaction problems.展开更多
Large deformation contact problems generally involve highly nonlinear behaviors,which are very time-consuming and may lead to convergence issues.The finite particle method(FPM)effectively separates pure deformation fr...Large deformation contact problems generally involve highly nonlinear behaviors,which are very time-consuming and may lead to convergence issues.The finite particle method(FPM)effectively separates pure deformation from total motion in large deformation problems.In addition,the decoupled procedures of the FPM make it suitable for parallel computing,which may provide an approach to solve time-consuming issues.In this study,a graphics processing unit(GPU)-based parallel algorithm is proposed for two-dimensional large deformation contact problems.The fundamentals of the FPM for planar solids are first briefly introduced,including the equations of motion of particles and the internal forces of quadrilateral elements.Subsequently,a linked-list data structure suitable for parallel processing is built,and parallel global and local search algorithms are presented for contact detection.The contact forces are then derived and directly exerted on particles.The proposed method is implemented with main solution procedures executed in parallel on a GPU.Two verification problems comprising large deformation frictional contacts are presented,and the accuracy of the proposed algorithm is validated.Furthermore,the algorithm’s performance is investigated via a large-scale contact problem,and the maximum speedups of total computational time and contact calculation reach 28.5 and 77.4,respectively,relative to commercial finite element software Abaqus/Explicit running on a single-core central processing unit(CPU).The contact calculation time percentage of the total calculation time is only 18%with the FPM,much smaller than that(50%)with Abaqus/Explicit,demonstrating the efficiency of the proposed method.展开更多
In this paper, we develop a general way to construct contact algorithms for contact dynamical systems. Such an algorithm requires the corresponding step transition map preserve the contact structure of the underlying ...In this paper, we develop a general way to construct contact algorithms for contact dynamical systems. Such an algorithm requires the corresponding step transition map preserve the contact structure of the underlying contact phase space. The constructions are based on the correspondence between the contact geometry of R2n+1 and the conic symplectic one of R2n+2 and therefore, the algorithms are derived naturally from the symplectic algorithms of Hamiltonian systems.展开更多
Although the penalty algorithm is simple and direct in concept, it has a defect that the contact forces are badly dependent on the chosen penalty factor. An improved contact-impact algorithm for the explicit integrati...Although the penalty algorithm is simple and direct in concept, it has a defect that the contact forces are badly dependent on the chosen penalty factor. An improved contact-impact algorithm for the explicit integration FEM is proposed in the present paper. Based on the fact that bodies cannot penetrate into each other on the contact faces, a set of equations with the additional unknown contact forces on the slave nodes can be formed in a new system configuration. By solving these equations, the correct contact forces could be obtained without using the penalty factor.展开更多
Basetl on the finite element solution of the parametric varialional principle of elastic con/del problem, a corresponding parallel algorithm has been created bv utilizing the specialities of parallel computer and the ...Basetl on the finite element solution of the parametric varialional principle of elastic con/del problem, a corresponding parallel algorithm has been created bv utilizing the specialities of parallel computer and the architecture of concurrent processing in this paper. In this algorithm. the parallelisms have heen realized in the processes of creation and assembly of stiffness matrix, of the static condensation, of the solution of stresses and in many other aspects. The programme of this algorithm has been realized on ELXSI-6400 parallel computer of Xi'an Jiaotong University. The results of computation show that the computational time can be saved efficiently and it is an effective parallel algorithm for the analyses of contact problems.展开更多
Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problem...Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problems are proposed. One is called the self-adjusting interior point algorithm, the other is called the aggregate function smoothing algorithm. Numerical experiment shows the efficiency of the proposed two algorithms.展开更多
为了提高人体尺寸预测的效率和准确性,该文提出了GBWO-ENN(Grey Black Wolf Optimization-Elman Neural Network)的方法。针对传统灰狼算法易于陷入局部最优和无法平衡全局与局部搜索的平衡性问题,提出了GBWO算法。该算法融合黑寡妇优...为了提高人体尺寸预测的效率和准确性,该文提出了GBWO-ENN(Grey Black Wolf Optimization-Elman Neural Network)的方法。针对传统灰狼算法易于陷入局部最优和无法平衡全局与局部搜索的平衡性问题,提出了GBWO算法。该算法融合黑寡妇优化算法中蜘蛛的运动方式对灰狼优化算法中α狼位置更新进行了优化,通过非线性递减的方法降低了收敛系数,并且提出了按位置等级更新种群的策略。随后采用GBWO算法对Elman神经网络的权值和阈值进行优化,并将GBWO-ENN模型应用于三维人体尺寸预测。实验结果表明,GBWO-ENN模型结构简单,能够准确预测人体尺寸,具有较好的预测能力。展开更多
基金the National Natural Science F oundation of China (5 9875 0 2 5 ) and Excellent Young Teacher Founda-tion of the Educational Departm ent of China
文摘Based on existing algorithms, a newly developed contact search algorithm is proposed. The new algorithm consists of global search, local searching, local tracking and penetration calculation processes. It requires no iteration steps. It can deal with not only general tool surfaces with vertical walls, but also tool surfaces meshed with elements having very poor aspect ratios. It is demonstrated that the FE code employing this new contact search algorithm becomes more reliable, efficient and accurate for sheet metal forming simulation than conventional ones.
基金supported by the National Basic Research Program of China(Grant No.2012CB026200)the National Natural Science Foundation of China(Grant No.50878048)
文摘A new node-pairs contact algorithm is proposed to deal with a composite material or bi-material interface crack face contact and friction problem (e.g., resistant coating and thermal barrier coatings) subjected to complicated load conditions. To decrease the calculation scale and calculation errors, the local Lagrange multipliers are solved only on a pair of contact nodes using the Jacobi iteration method, and the constraint modification of the tangential multipliers are required. After the calculation of the present node-pairs Lagrange multiplier, it is turned to next contact node-pairs until all node-pairs have finished. Compared with an ordinary contact algorithm, the new local node-pairs contact algorithm is allowed a more precise element on the contact face without the stiffness matrix singularity. The stress intensity factors (SIFs) and the contact region of an infinite plate central crack are calculated and show good agreement with those in the literature. The contact zone near the crack tip as well as its influence on singularity of stress fields are studied. Furthermore, the frictional contacts are also considered and found to have a significant influence on the SIFs. The normalized mode-II stress intensity factors KII for the friction coefficient decrease by 16% when f changes from 1 to 0.
基金funding support from the National Nature Science Foundation of China(Grant No.52022060)the Key Laboratory of Impact and Safety Engineering(Ningbo University).
文摘The grid-based multi-velocity field technique has become increasingly popular for simulating the Material Point Method(MPM)in contact problems.However,this traditional technique has some shortcomings,such as(1)early contact and contact penetration can occur when the contact conditions are unsuitable,and(2)the method is not available for contact problems involving rigid-nonrigid materials,which can cause numerical instability.This study presents a new hybrid contact approach for the MPM to address these limitations to simulate the soil and structure interactions.The approach combines the advantages of point-point and point-segment contacts to implement contact detection,satisfying the impenetrability condition and smoothing the corner contact problem.The proposed approach is first validated through a disk test on an inclined slope.Then,several typical cases,such as granular collapse,bearing capacity,and deformation of a flexible retaining wall,are simulated to demonstrate the robustness of the proposed approach compared with FEM or analytical solutions.Finally,the proposed method is used to simulate the impact of sand flow on a deformable structure.The results show that the proposed contact approach can well describe the phenomenon of soil-structure interaction problems.
基金This work was supported by the National Key Research and Development Program of China[Grant No.2016YFC0800200]the National Natural Science Foundation of China[Grant Nos.51778568,51908492,and 52008366]+1 种基金Zhejiang Provincial Natural Science Foundation of China[Grant Nos.LQ21E080019 and LY21E080022]This work was also sup-ported by the Key Laboratory of Space Structures of Zhejiang Province(Zhejiang University)and the Center for Balance Architecture of Zhejiang University.
文摘Large deformation contact problems generally involve highly nonlinear behaviors,which are very time-consuming and may lead to convergence issues.The finite particle method(FPM)effectively separates pure deformation from total motion in large deformation problems.In addition,the decoupled procedures of the FPM make it suitable for parallel computing,which may provide an approach to solve time-consuming issues.In this study,a graphics processing unit(GPU)-based parallel algorithm is proposed for two-dimensional large deformation contact problems.The fundamentals of the FPM for planar solids are first briefly introduced,including the equations of motion of particles and the internal forces of quadrilateral elements.Subsequently,a linked-list data structure suitable for parallel processing is built,and parallel global and local search algorithms are presented for contact detection.The contact forces are then derived and directly exerted on particles.The proposed method is implemented with main solution procedures executed in parallel on a GPU.Two verification problems comprising large deformation frictional contacts are presented,and the accuracy of the proposed algorithm is validated.Furthermore,the algorithm’s performance is investigated via a large-scale contact problem,and the maximum speedups of total computational time and contact calculation reach 28.5 and 77.4,respectively,relative to commercial finite element software Abaqus/Explicit running on a single-core central processing unit(CPU).The contact calculation time percentage of the total calculation time is only 18%with the FPM,much smaller than that(50%)with Abaqus/Explicit,demonstrating the efficiency of the proposed method.
文摘In this paper, we develop a general way to construct contact algorithms for contact dynamical systems. Such an algorithm requires the corresponding step transition map preserve the contact structure of the underlying contact phase space. The constructions are based on the correspondence between the contact geometry of R2n+1 and the conic symplectic one of R2n+2 and therefore, the algorithms are derived naturally from the symplectic algorithms of Hamiltonian systems.
文摘Although the penalty algorithm is simple and direct in concept, it has a defect that the contact forces are badly dependent on the chosen penalty factor. An improved contact-impact algorithm for the explicit integration FEM is proposed in the present paper. Based on the fact that bodies cannot penetrate into each other on the contact faces, a set of equations with the additional unknown contact forces on the slave nodes can be formed in a new system configuration. By solving these equations, the correct contact forces could be obtained without using the penalty factor.
基金Supported by the National Funds of National Structutal Vibration & Strength Laboratory of Xi'an Jiaotong University
文摘Basetl on the finite element solution of the parametric varialional principle of elastic con/del problem, a corresponding parallel algorithm has been created bv utilizing the specialities of parallel computer and the architecture of concurrent processing in this paper. In this algorithm. the parallelisms have heen realized in the processes of creation and assembly of stiffness matrix, of the static condensation, of the solution of stresses and in many other aspects. The programme of this algorithm has been realized on ELXSI-6400 parallel computer of Xi'an Jiaotong University. The results of computation show that the computational time can be saved efficiently and it is an effective parallel algorithm for the analyses of contact problems.
基金The project supported by the National Natural Science foundation of china(10225212,50178016.10302007)the National Kev Basic Research Special Foundation and the Ministry of Education of China
文摘Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problems are proposed. One is called the self-adjusting interior point algorithm, the other is called the aggregate function smoothing algorithm. Numerical experiment shows the efficiency of the proposed two algorithms.
文摘为了提高人体尺寸预测的效率和准确性,该文提出了GBWO-ENN(Grey Black Wolf Optimization-Elman Neural Network)的方法。针对传统灰狼算法易于陷入局部最优和无法平衡全局与局部搜索的平衡性问题,提出了GBWO算法。该算法融合黑寡妇优化算法中蜘蛛的运动方式对灰狼优化算法中α狼位置更新进行了优化,通过非线性递减的方法降低了收敛系数,并且提出了按位置等级更新种群的策略。随后采用GBWO算法对Elman神经网络的权值和阈值进行优化,并将GBWO-ENN模型应用于三维人体尺寸预测。实验结果表明,GBWO-ENN模型结构简单,能够准确预测人体尺寸,具有较好的预测能力。