Optimization method of dwell time condition for stable discretization calculation of optical processing
By optimizing the dwell time condition of discretized calculations in optical processing using the matrix method, the problem of insufficient computational stability in existing technologies is solved, and the stability and accuracy of the results are improved under the interference of error sources.
Patent Information
- Application Number
- CN202411241200.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-05
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2044-09-05
AI Technical Summary
Existing methods for calculating dwell time in optical processing fail to effectively consider computational stability, leading to deviations between the results and actual processing results, especially with larger errors under external error sources.
The matrix method is used to optimize the discretized dwell time conditions of optical processing. By setting the surface shape and polishing trajectory parameters, an initial convolution matrix is established, and the surface shape error and polishing trajectory are optimized to solve for the most stable dwell time.
Under the interference of external error sources, the error between the calculated prediction result and the actual processing result is kept to a minimum, thus improving the stability and accuracy of the calculation.
Smart Images

Figure CN118760816B_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the technical field of optical processing, and in particular relates to a method for optimizing the dwell time conditions of stable discretization calculation of optical processing. Background Art
[0002] The discrete intervals used in the existing dwell time calculation are mostly manually defined and strongly rely on the experience of engineers. However, there are many environmental interference error sources in optical processing, and the actual results will deviate from the calculated results if you are not careful.
[0003] There are five main methods for calculating residence time:
[0004] The first one is the paper “Algorithm for ion beam figuring of low-gradient mirrors” published by Jiao Changjun et al. in the journal “Applied Optics”, which mainly introduces the Bayesian method to solve the residence time;
[0005] The second method is the paper "Iterative blind deconvolution method for dwell-time adjustment" published by Shigenori Tanebe et al. in the journal "Applied optics", which mainly introduces the Fourier transform method to solve the dwell time.
[0006] The third method is the paper "Dwell-time algorithm for polishing large optics" published by Wang Chunjin et al. in the journal "Applied Optics", which mainly introduces the direct convolution method to solve the dwell time.
[0007] The fourth type, Zhu Wule et al. published a paper titled "Zernike mapping of optimum dwell time in deterministic fabrication of freeform optics" in the journal "Optics Express", which mainly introduced the polynomial fitting method to solve the dwell time.
[0008] Fifth, the paper "Algorithm for Solving the Dwell Time in Magnetorheological Processing of Large-Aperture Optical Components" published by Li Longxiang et al. in the journal "Acta Optica Sinica" mainly introduces the matrix method for solving the dwell time.
[0009] These methods all have their own advantages, but the research focus is on computational efficiency and accuracy, and no attention is paid to computational stability. Summary of the invention
[0010] In view of this, the present invention aims to provide a method for optimizing the dwell time conditions of stable discretization calculations in optical processing, using the matrix method as a carrier to indicate the relationship between calculation stability and discretization, so that under the interference of external error sources, the error between the calculation prediction results and the actual processing results can still be kept to a minimum.
[0011] To achieve the above object, the technical solution created by the present invention is implemented as follows:
[0012] A method for optimizing dwell time conditions for stable discretization calculation of optical processing, specifically comprising the following steps:
[0013] S1: setting surface parameters according to the surface size of the workpiece to be processed, and defining a surface parameter vector according to the surface parameters; setting a polishing trajectory according to the surface size of the workpiece to be processed, and then obtaining a polishing trajectory parameter; defining a trajectory parameter vector according to the polishing trajectory parameter;
[0014] S2: Perform single-point processing on a test piece of the same material as the workpiece to be processed, and measure the removal function; determine the initial convolution matrix according to the removal function;
[0015] S3: Determine the optimization conditions, and obtain the optimal surface parameter vector, the optimal trajectory parameter vector and the final convolution matrix according to the optimization conditions;
[0016] S4: measuring the surface shape of the workpiece to be processed by an interferometer to obtain the surface shape error of the workpiece to be processed, performing surface shape interpolation on the surface shape error according to the optimal surface shape parameter vector, and obtaining the regularized stable surface shape error;
[0017] S5: setting a stable polishing trajectory according to the optimal trajectory parameter vector;
[0018] S6: A matrix equation is established according to the stable surface shape error, the stable polishing trajectory and the final convolution matrix, and the matrix equation is solved to obtain the stable dwell time.
[0019] Furthermore, in step S1, the surface parameters include: the size of the workpiece to be processed in the X direction , the size of the workpiece to be processed in the Y direction , Sampling interval of the workpiece to be processed in the X direction , Sampling interval of the workpiece to be processed in the Y direction ; At this time, the surface parameter vector is obtained .
[0020] Further, in step S1, the polishing trajectory parameters include: Polishing size in direction , polishing track Polishing size in direction , polishing track Sampling interval in direction , polishing track Sampling interval in direction ,exist Edge distance when polishing in the direction ,exist Edge distance when polishing in the direction ; At this time, the trajectory parameter vector is obtained .
[0021] Furthermore, in step S2, the removal function is ,in represents the removal function discrete coordinates, , represents the qth point of the removed function discrete point, Q represents the total number of removed function discrete points; at this time, the initial convolution matrix is obtained for:
[0022]
[0023]
[0024] in, Represents the coordinates of the discrete surface points of the workpiece to be processed, , represents the i-th point of the discrete surface point, Represents the total number of discrete surface points; represents the coordinates of discrete points on the polishing trajectory, , represents the jth point of the trajectory discrete points, Represents the total number of discrete points of the trajectory; It represents the removal rate of the removal function at the initial j-th trajectory discrete point to the i-th discrete surface point.
[0025] Furthermore, in step S3, the optimization condition is:
[0026]
[0027] in, Represents the convolution matrix The condition number of Represents the convolution matrix The surface parameter vector with the smallest condition number is Represents the convolution matrix The trajectory parameter vector with the smallest condition number is It represents the ratio of synchronous changes of surface shape and trajectory sampling interval when the condition number of convolution matrix A is the smallest. Represents the convolution matrix The length of the surface coordinate vector of the discrete surface point when the condition number is minimum, Represents the convolution matrix The length of the trajectory coordinate vector of the discrete points of the trajectory when the condition number is minimum, represents the final convolution matrix; Represents the optimal surface shape range vector of the workpiece to be processed in the X direction, Represents the optimal surface shape range vector of the workpiece to be processed in the Y direction; Indicated in The optimal trajectory range vector of the polishing trajectory in the direction, Indicated in The optimal trajectory range vector of the polishing trajectory in direction.
[0028] Furthermore, step S3 further includes the following steps:
[0029] S31: The trajectory range vector is determined by the following formula:
[0030]
[0031]
[0032] in, Indicated in The trajectory range vector of the polishing trajectory in direction, Indicated in The trajectory range vector of the polishing trajectory in the direction; Indicated in The change in trajectory density in the direction, Indicated in The change in trajectory density in the direction; Indicates the ratio of synchronous changes in surface shape and trajectory sampling interval;
[0033] S32: Determine the surface range vector by the following formula:
[0034]
[0035]
[0036] in, represents the surface shape range vector of the workpiece to be processed in the X direction, A vector representing the surface shape range of the workpiece to be processed in the Y direction; Indicates the density change of discrete surface points in the X direction; Indicates the density change of discrete surface points in the Y direction;
[0037] S33: Determine new discrete surface points based on the surface range vector and trajectory range vector and the new trajectory discrete points , and the new convolution matrix is obtained by the following formula :
[0038]
[0039]
[0040] in, , , k represents the number of repetitions, K represents the total number of repetitions, The kth repetition of the discrete surface point Points, Represents the length of the surface coordinate vector of the discrete surface point at the kth repetition; , represents the discrete points of the trajectory at the kth repetition Points, Represents the length of the trajectory coordinate vector of the discrete points of the trajectory at the kth repetition; Indicates the kth repetition The removal function at the discrete points of the trajectory The removal rate of discrete surface points;
[0041] S34: The convolution matrix at the kth repetition Substituting into the optimization condition of step S3, the current surface parameter vector and trajectory parameter vector are obtained;
[0042] S35: Repeat steps S31 to S34 K times to obtain the final convolution matrix, the final surface parameter vector and the trajectory parameter vector, and the final surface parameter vector and the trajectory parameter vector are respectively recorded as the optimal surface parameter vector and the optimal trajectory parameter vector.
[0043] Further, step S4 specifically includes the following steps:
[0044] S41: Measure the surface shape of the workpiece to be processed by interferometer to obtain the surface shape error ;
[0045] S42: Determine the optimal discrete surface point based on the optimal surface range vector , according to the optimal discrete surface point Surface error Interpolate to obtain the stable surface error ;in, , represents the optimal discrete surface point point.
[0046] Further, in step S5, the optimal trajectory discrete points are determined according to the optimal trajectory range vector , and then a stable polishing trajectory is obtained; wherein, , represents the first discrete point in the optimal trajectory point.
[0047] Furthermore, the matrix equation in step S6 is as follows:
[0048]
[0049] in, , Represents the optimal trajectory discrete points The residence time at the location.
[0050] Compared with the prior art, the invention can achieve the following beneficial effects:
[0051] The present invention creates the optical processing stable discretization calculation dwell time condition optimization method to obtain the initial parameters of optical processing (including initial surface error, removal function, polishing trajectory), use the matrix method to calculate the discretized matrix, take the minimum condition number of the convolution matrix as the goal, optimize the surface error and the degree of discretization of the polishing trajectory, and finally re-obtain the discretized surface error and the polishing trajectory to calculate the most stable dwell time. The present invention quantifies the calculation stability problem that has not been considered in the solution of the optical processing dwell time in the past and proposes an optimization method to obtain the best discrete parameters. Compared with the previous method, the method provided by the present invention shows advantages in calculation stability. Under the interference of external error sources, the error between the calculation prediction result and the actual processing result can still be kept to a minimum. BRIEF DESCRIPTION OF THE DRAWINGS
[0052] The drawings constituting part of the present invention are used to provide a further understanding of the present invention. The exemplary embodiments and descriptions of the present invention are used to explain the present invention and do not constitute an improper limitation on the present invention. In the drawings:
[0053] Figure 1 A flow chart of a method for optimizing the dwell time conditions for stable discretization calculation of optical processing according to an embodiment of the present invention. DETAILED DESCRIPTION
[0054] In order to make the purpose, technical solution and advantages of the invention more clear, the invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described here are only used to explain the invention and do not constitute a limitation of the invention.
[0055] It should be noted that, in the absence of conflict, the embodiments of the present invention and the features in the embodiments may be combined with each other.
[0056] In the description of the present invention, it should be understood that the terms "center", "longitudinal", "lateral", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present invention. In addition, the terms "first", "second", etc. are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, features defined as "first", "second", etc. may explicitly or implicitly include one or more of the features. In the description of the present invention, unless otherwise specified, "multiple" means two or more.
[0057] In the description of the invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installation", "connection" and "connection" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the invention can be understood according to specific circumstances.
[0058] The present invention will be described in detail below with reference to the accompanying drawings and in combination with embodiments.
[0059] like Figure 1 As shown, the method for optimizing the dwell time condition of the stable discretization calculation of optical processing described in the embodiment of the invention specifically includes the following steps:
[0060] S1: setting surface parameters according to the surface size of the workpiece to be processed, and defining a surface parameter vector according to the surface parameters; setting a polishing trajectory according to the surface size of the workpiece to be processed, and then obtaining a polishing trajectory parameter; defining a trajectory parameter vector according to the polishing trajectory parameter.
[0061] The surface parameters include: the size of the workpiece to be processed in the X direction , the size of the workpiece to be processed in the Y direction , Sampling interval of the workpiece to be processed in the X direction , Sampling interval of the workpiece to be processed in the Y direction At this time, we get the surface parameter vector .
[0062] Polishing trajectory parameters include: Polishing size in direction , polishing track Polishing size in direction , polishing track Sampling interval in direction , polishing track Sampling interval in direction ,exist Edge distance when polishing in the direction (i.e. the distance between the edge of the polishing track and the edge of the workpiece to be processed), Edge distance when polishing in the direction At this time, the trajectory parameter vector is obtained .
[0063] S2: Perform single-point processing on a test piece of the same material as the workpiece to be processed, and measure the removal function; determine the initial convolution matrix based on the removal function.
[0064] In step S2, the removal function is measured as ,in represents the removal function discrete coordinates, , represents the qth point of the removed function discrete point, and Q represents the total number of removed function discrete points. At this time, the initial convolution matrix is obtained for:
[0065]
[0066]
[0067] in, Represents the coordinates of the discrete surface points of the workpiece to be processed, , represents the i-th point of the discrete surface point, Represents the total number of discrete surface points; represents the coordinates of discrete points on the polishing trajectory, , represents the jth point of the trajectory discrete point, Represents the total number of discrete points of the trajectory; It represents the removal rate of the removal function at the initial j-th trajectory discrete point to the i-th discrete surface point.
[0068] S3: Determine the optimization conditions, and obtain the optimal surface parameter vector, the optimal trajectory parameter vector and the final convolution matrix according to the optimization conditions.
[0069] In step S3, the optimization condition is:
[0070]
[0071] in, Represents the convolution matrix The condition number of Represents the convolution matrix The surface parameter vector with the smallest condition number is Represents the convolution matrix The trajectory parameter vector with the smallest condition number is It represents the ratio of synchronous changes of surface shape and trajectory sampling interval when the condition number of convolution matrix A is the smallest. Represents the convolution matrix The length of the surface coordinate vector of the discrete surface point when the condition number is minimum, Represents the convolution matrix The length of the trajectory coordinate vector of the discrete points of the trajectory when the condition number is minimum; Represents the optimal surface shape range vector of the workpiece to be processed in the X direction, Represents the optimal surface shape range vector of the workpiece to be processed in the Y direction; Indicated in The optimal trajectory range vector of the polishing trajectory in the direction, Indicated in The optimal trajectory range vector of the polishing trajectory in direction.
[0072] Step S3 also includes the following steps:
[0073] S31: Scale the trajectory sampling interval by the following formula to determine the trajectory range vector:
[0074]
[0075]
[0076] in, Indicated in The trajectory range vector of the polishing trajectory in direction, Indicated in The trajectory range vector of the polishing trajectory in the direction; Indicated in The change in trajectory density in the direction, Indicated in The change in trajectory density in the direction; Indicates the ratio of synchronous changes in surface shape and trajectory sampling interval, The range of variation is determined by experience. In the embodiment of the present invention, the range of variation is , is the lower limit of the synchronous change ratio of the surface shape and trajectory sampling interval. In the embodiment of the present invention, it is preferably set , is the upper limit of the synchronous change ratio of the surface shape and trajectory sampling interval. In the embodiment of the present invention, it is preferably set .
[0077] S32: Scale the sampling interval of the surface shape by the following formula to determine the surface shape range vector:
[0078]
[0079]
[0080] in, Represents the surface shape range vector of the workpiece to be processed in the X direction, Represents the surface range vector of the workpiece to be processed in the Y direction; Indicates the density change of discrete surface points in the X direction; Indicates the density change of discrete surface points in the Y direction.
[0081] S33: Based on the surface range vector and the face range vector , a new surface mesh is established by the following formula:
[0082] ;
[0083] The above formula represents the surface range vector in the X direction and the surface range vector in the Y direction The coordinates contained in the new surface mesh are created .
[0084] From the new face mesh Get new discrete surface points ,Right now:
[0085]
[0086] in, , , k represents the number of repetitions, K represents the total number of repetitions, The kth repetition of the discrete surface point Points, Represents the length of the coordinate vector of the discrete surface point at the kth repetition, that is, , is a function that gets the length of a vector.
[0087] According to the trajectory range vector and the trajectory range vector , a new trajectory grid is established by the following formula:
[0088] ;
[0089] The above formula indicates that according to Trajectory range vector in direction and Trajectory range vector in direction Create a new trajectory grid using the coordinates contained in .
[0090] From the new track grid Get new trajectory discrete points ,Right now:
[0091]
[0092] in, , represents the discrete points of the trajectory at the kth repetition Points, represents the trajectory coordinate vector length of the discrete points of the trajectory at the kth repetition, that is .
[0093] Determine new discrete surface points based on surface range vector and trajectory range vector and the new trajectory discrete points , and the new convolution matrix is obtained by the following formula :
[0094]
[0095]
[0096] in, Indicates the new The removal function at the discrete points of the trajectory The removal rate of discrete surface points;
[0097] S34: The convolution matrix at the kth repetition Substituting into the optimization condition of step S3, the current surface parameter vector and trajectory parameter vector are obtained;
[0098] S35: Repeat steps S31 to S34 K times and change the ratio during each repetition Add 1, in the embodiment of the present invention, until the change ratio from Add to ,and , stop repeating steps S31 to S34 and obtain the final convolution matrix, the final surface parameter vector and the trajectory parameter vector, which are respectively recorded as the optimal surface parameter vector and the optimal trajectory parameter vector.
[0099] S4: Measure the surface shape of the workpiece to be processed by an interferometer to obtain the surface shape error of the workpiece to be processed, perform surface shape interpolation on the surface shape error according to the optimal surface shape parameter vector, and obtain the regularized stable surface shape error.
[0100] Step S4 specifically includes the following steps:
[0101] S41: Measure the surface shape of the workpiece to be processed by interferometer to obtain the surface shape error ;
[0102] S42: Determine the optimal discrete surface point based on the optimal surface range vector ,Right now:
[0103]
[0104] in, , represents the optimal discrete surface point point, ; Represents the optimal surface range vector and the optimal surface range vector through The optimal surface mesh obtained after the function.
[0105] According to the optimal discrete surface point Surface error Interpolate to obtain the stable surface error ,Right now:
[0106]
[0107] Among them, interp2 is a two-dimensional interpolation function.
[0108] S5: Setting a stable polishing trajectory according to the optimal trajectory parameter vector.
[0109] In step S5, the optimal trajectory discrete points are determined according to the optimal trajectory range vector ,Right now:
[0110]
[0111] in, , represents the first discrete point of the optimal trajectory point, ; Represents the optimal trajectory range vector and the optimal trajectory range vector through The optimal trajectory grid obtained after the function.
[0112] Get the optimal trajectory discrete points After that, a stable polishing trajectory can be planned according to the discrete points of the optimal trajectory.
[0113] S6: A matrix equation is established according to the stable surface shape error, the stable polishing trajectory and the final convolution matrix, and the matrix equation is solved to obtain the stable dwell time.
[0114] The matrix equation in step S6 is as follows:
[0115]
[0116] in, , The trajectory discretization that represents the optimal computational stability The stable residence time at .
[0117] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the disclosure of the present invention can be performed in parallel, sequentially or in different orders, as long as the desired results of the technical solution disclosed in the present invention can be achieved, and this document does not limit this.
[0118] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims
1. A method for optimizing dwell time conditions for stable discretization calculation of optical processing, characterized by: The specific steps include: S1: setting surface parameters according to the surface size of the workpiece to be processed, and defining a surface parameter vector according to the surface parameters; setting a polishing trajectory according to the surface size of the workpiece to be processed, and then obtaining a polishing trajectory parameter; defining a trajectory parameter vector according to the polishing trajectory parameter; S2: performing single-point processing on a test piece of the same material as the workpiece to be processed, and measuring a removal function; determining an initial convolution matrix according to the removal function; S3: determining the optimization conditions, and obtaining the optimal surface parameter vector, the optimal trajectory parameter vector and the final convolution matrix according to the optimization conditions; In step S3, the optimization condition is: in, Represents the convolution matrix The condition number of Represents the convolution matrix The surface parameter vector with the smallest condition number is Represents the convolution matrix The trajectory parameter vector with the smallest condition number is Represents the convolution matrix The ratio of synchronous changes in surface shape and trajectory sampling interval when the condition number is the smallest. Represents the convolution matrix The length of the surface coordinate vector of the discrete surface point is Represents the convolution matrix The length of the trajectory coordinate vector of the discrete points of the trajectory when the condition number is minimum, represents the final convolution matrix; represents the optimal surface shape range vector of the workpiece to be processed in the X direction, represents the optimal surface shape range vector of the workpiece to be processed in the Y direction; Indicated in The optimal trajectory range vector of the polishing trajectory in the direction, Indicated in The optimal trajectory range vector of the polishing trajectory in the direction; Represents the surface parameter vector, the size of the workpiece to be processed in the X direction , the size of the workpiece to be processed in the Y direction , the sampling interval of the workpiece to be processed in the X direction , the sampling interval of the workpiece to be processed in the Y direction ; represents the polishing trajectory parameter vector, the polishing trajectory is Polishing size in direction The polishing track is Polishing size in direction The polishing track is Sampling interval in direction The polishing track is Sampling interval in direction ,exist Edge distance when polishing in the direction ,exist Edge distance when polishing in the direction ; Step S3 also includes the following steps: S31: The trajectory range vector is determined by the following formula: in, Indicated in The trajectory range vector of the polishing trajectory in direction, Indicated in The trajectory range vector of the polishing trajectory in the direction; Indicated in The change in trajectory density in the direction, Indicated in The change in trajectory density in the direction; Indicates the ratio of synchronous changes in surface shape and trajectory sampling interval; S32: Determine the surface range vector by the following formula: in, represents the surface shape range vector of the workpiece to be processed in the X direction, A vector representing the surface shape range of the workpiece to be processed in the Y direction; Indicates the density change of discrete surface points in the X direction; Indicates the density change of discrete surface points in the Y direction; S33: Determine new discrete surface points based on the surface range vector and trajectory range vector and the new trajectory discrete points , and the new convolution matrix is obtained by the following formula : in, , , k represents the number of repetitions, K represents the total number of repetitions, The kth repetition of the discrete surface point Points, Represents the length of the surface coordinate vector of the discrete surface point at the kth repetition; , represents the discrete points of the trajectory at the kth repetition Points, Represents the length of the trajectory coordinate vector of the discrete points of the trajectory at the kth repetition; Indicates the kth repetition The removal rate of the removal function at the discrete points of the trajectory to the i'th discrete surface point; S34: The convolution matrix at the kth repetition Substituting the optimization conditions in step S3 to obtain the current surface parameter vector and trajectory parameter vector; S35: repeating steps S31 to S34 K times to obtain the final convolution matrix, the final surface parameter vector and the trajectory parameter vector, the final surface parameter vector and the trajectory parameter vector are respectively recorded as the optimal surface parameter vector and the optimal trajectory parameter vector; S4: measuring the surface shape of the workpiece to be processed by an interferometer to obtain a surface shape error of the workpiece to be processed, performing surface shape interpolation on the surface shape error according to the optimal surface shape parameter vector to obtain a regularized stable surface shape error; S5: Setting a stable polishing trajectory according to the optimal trajectory parameter vector; S6: establishing a matrix equation according to the stable surface shape error, the stable polishing trajectory and the final convolution matrix, and solving the matrix equation to obtain a stable dwell time; The matrix equation in step S6 is as follows: in, Represents the optimal discrete surface point The stable surface error at represents the optimal discrete surface point point, Represents the discrete points of the optimal trajectory The residence time at represents the first discrete point of the optimal trajectory point.
2. The method for optimizing the dwell time condition of stable discretization calculation of optical processing according to claim 1, characterized in that: In step S1, the surface parameter vector .
3. The method for optimizing the dwell time condition of stable discretization calculation of optical processing according to claim 2, characterized in that: In step S1, the trajectory parameter vector .
4. The method for optimizing the dwell time condition of stable discretization calculation of optical processing according to claim 3, characterized in that: In step S2, the removal function is ,in represents the removal function discrete coordinates, , represents the qth point of the removal function discrete point, Q represents the total number of points of the removal function discrete point; at this time, the initial convolution matrix is obtained for: in, represents the coordinates of the discrete surface points of the workpiece to be processed, , represents the i-th point of the discrete surface point, Represents the total number of discrete surface points; represents the coordinates of discrete points on the polishing track, , represents the jth point of the discrete points of the trajectory, Represents the total number of discrete points of the trajectory; It represents the removal rate of the removal function at the initial j-th trajectory discrete point to the i-th discrete surface point.
5. The method for optimizing the dwell time condition of stable discretization calculation of optical processing according to claim 4, characterized in that: The step S4 specifically comprises the following steps: S41: Measuring the surface shape of the workpiece to be processed by the interferometer to obtain the surface shape error ; S42: Determine the optimal discrete surface point based on the optimal surface range vector , according to the optimal discrete surface point The surface error Interpolation is performed to obtain the stable surface error ;in, .
6. The method for optimizing the dwell time condition of stable discretization calculation of optical processing according to claim 5, characterized in that: In step S5, the optimal trajectory discrete points are determined according to the optimal trajectory range vector , and then obtain the stable polishing trajectory; wherein, .
