An Elementary Approximation of Dwell Time Algorithm for Ultra-Precision Computer-Controlled Optical Surfacing

The dwell time algorithm is one of the key technologies that determines the accuracy of a workpiece in the field of ultra-precision computer-controlled optical surfacing. Existing algorithms mainly consider meticulous mathematics theory and high convergence rates, making the computation process more uneven, and the flatness cannot be further improved. In this paper, a reasonable elementary approximation algorithm of dwell time is proposed on the basis of the theoretical requirement of a removal function in the subaperture polishing and single-peak rotational symmetry character of its practical distribution. Then, the algorithm is well discussed with theoretical analysis and numerical simulation in cases of one-dimension and two-dimensions. In contrast to conventional dwell time algorithms, this proposed algorithm transforms superposition and coupling features of the deconvolution problem into an elementary approximation issue of function value. Compared with the conventional methods, it has obvious advantages for improving calculation efficiency and flatness, and is of great significance for the efficient computation of large-aperture optical polishing. The flatness of phi 150 mm and phi 100 mm workpieces have achieved PVr(150) = 0.028 lambda and PVcr(100) = 0.014 lambda respectively.