polynomial number 中文意思是什麼

polynomial number 解釋
多項式數
  • polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
  • number : n 1 數；數字；〈pl 〉算術。2 （汽車等的）號碼；第…，第…卷，第…期〈通常略作 No （復數 Nos ），用於...
  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 number a is called a double root of the polynomial function f.

    數a稱為多項式函數f的二重根。
  3. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  4. Would require a super - polynomial number of samples. finally, the learnability of a concept class

    的閉包也具有同樣的性質。
  5. In the third chapter, making use of the results about abel equation, we discuss the existence, number and stability of the limit cycles of polynomial systems. the relative work of shui shuliang and cai suilin is generalized

    第三章利用abel方程已有的結果來討論多項式系統的極限環的存在性，個數和穩定性，推廣了水樹良和蔡燧林的相關工作。
  6. In the terms of interpolation, the image reconstructed from nearest interpolation or linear interpolation has good edge but serious noise ; reconstruction from 4 * 4cubic interpolation or three b - spline or three - order lagrange interpolations has better local character. 2 x 2cubic interpolations which has both better edge and local character is the ideal interpolation, the following is the basic principle during reconstruction : ( 1 ) the more width of interpolation, the more number of summation and the more order of interpolation polynomial, the higher of density resolution ; ( 2 ) the more of interpolation polynomial and width of interpolation, the more of reconstruction time simultaneously, aimed at eliminating the effects of noise contained in projection data, in this paper, author analysis cause and effects of common artifacts. importantly, discusses convolution back - projection reconstruction algorithm with a shift axis of rotation has been derived for correcting images that acquired with a divergence axis of rotation using the fan beam geometry with an angle - equaled detector

    在ct圖像重建時，選擇有限帶寬窗有較好的空間解析度，三角形窗有較好的密度解析度，選擇餘弦窗則使得空間解析度與密度解析度的折衷；從窗函數的頻譜角度來講，可以用於圖像重建的一個良好的卷積窗函數應該具備以下條件： （ ? ）小的3db帶寬b ，即最小的主瓣寬度； （ ? ）最小的旁瓣最大峰值a ； （ ? ）最大的旁瓣峰值衰減速度d ；就內插函數而言，臨近點內插與線性內插重建圖像噪聲大，但有較好的邊緣與細節； 4 4三次內插、三次b -樣條與四次拉格朗日多項式內插圖像平滑，局部特性較好。
  7. Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed

    為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。
  8. In this paper, it s applications were explained from seven different fields, the common zeros of two polynomials, the multiplicities of roots and the discrimination of a polynomial, searching the equations suitable for a algebraic number, implicating a rational curve over the plane, computing the zeros of a nonlinear algebraic equation and gathering the discrimination surface of the sas in automated theorem proving on inequalities

    本文從7個方面闡述了結式的應用，包括判斷2個多項式的公共零點，判定多項式是否有重根，計算多項式的判別式，尋找代數數滿足的方程，平面有理曲線的隱式化，非線性代數方程組求解和不等式機器證明中半代數系統邊界曲面的獲得等。
  9. In the stochastic hill - climbing, the number of climbing is an important parameter, and is different to get a good value. this paper use experimental technique to settle this question. it use the least square method find a polynomial empirical formula, which can compute the number of climbing

    另外，針對savior演算法中隨機爬山法爬山次數難以確定的問題，本文採用多項式最小二乘擬合，利用實驗方法得到了問題規模和隨機爬山法合理爬山次數間的經驗公式。
  10. An estimation of the number of generators of an ideal in a polynomial ring with two variables

    二元多項式環中理想生成元個數的估計
  11. In the first part, hilbert ' s 16th problem and the studies on it are introduced, and the results of zq - equivariant vector fields of degree 5 ( q = 2, 3, 5, 6 ) are given. in the second part, the definitions of zq - equivariant vector fields and the method of detection functions are stated, and all the forms of nontrivial zq - equivariant planar polynomial vector fields of degree 7 are obtained. in the third part, a concrete numerical example of zt - equivariant perturbed planar hamiltonian system of degree 7 is constructed, and for the unperturbed vector field having maximal number of centers, its global phase portraits are analyzed ( having at least 9 topologically different phase portraits ). then, for a given parameter group, its phase portrait trend is studied

    第一部分介紹了hilbert第16問題以及它的研究與發展現狀，給出了近年來利用李繼彬提出的判定函數法得出的z _ q -等變（ g = 2 ， 3 ， 5 ， 6 ）的5次系統關於它的第二部分的研究結果；第二部分介紹了z _ q -等變向量場以及判定函數法，給出了7次平面多項式系統的所有非平凡z _ q -等變向量場具有的形式；第三部分給出了一個7次平面擾動hamilton系統，研究了它的具有最大中心數的未擾動系統（ z _ 7 -等變）的全局象圖，得到了9種不同的拓撲圖形。
  12. ( 5 ) the constructively sufficient conditions of the approximating c1 functions and the explicit formula dealing with the approximation precision and the number of fuzzy rules are given for one kind of general fuzzy systems, using the methods different from the former ones which are based on the stone - weierstrass theory, therefore, the constructively sufficient conditions are also generalized from polynomial function to c1 function

    （ 5 ）針對一類一般的模糊系統，採用與通常的基於stone - weierstrass定理證明模糊逼近器不同的方法，首次給出了它們逼近c ~ 1函數的構造性充分條件，並給出了逼近精度與模糊規則條數之間關系的顯式表達式
  13. The parameters include generator polynomial of component codes, interleave length and the type of interleavers, iterative decoding algorithms and iteration number, code rates and channel models et al

    這些參數主要包括分量碼、交織長度和交織器類型、迭代譯碼演算法和譯碼迭代次數、編碼速率以及通道條件等。
  14. Furthermore, the vertex - neighbor - scattering number of trees is discussed in details. the main contents of chapter 4 are the introduction of edge - neighbor - scattering number of graphs, the edge - neighbor - scattering number values of several simple graphs and a polynomial algorithm of the edge - neighbor - scattering number of trees

    第四章主要定義圖的邊鄰域離散數，給出一些基本圖的邊鄰域離散數值，圖的邊鄰域離散數的界，樹的邊鄰域離散數的一個多項式演算法。
  15. Methods of exploring the real number roots of a real coefficient polynomial function are procedurally given

    摘要較程序化地給出了實系數多項式函數實數根的求法。
  16. 3. by using the techniques of an explicit criterion to determine the number of real roots of a univariate polynomial in ( [ 13 ], [ 73 ] ) ; b - net form of bivariate splines function ; discriminant sequence of polynomial ( cf. [ 13 ], [ 73 ] ) and the number of sign changes in the sequence of coefficients of the highest degree terms of sturm sequence, this paper determines the number of real intersection points two piecewise algebraic curves whose common points are finite. a lower bound of the number of real intersection points is obtained in terms of method of rotation degree of vector field

    大連理工大學博士論義：分片代數價線i片代數簇的若十m穴3 ：利用楊路，張景中，侯曉榮在文獻v13 ， 73 ）中關於一元多項式實根的顯式判準，以及二元樣條函數的b網形式，多項式的判別序列和sturm序列的最高次數項系數序列的變號數，本文給出了兩個分片代數曲線的丈交點數（假設公共點是有限的）的計算公式。
  17. Bivariate polynomial trans - forms on rational number field

    有理域上的二元多項式變換
  18. An approximation algorithm a2 - 1 with absolute performance ratio 3 / 4 is proposed and the asymptotic performance ratio of a2 - 1 applied to the problem in which machines require prepare times is 2 / 3. another problem is two parallel machines scheduling to maximize the number of just in time jobs. for this problem we give a polynomial time optional algorithm in the case early penalty is larger or equal to late penalty, and it is proofed to be np - had when early penalty is less than late penalty

    第二章所討論的另一個問題是帶提前和延誤懲罰的兩臺機排序極大化justintime完工工件數問題，當提前懲罰大於或等於延誤懲罰時，本文提出了該問題的一個多項式時間最優演算法a _ （ 2 - 2 ） ，從而證明了該問題是一個p問題，當提前懲罰小於延誤懲罰時，我們證明了該問題是一個np難的問題。
  19. Based on the qualitative theoy of differential polynomial system, algorithm to calculate the focal values, the construction of small amplitude limit cycles, hirsch ' s monotone theory and the center manifold theorem etc, we apply mrealroot algorithm to many problems, such as to obtain the real solutions of polynomial systems, to confirm the number of limit cycles in differential system and to construct the limit cycles

    結合平面微分多項式系統的定性理論，計算焦點量的演算法，小擾動極限環的構造， hirsch的單調性理論和中心流形定理等， mrealroot演算法在大量具體問題，包括實根分佈、小擾動極限環個數以及高維系統極限環構造等方面都有廣泛的應用
  20. To obtain the fast matrix - vector multiplication algorithm, we approximate the kernel function with piece - wise polynomial and get the approximate coefficient matrix a using the approximate kernel function. let n be the number of quadrature points and k2 be the number of interpolating knots at each subdomain. it is proved that the construction of a and the matrix - vector multiplication ax require o ( nk ) operations respectively

    我們利用對核函數進行分片多項式插值逼近得到適用於快速方法的近似系數矩陣a ：矩陣a的計算和矩陣-向量相乘ax各需要o （ nk ）次運算，存貯a需要佔用o （ nk ）內存，其中n為積分節點的個數， k ~ 2為每個小區域的插值節點數。
分享友人
分享到 Line

分享到臉書