An algorithm for form error evaluation - using the theory of discrete and linear Chebyshev approximation (Q1191981)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for form error evaluation - using the theory of discrete and linear Chebyshev approximation |
scientific article; zbMATH DE number 63196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for form error evaluation - using the theory of discrete and linear Chebyshev approximation |
scientific article; zbMATH DE number 63196 |
Statements
An algorithm for form error evaluation - using the theory of discrete and linear Chebyshev approximation (English)
0 references
27 September 1992
0 references
The increased availability of coordinate measuring machines which may be interfaced with a computer has led to high interest in the methods for minimum zone evaluation. In the present paper a computer program is developed for features which can be described as a linear function of any number of variables. Examples for straightness, flatness, circularity, sphericity and cylindricity error computation are given. The algorithm based on the theory of linear discrete Chebyshev approximation can be described as a discrete modification of the Remez algorithm. It gives the minimum zone form error due to International Standards Organization (ISO).
0 references
coordinate measuring machines
0 references
minimum zone evaluation
0 references
flatness
0 references
circularity
0 references
sphericity
0 references
cylindricity
0 references
error computation
0 references
linear discrete Chebyshev approximation
0 references
Remez algorithm
0 references
minimum zone form error
0 references
0.8021699786186218
0 references
0.7789657711982727
0 references
0.7640497088432312
0 references