Volume 1, Issue 4
High-accuracy Polishing Technique Using Dwell Time Adjustment

S. Satake, K. Yamamoto & S. Igarashi

DOI:

Commun. Comput. Phys., 1 (2006), pp. 701-715.

Published online: 2006-01

Preview Full PDF 105 565
Export citation
  • Abstract

Two algorithms for dwell time adjustment are evaluated under the same polishing conditions that involve tool and work distributions. Both methods are based on Preston’s hypothesis. The first method is a convolution algorithm based on the Fast Fourier Transform. The second is an iterative method based on a constraint problem, extended from a one-dimensional formulation to address a two-dimensional problem. Both methods are investigated for their computational cost, accuracy, and polishing shapes. The convolution method has high accuracy and high speed. The constraint problem on the other hand is slow even when it requires larger memory and thus is more costly. However, unlike the other case a negative region in the polishing shape is not predicted here. Furthermore, new techniques are devised by combining the two methods.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • References
  • Hide All
    View All

  • BibTex
  • RIS
  • TXT
@Article{CiCP-1-701, author = {S. Satake, K. Yamamoto and S. Igarashi}, title = {High-accuracy Polishing Technique Using Dwell Time Adjustment}, journal = {Communications in Computational Physics}, year = {2006}, volume = {1}, number = {4}, pages = {701--715}, abstract = {

Two algorithms for dwell time adjustment are evaluated under the same polishing conditions that involve tool and work distributions. Both methods are based on Preston’s hypothesis. The first method is a convolution algorithm based on the Fast Fourier Transform. The second is an iterative method based on a constraint problem, extended from a one-dimensional formulation to address a two-dimensional problem. Both methods are investigated for their computational cost, accuracy, and polishing shapes. The convolution method has high accuracy and high speed. The constraint problem on the other hand is slow even when it requires larger memory and thus is more costly. However, unlike the other case a negative region in the polishing shape is not predicted here. Furthermore, new techniques are devised by combining the two methods.

}, issn = {1991-7120}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/cicp/7975.html} }
TY - JOUR T1 - High-accuracy Polishing Technique Using Dwell Time Adjustment AU - S. Satake, K. Yamamoto & S. Igarashi JO - Communications in Computational Physics VL - 4 SP - 701 EP - 715 PY - 2006 DA - 2006/01 SN - 1 DO - http://dor.org/ UR - https://global-sci.org/intro/cicp/7975.html KW - AB -

Two algorithms for dwell time adjustment are evaluated under the same polishing conditions that involve tool and work distributions. Both methods are based on Preston’s hypothesis. The first method is a convolution algorithm based on the Fast Fourier Transform. The second is an iterative method based on a constraint problem, extended from a one-dimensional formulation to address a two-dimensional problem. Both methods are investigated for their computational cost, accuracy, and polishing shapes. The convolution method has high accuracy and high speed. The constraint problem on the other hand is slow even when it requires larger memory and thus is more costly. However, unlike the other case a negative region in the polishing shape is not predicted here. Furthermore, new techniques are devised by combining the two methods.

S. Satake, K. Yamamoto & S. Igarashi. (1970). High-accuracy Polishing Technique Using Dwell Time Adjustment. Communications in Computational Physics. 1 (4). 701-715. doi:
Copy to clipboard
The citation has been copied to your clipboard