Abstract

This study intends to address several problems that are still obstructing the complete practicability of the linear equation dwell time model (LEDTM) used in deterministic subaperture polishing, including memory cost, time cost, arbitrary boundary, and arbitrary tool path. For a large-scale surface error matrix, the memory cost and time cost are two major problems of concern. Here, we present a method that uses the operation of a sparse matrix to build and store the coefficient matrix of the linear equation, which can reduce the memory cost and time cost tens to hundreds of times, thus making LEDTM readily deal with a large-scale surface error matrix on a common personal computer, with a time cost of $\sim 1–6\mathrm{s}$ for a surface error matrix with a scale of $300\times 300$ to $600\times 600$. The compatibility for an arbitrary surface error boundary and tool path is also addressed. Using the proposed method, we believe the LEDTM reaches a complete practicability in engineering.

© 2015 Optical Society of America

Robust linear equation dwell time model compatible with large scale discrete surface error matrix

Zhichao Dong, Haobo Cheng, and Hon-Yuen Tam
Appl. Opt. 54(10) 2747-2756 (2015)

Modified dwell time optimization model and its applications in subaperture polishing

Zhichao Dong, Haobo Cheng, and Hon-Yuen Tam
Appl. Opt. 53(15) 3213-3224 (2014)

Dwell time algorithm in deterministic polishing of a free-form surface based on the continuous tool influence function

Lei Zhang, Qizhi Zhao, and Cheng Fan
Appl. Opt. 60(9) 2704-2715 (2021)

Dwell-time algorithm for polishing large optics

Chunjin Wang, Wei Yang, Zhenzhong Wang, Xu Yang, Chenlin Hu, Bo Zhong, Yinbiao Guo, and Qiao Xu
Appl. Opt. 53(21) 4752-4760 (2014)

Compensating for velocity truncation during subaperture polishing by controllable and time-variant tool influence functions

Zhichao Dong, Haobo Cheng, and Hon-Yuen Tam
Appl. Opt. 54(5) 1167-1174 (2015)