Algorithm for Spatial Straightness Evaluation Using Theories of Linear Complex Chebyshev Approximation and Semi-infinite Linear Programming
2005 ◽
Vol 128
(1)
◽
pp. 167-174
◽
Keyword(s):
This paper presents a novel methodology for evaluating spatial straightness error based on the minimum zone criterion. Spatial straightness evaluation is formulated as a linear complex Chebyshev approximation problem, and then reformulated as a semi-infinite linear programming problem. Both models for the primal and dual programs are developed. An efficient simplex-based algorithm is employed to solve the dual linear program to yield the straightness value. Also a general algebraic criterion for checking the optimality of the solution is proposed. Numerical experiments are given to verify the effectiveness and efficiency of the presented algorithm.
2004 ◽
Vol 126
(3)
◽
pp. 535-541
◽
Keyword(s):
2014 ◽
Vol 42
(1)
◽
pp. 16-20
◽
2012 ◽
Vol 490-495
◽
pp. 1888-1892
Keyword(s):