Shuli Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shuli Sun has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Haobin Xu
LTCS, Department of Mechanics and Engineering Science, College of Engineering, Peking University, Beijing, China
3 shared publications Bin Chen
LTCS, Department of Mechanics and Engineering Sciences, College of Engineering, Peking University, Beijing 100871, China
1 shared publication- Hui Wang
Department of Civil and Environmental Engineering, University of Dayton, Dayton, OH, United States
1 shared publication Jian-Fei Liu
Peking University
1 shared publication- JianFei Liu
Peking University
1 shared publication Jie Sui
LTCS, Department of Mechanics and Engineering Sciences, College of Engineering, Peking University, Beijing 100871, China
1 shared publication
Latest Publications
- 14 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (07)
A Particle Rearrangement Approach for Optimizing Planar and Surface Particle Distributions in Meshless Particle Methods
Particle-based meshless methods are commonly used in fluid dynamics and solid mechanics involving finite deformations, owing to their ability to break through the limitations imposed by mesh topology. Particle distribution usually plays a crucial role in determining the accuracy of simulation results for them. In this study, an error estimation was first conducted to ascertain the requirements for particle distribution necessary for accurate simulations. It was revealed that the sawtooth and chaotic particle distributions can significantly reduce numerical accuracy and even cause numerical instability in simulations. To address this issue, we propose a particle rearrangement approach including a pseudo hydrostatic pressure treatment to achieve body-fitted particles and a geometric smoothing method based on the metric of a point cloud unit to optimize chaotic particle distributions for improved regularity. The particles are iteratively moved according to their proximity to neighboring particles. Notably, the number of particles remains constant throughout the smoothing procedure, neither particles inserted or removed, nor particles overflow or volume expansion. This new approach facilitates the generation of body-fitted and relatively regular planar and surface particle distributions, meeting the requirements for arbitrarily complex shape particle distributions. The effectiveness of this method has been demonstrated through two-dimensional SPH simulations for problems of the flow around a cylinder, dam break, and Taylor–Green vortex.
- 14 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (07)
A Particle Rearrangement Approach for Optimizing Planar and Surface Particle Distributions in Meshless Particle Methods
Particle-based meshless methods are commonly used in fluid dynamics and solid mechanics involving finite deformations, owing to their ability to break through the limitations imposed by mesh topology. Particle distribution usually plays a crucial role in determining the accuracy of simulation results for them. In this study, an error estimation was first conducted to ascertain the requirements for particle distribution necessary for accurate simulations. It was revealed that the sawtooth and chaotic particle distributions can significantly reduce numerical accuracy and even cause numerical instability in simulations. To address this issue, we propose a particle rearrangement approach including a pseudo hydrostatic pressure treatment to achieve body-fitted particles and a geometric smoothing method based on the metric of a point cloud unit to optimize chaotic particle distributions for improved regularity. The particles are iteratively moved according to their proximity to neighboring particles. Notably, the number of particles remains constant throughout the smoothing procedure, neither particles inserted or removed, nor particles overflow or volume expansion. This new approach facilitates the generation of body-fitted and relatively regular planar and surface particle distributions, meeting the requirements for arbitrarily complex shape particle distributions. The effectiveness of this method has been demonstrated through two-dimensional SPH simulations for problems of the flow around a cylinder, dam break, and Taylor–Green vortex.
- 18 October 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (02)
Crystal Plasticity Model and Simulations for Single Crystal Magnesium
To further investigate interaction and competition among various deformation modes in magnesium, a crystal plasticity model incorporating slip, twin, and secondary slip and twin systems is established. This study extends recent molecular dynamics findings to the crystal plasticity framework, introducing a new slip hardening model that incorporates twin boundaries. The proposed unified twin hardening model suitable for both tensile and compressive twins, considers twin stages of nucleation, propagation and growth, thereby simulating twin saturation and coexistence of multiple twin variants. Initially applied to single crystal magnesium, the numerical results agree with experimental findings by Kelley and Hosford, demonstrating twin saturation. We observe that plastic contributions from secondary slip and twin are smaller than those from slip and twins in the parent phase. Furthermore, the plastic contribution from pyramidal I slip is preferred to pyramidal II slip. Next, to study the serious influence of voids on the stress–strain response of ductile solids during manufacturing, the proposed model is then applied to single crystal magnesium containing a void along [ ]-axis tension and compression. Both simulations confirm the validity of our crystal plasticity model and its potential to analyze future experimental and molecular dynamic findings.
- 18 October 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (02)
Crystal Plasticity Model and Simulations for Single Crystal Magnesium
To further investigate interaction and competition among various deformation modes in magnesium, a crystal plasticity model incorporating slip, twin, and secondary slip and twin systems is established. This study extends recent molecular dynamics findings to the crystal plasticity framework, introducing a new slip hardening model that incorporates twin boundaries. The proposed unified twin hardening model suitable for both tensile and compressive twins, considers twin stages of nucleation, propagation and growth, thereby simulating twin saturation and coexistence of multiple twin variants. Initially applied to single crystal magnesium, the numerical results agree with experimental findings by Kelley and Hosford, demonstrating twin saturation. We observe that plastic contributions from secondary slip and twin are smaller than those from slip and twins in the parent phase. Furthermore, the plastic contribution from pyramidal I slip is preferred to pyramidal II slip. Next, to study the serious influence of voids on the stress–strain response of ductile solids during manufacturing, the proposed model is then applied to single crystal magnesium containing a void along [ ]-axis tension and compression. Both simulations confirm the validity of our crystal plasticity model and its potential to analyze future experimental and molecular dynamic findings.
- 10 October 2024
- Published by Elsevier in Advances in Engineering Software
- Vol. 198
Smoothing and untangling for polyhedral mesh based on element shape transformation
- 10 October 2024
- Published by Elsevier in Advances in Engineering Software
- Vol. 198
Smoothing and untangling for polyhedral mesh based on element shape transformation
- Open Access
- 21 July 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (14) , 5019
Simultaneous Smoothing and Untangling of 2D Meshes Based on Explicit Element Geometric Transformation and Element Stitching
Mesh quality can affect both the accuracy and efficiency of numerical solutions. This paper first proposes a geometry-based smoothing and untangling method for 2D meshes based on explicit element geometric transformation and element stitching. A new explicit element geometric transformation (EEGT) operation for polygonal elements is firstly presented. The transformation, if applied iteratively to an arbitrary polygon (even inverted), will improve its regularity and quality. Then a well-designed element stitching scheme is introduced, which is achieved by carefully choosing appropriate element weights to average the temporary nodes obtained by the above individual element transformation. Based on the explicit element geometric transformation and element stitching, a new mesh smoothing and untangling approach for 2D meshes is proposed. The proper choice of averaging weights for element stitching ensures that the elements can be transitioned smoothly and uniformly throughout the calculation domain. Numerical results show that the proposed method is able to produce high-quality meshes with no inverted elements for highly tangled meshes. Besides, the inherent regularity and fine-grained parallelism make it suitable for implementation on Graphic Processor Unit (GPU).
- 21 July 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (14) , 5019
Open AccessSimultaneous Smoothing and Untangling of 2D Meshes Based on Explicit Element Geometric Transformation and Element Stitching
Mesh quality can affect both the accuracy and efficiency of numerical solutions. This paper first proposes a geometry-based smoothing and untangling method for 2D meshes based on explicit element geometric transformation and element stitching. A new explicit element geometric transformation (EEGT) operation for polygonal elements is firstly presented. The transformation, if applied iteratively to an arbitrary polygon (even inverted), will improve its regularity and quality. Then a well-designed element stitching scheme is introduced, which is achieved by carefully choosing appropriate element weights to average the temporary nodes obtained by the above individual element transformation. Based on the explicit element geometric transformation and element stitching, a new mesh smoothing and untangling approach for 2D meshes is proposed. The proper choice of averaging weights for element stitching ensures that the elements can be transitioned smoothly and uniformly throughout the calculation domain. Numerical results show that the proposed method is able to produce high-quality meshes with no inverted elements for highly tangled meshes. Besides, the inherent regularity and fine-grained parallelism make it suitable for implementation on Graphic Processor Unit (GPU).
- 11 January 2017
- Published by Springer Nature in Journal of Mountain Science
- Vol. 14 (1) , 175-187
Stability analysis of slope in strain-softening soils using local arc-length solution scheme
- 11 January 2017
- Published by Springer Nature in Journal of Mountain Science
- Vol. 14 (1) , 175-187
Stability analysis of slope in strain-softening soils using local arc-length solution scheme
- Open Access
- 24 May 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-9
Smoothing Algorithm for Planar and Surface Mesh Based on Element Geometric Deformation
Smoothing is one of the basic procedures for improvement of mesh quality. In this paper, a novel and efficient smoothing approach for planar and surface mesh based on element geometric deformation is developed. The presented approach involves two main stages. The first stage is geometric deformation of all the individual elements through a specially designed two-step stretching-shrinking operation (SSO), which is performed by moving the vertices of each element according to a certain rule in order to get better shape of the element. The second stage is to determine the position of each node of the mesh by a weighted average strategy according to quality changes of its adjacent elements. The suggested SSO-based smoothing algorithm works efficiently for triangular mesh and can be naturally expanded to quadrilateral mesh, arbitrary polygonal mesh, and mixed mesh. Combined with quadratic error metric (QEM), this approach may be also applied to improve the quality of surface mesh. The proposed method is simple to program and inherently very suitable for parallelization, especially on graphic processing unit (GPU). Results of numerical experiments demonstrate the effectiveness and potential of this method.
- 24 May 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-9
Open AccessSmoothing Algorithm for Planar and Surface Mesh Based on Element Geometric Deformation
Smoothing is one of the basic procedures for improvement of mesh quality. In this paper, a novel and efficient smoothing approach for planar and surface mesh based on element geometric deformation is developed. The presented approach involves two main stages. The first stage is geometric deformation of all the individual elements through a specially designed two-step stretching-shrinking operation (SSO), which is performed by moving the vertices of each element according to a certain rule in order to get better shape of the element. The second stage is to determine the position of each node of the mesh by a weighted average strategy according to quality changes of its adjacent elements. The suggested SSO-based smoothing algorithm works efficiently for triangular mesh and can be naturally expanded to quadrilateral mesh, arbitrary polygonal mesh, and mixed mesh. Combined with quadratic error metric (QEM), this approach may be also applied to improve the quality of surface mesh. The proposed method is simple to program and inherently very suitable for parallelization, especially on graphic processing unit (GPU). Results of numerical experiments demonstrate the effectiveness and potential of this method.
- Open Access
- 18 September 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-9
An Efficient Mesh Generation Method for Fractured Network System Based on Dynamic Grid Deformation
Meshing quality of the discrete model influences the accuracy, convergence, and efficiency of the solution for fractured network system in geological problem. However, modeling and meshing of such a fractured network system are usually tedious and difficult due to geometric complexity of the computational domain induced by existence and extension of fractures. The traditional meshing method to deal with fractures usually involves boundary recovery operation based on topological transformation, which relies on many complicated techniques and skills. This paper presents an alternative and efficient approach for meshing fractured network system. The method firstly presets points on fractures and then performs Delaunay triangulation to obtain preliminary mesh by point-by-point centroid insertion algorithm. Then the fractures are exactly recovered by local correction with revised dynamic grid deformation approach. Smoothing algorithm is finally applied to improve the quality of mesh. The proposed approach is efficient, easy to implement, and applicable to the cases of initial existing fractures and extension of fractures. The method is successfully applied to modeling of two- and three-dimensional discrete fractured network (DFN) system in geological problems to demonstrate its effectiveness and high efficiency.
- 18 September 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-9
Open AccessAn Efficient Mesh Generation Method for Fractured Network System Based on Dynamic Grid Deformation
Meshing quality of the discrete model influences the accuracy, convergence, and efficiency of the solution for fractured network system in geological problem. However, modeling and meshing of such a fractured network system are usually tedious and difficult due to geometric complexity of the computational domain induced by existence and extension of fractures. The traditional meshing method to deal with fractures usually involves boundary recovery operation based on topological transformation, which relies on many complicated techniques and skills. This paper presents an alternative and efficient approach for meshing fractured network system. The method firstly presets points on fractures and then performs Delaunay triangulation to obtain preliminary mesh by point-by-point centroid insertion algorithm. Then the fractures are exactly recovered by local correction with revised dynamic grid deformation approach. Smoothing algorithm is finally applied to improve the quality of mesh. The proposed approach is efficient, easy to implement, and applicable to the cases of initial existing fractures and extension of fractures. The method is successfully applied to modeling of two- and three-dimensional discrete fractured network (DFN) system in geological problems to demonstrate its effectiveness and high efficiency.
- Open Access
- 1 January 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-7
Partial Refactorization in Sparse Matrix Solution: A New Possibility for Faster Nonlinear Finite Element Analysis
This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix solution, which is nowadays the default solution choice in finite element analysis and can solve finite element models up to millions degrees of freedom. Among various fill-in’s reducing strategies for sparse matrix solution, the graph partition is in general the best in terms of resultant fill-ins and floating-point operations and furthermore produces a particular graph of sparse matrix that prevents local change of entries from wide spreading in factorization. Based on this feature, an explicit partial triangular refactorization with local change is efficiently constructed with limited additional storage requirement in row-sparse storage scheme. The partial refactorization of the changed stiffness matrix inherits a big percentage of the original factor and is carried out only on partial factor entries. The proposed method provides a new possibility for faster nonlinear analysis and is mainly suitable for material nonlinear problems and optimization problems. Compared to full factorization, it can significantly reduce the factorization time and can make nonlinear analysis more efficient.
- 1 January 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-7
Open AccessPartial Refactorization in Sparse Matrix Solution: A New Possibility for Faster Nonlinear Finite Element Analysis
This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix solution, which is nowadays the default solution choice in finite element analysis and can solve finite element models up to millions degrees of freedom. Among various fill-in’s reducing strategies for sparse matrix solution, the graph partition is in general the best in terms of resultant fill-ins and floating-point operations and furthermore produces a particular graph of sparse matrix that prevents local change of entries from wide spreading in factorization. Based on this feature, an explicit partial triangular refactorization with local change is efficiently constructed with limited additional storage requirement in row-sparse storage scheme. The partial refactorization of the changed stiffness matrix inherits a big percentage of the original factor and is carried out only on partial factor entries. The proposed method provides a new possibility for faster nonlinear analysis and is mainly suitable for material nonlinear problems and optimization problems. Compared to full factorization, it can significantly reduce the factorization time and can make nonlinear analysis more efficient.
- 14 January 2012
- Published by Springer Nature in Acta Mechanica Sinica
- Vol. 28 (1) , 140-145
A new method of quality improvement for quadrilateral mesh based on small polygon reconnection
- 14 January 2012
- Published by Springer Nature in Acta Mechanica Sinica
- Vol. 28 (1) , 140-145
A new method of quality improvement for quadrilateral mesh based on small polygon reconnection