2011
DOI: 10.3788/hplpb20112312.3207
|View full text |Cite
|
Sign up to set email alerts
|

on Large-scale dwell time algorithm for computer controlled optical surfacing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…This method has limitations in its application due to its high computational complexity, morbid matrix state, and slow computational speed. Luo et al [ 30 ] determined the dwell time in the computer-controlled optical surfacing (CCOS) of optical elements with large diameters using a non-negative least squares method based on a sparse matrix and researched the regularization of the method. Based on introducing the regularization weight factor into the dwell time matrix equation, Wu et al [ 31 ] added extra removal amounts to expand the freedom of the dwell time solution.…”
Section: Calculation Methods Of Dwell Timementioning
confidence: 99%
See 1 more Smart Citation
“…This method has limitations in its application due to its high computational complexity, morbid matrix state, and slow computational speed. Luo et al [ 30 ] determined the dwell time in the computer-controlled optical surfacing (CCOS) of optical elements with large diameters using a non-negative least squares method based on a sparse matrix and researched the regularization of the method. Based on introducing the regularization weight factor into the dwell time matrix equation, Wu et al [ 31 ] added extra removal amounts to expand the freedom of the dwell time solution.…”
Section: Calculation Methods Of Dwell Timementioning
confidence: 99%
“…The core principle of the algorithm is to use the information-sharing behavior of each individual in the whole swarm to cause the motion of all particles to change iteratively; they then tend to move towards a specified solution space, finally obtaining the optimal solution [39] (pp. [29][30][31][32][33][34][35][36][37][38][39].…”
Section: Establishing the Dwell Time Optimization Algorithmmentioning
confidence: 99%
“…At present, the common method is such as the pulse iteration method, Fourier transform method, matrix method and so on. In this paper, the matrix method and the pulse iteration method have been used to overcome the problem of numerical divergence [4,5] . The initial surface error has been set as Eq.7 and the amplitude is 1μm.…”
Section: Evaluation Of Residual Error Of the Annular Polishing Padmentioning
confidence: 99%