本論文之目的在於分析不同負荷承載下的線性滑軌系統其力量分布、等效負荷及變形量，同時開發一程式幫助分析各種使用情形幫助機械設計。本論文提供了不同於以往的等效負荷計算方式，能夠更精確的估計滑座使用壽命。
在計算分析時要計算每個滾動體位置的受力，需要反覆的迭代，本論文使用Nelder-Mead algorithm的方法求解，這套系統分為兩部分，第一部分為取得輸入資料，可自由設定不同的使用情況。第二部分為計算，計算出線性滑軌系統的力量分布、等效負荷及變形量。
透過本論文的計算結果與實際實驗結果、以往的計算方式的比較，結果顯示較以往計算方式保守，能給予機械設計更精確的建議，但比較實際結果仍有更多需努力的地方。

The purpose of this thesis is to analyze the load distribution, equivalent load and the deformation of a linear guide system under different loads. It also aims to develop a program that will help users analyze different conditions in mechanical design. To estimate more accurately on the lifetime of the rolling elements of a linear guide, this thesis provides a
different way to calculate equivalent load on the rolling elements.
Repeating iteration is necessary when calculating the force of each rolling element.
Nelder-Mead algorithm is implemented in this thesis and the calculating process is divided into two parts. The first part is to obtain input data under different conditions. The second part is to calculate the load distribution, equivalent load and the deformation of a linear guide system.
The method used in this thesis is more conservative than the traditional approach, but provides more accurate advice and suggestions for mechanical designs of a linear guide system. However, by looking at the actual result, there is still room for further studies and research.

[1] Audet, C. and Dennis, J.E. Jr. (2003), “Analysis of Generalized Pattern Searches” ,SIAM J. Optim. 13, pp. 889-903.
[2] Brändlein, J., Eschmann, P., Hasbargen, L. and Weigand, K. (1985), Ball and Roller Bearing: Theory, Design, and Application (2nd ed.), New Jersey: John Wiley Sons Inc.
[3] Bürmen, A., Puhan, J., and Tuma, T. (2006), “Grid Restrained Nelder-Mead Algorithm”, Comput. Optim. Appl. 34, pp. 359-375.
[4] Coope, I.D. and Price, C.J. (2001), “On the Convergence of Grid-Based Methods for Unconstrained Optimization”, SIAM J. Optim. 11, pp. 859-869.
[5] McKinnon, K.I.M. (1998), “Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point”, SIAM J. Optim. 9, pp. 148-158.
[6] Nelder, J.A. and Mead, R. (1965), “A simplex method for function minimization”, Comput. J., 7, pp. 308-313.
[7] Powell, M.J.D. (1998), “Direct search algortihms for optimization calculations”, in Acta Numerica 1998, A. Iserles (Ed.), Cambridge University Press, Cambridge, UK, pp. 287-336.
[8] Singer, Saša and Singer, Sanja (2004), “Efficient Implementation of the Nelder-Mead Search Algorithm”, Appl. Numer. Anal. Comput. Math. 1, No. 3, pp. 524-534