chebyshev approximation 中文意思是什麼

chebyshev approximation 解釋
切比雪夫逼近
  1. On the basis of analyzing the several traditional algorithms, the efficient design method, the self - initiated weighted least squares ( swls ) combined with adaptive simulated annealing ( asa ), are proposed explicitly for the design of pif. this chebyshev criterion based optimal approximation method has not only very fast computing speed but also high accuracy and good controllability

    在對這些演算法特性分析比較的基礎上,系統完整地提出適用於lcos投影分合色偏振干涉濾光片設計的最高效方法? ?自啟動權值最小二乘演算法( swls )結合自適應模擬退火演算法( asa ) 。
  2. The other, called " integral method ", is got by converting the problem to degree reduction of bi - variable polynomials with upper bounds using approximation theory and the relationships between chebyshev bases and bernstein bases

    另一個是將問題轉化為二元多項式的保上界降階問題,再由近似逼近理論和chebyshev基與bernstein基的轉換關系,求得區間有理bezier曲面的降階逼近的「整體法」 。
  3. The author ' s work gives new way, which is beneficial to real time interaction and can efficiently reduce computing time as well as data storage amount. these algorithms can find good use in numerical machining, robotics, form - position tolerance and computer graphics. ( 3 ) degree reduction for nurbs curves and surfaces by applying the theory of the best uniform approximation of chebyshev polynomials and the explicit matrix representation of nurbs curves, this thesis centers on the research of the explicit nearly best approximation of multi - degree reduction of nurbs curves

    以上關于等距曲線的幾何逼近與代數逼近的演算法改革了當前國際圖形界只能對基曲線沿法矢方向平移定距離的點作近似逼近的固定模式,創造了利於交互操作,能有效地減少計算量及數據存儲量的新方法,可在數控加工、浙江大學碩士學位論文機器人、形位公差學、計算機圖形學中獲得很好的應用( 3 ) nurbs曲線曲面降階應用nurbs曲線的顯式矩陣表示及chebyshev多項式逼近理論,以實現nurbs曲線顯式一次性降多階的近似最佳逼近為目標進行了研究
  4. Then the unified approach can be applied to it to acquire the ensemble random evolutionary response. since the normal probability density function ( pdf ) may lead to instability of some sample systems when the random parameters taking sufficiently small negative values, an arch - like pdf and a more adaptable - pdf, together with the matching chebyshev polynomial approximation and gegenbauer polynomial approximation, are suggested. numerical examples show that the suggested methods are effective

    相比較而言,隨機模擬法的結果無疑是最可靠的,但是它的計算量嫌大;隨機攝動法的計算量遠小於隨機模擬法,但是它要求隨機攝動量必須是一個小量;正交展開法的計算精度好於隨機攝動法,其得到結果與隨機模擬法得到的結果幾乎吻合,其計算量略多於隨機攝動法,但與隨機模擬法相比要少的多,不過計算前的準備工作較費時。
分享友人