approximation by polynomial 中文意思是什麼

approximation by polynomial 解釋
多項式逼近
  • approximation : n. 1. 接近；近似。2. 【數學】近似值。3. 概算，略計。
  • by : adv 1 在側，在旁，在附近。2 （擱）在一邊，（放）到旁邊，（存）在一旁；收著。3 （由旁邊）經過，過...
  • polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
  1. We compare the approximation of an analytic function f by its taylor polynomial and its poisson partial sum with the same number of terms and illustrate that for functions with limit zero at infinity and for bounded functions the poisson expansion provides a better approximation to the function than the taylor expansion

    在第三章中，介紹了rb曲線與poisson曲線的概念以及基本的幾何性質，指出了poisson基函數與有理bernstein基函數之間存在的關系，並且將解析函數的taylor逼近與poisson逼近進行比較。實例表明，對于在無窮遠處極限為0的函數以及有界函數， poisson逼近比taylor逼近效果要好。
  2. The parametric speed of the curve is firstly approximated by the bezier polynomial which takes the lengths of control polygon ' s edges of the direction curve of normal as bezier coordinates. then the corresponding geometric offset approximation algorithm is given. moreover, an offset approximation with high precision is obtained by degree elevation of the direction curve of normal

    首先利用以法矢方向曲線的控制多邊形邊長為b zier縱標的b zier多項式來逼近曲線的參數速度，給出了相應的幾何等距逼近演算法，進一步結合法矢方向曲線的升階獲得了高精度逼近
  3. Eno schemes are based on the approximation theory, which achieve high - order spatial accuracy by reconstructing piecewise smooth high - order approximate polynomial from the cell - averaging values. during the reconstruction, adaptive stencil technology, which automatically chooses the relatively smoothest stencil from all possible stencils, is adopted to guarantee essentially non - oscillation near the discontinuity

    Eno格式基於近似理論，採用自適應基架技術（即自動選取所有基架中相對最為光滑的基架） ，對網格平均值構造分段光滑的高階多項式來獲得高階空間精度，同時保證格式在間斷附近具有基本無振蕩性質。
  4. By orthogonal polynomial approximation method, we first reduce the random system into its deterministic equivalent one, so the response problem of a random system can be transformed into that of a deterministic system

    有關上述gegenbauer多項式方法在隨機振動問題中的應用，現有文獻中尚未見報道。上述三種方法都可以用於求解隨機結構的演變隨機均方響應問題。
  5. For the total tardiness scheduling with precedence constraints, an approximation algorithm with polynomial complexity was presented by transplanting the backward - shift algorithm of the case without precedence constraints

    摘要把工件之間不帶前後約束的延誤排序的后移演算法移植到帶有前後約束的情況，提出一個多項式時間的近似演算法。
分享友人
分享到 Line

分享到臉書