Abstract

The discretization methods have been widely used for chatter stability prediction and can be divided into two categories: semi-discretization methods (SDMs) by discretizing the time-delayed displacements, and full-discretization methods (FDMs) by discretizing both the present and time-delayed displacements. In this paper, a whole discretization method is proposed to achieve a faster and more accurate prediction for the milling stability. In addition to the discrete vibration displacements, the discrete vibration velocities are included in the solution by rebuilding the integrated matrix. The prediction error caused by the separate discretization of the cutting force coefficient matrix and vibration state variables can be avoided. The milling stability is determined with the discrete map of the state based on the Floquet theory. The proposed model is compared with the zeroth-order SDM and the first-order FDM which also approximate the solution with two neighboring discrete state variables. It is shown that the local discretization error based on the proposed method achieves o((Δt)5), which is three orders higher compared to the zeroth-order SDM and the first-order FDM. In addition, when the same prediction errors are required, the computational time of the proposed method is 11–14% of the zeroth-order SDM, and 24–27% of the first-order FDM. The results prove that considering vibration velocity can increase the efficiency and accuracy of the chatter stability prediction compared to existing SDM and FDM algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.