近似多項式 的英文怎麼說

中文拼音 [jìnsìduōxiàngshì]
近似多項式 英文
approximation polynomial
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 項 : Ⅰ名詞1 （頸的後部） nape （of the neck） 2 （款項） sum （of money） 3 [數學] （不用加、減號連接...
  • 式 : 名詞1 （樣式） type; style 2 （格式） pattern; form 3 （儀式; 典禮） ceremony; ritual 4 （自然科...
  • 近似 : approximate; similar; approach; approximation; roughness; propinquity
  1. The experiments show that the performance of our method is similar to the ye - 0. 699 algorithm, which is the best approximate algorithm in polynomial time. but our method can effectively solve the max - bisection problem with a large scale. 2

    數值實驗表明，該方法與ye - 0 . 699近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異
  2. The analysis of randomness of local stress and strain in strain - based fatigue was studied, the approximate polynomial method was proposed

    探討了應變疲勞的局部應力應變的隨機性分析，提出了近似的多項式擬合法。
  3. In order to calculate easily and do n ' t influence the single - chip microcomputer ' s calculate velocity, we put forward two scheme to deal with the numerical value, one is to use a simple function to close or approach a normal function f ( x ) ( mainly is lagrange ' s intepolation, newton ' s intepolation, hermite ' s intepolation, cubic spline interpolation, etc. ) the other one is function approach ( mainly is chebyshev ' s polynomic. legendre ' s polynomic, laguerre ' s polynomic, method of least squares, etc. ), we analyze and compare the lagrange ' s intepolation and chebyshev ploynomic, at last, we select the chebyshev polynomic to do the value calculating on single - chip microcomputer

    提出了數值處理的二種方案。即用簡單函數近似或逼近一個一般函數f （ x ） （主要有拉格朗日插值、牛頓插值、埃爾米特插值、三次樣條插值等）和函數逼近（主要有切比雪夫多項式、勒讓德多項式、拉蓋爾多項式、最小二乘法等） ，對上述兩個方案中的典型函數?拉格朗日插值和切比雪夫多項式進行了分析比較，最後選取切比雪夫多項式完成單片機上的數值計算。
  4. This article describes the development process of surrogate models and introduces some experiment design methods and approximation approaches that can be used for a mdo surrogate model, they are full factorial experiment design, orthogonal experiment design, uniform experiment design, central - composite experiment design, and polynomial response surface method, kriging method, radial basis function method and artificial neural network

    為此本文中分別介紹了正交試驗，均勻試驗以及中心復合試驗等幾種試驗設計方法，以及多項式響應面， kriging ，和徑向基函數等幾種數學近似方法。並且通過構造描述機翼展向升力分佈的代理模型，對上述幾種方法作了對比分析。
  5. The approximate polynomial method was based on neuber ' s method, the cyclic stress - strain responses and neuber ' s rule were treated as probabilistic curves, and the statistic characteristic was obtained from the approximate polynomial. the method is fast and easy for engineering application

    近似的多項式擬合法在諾伯法的基礎上，將循環應力應變曲線和諾伯雙曲線視為概率曲線，通過建立近似多項式的方法，求得局部應力應變的統計特性，快速簡便，適合工程應用。
  6. The image inverse filtering with polynomial approximation and the image recovery in spatially variant systems

    用多項式近似的圖象逆濾波及空間移變系統圖象的恢復
  7. 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曲面的降階逼近的「整體法」 。
  8. 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曲線顯式一次性降多階的近似最佳逼近為目標進行了研究
  9. 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格式基於近似理論，採用自適應基架技術（即自動選取所有基架中相對最為光滑的基架） ，對網格平均值構造分段光滑的高階多項式來獲得高階空間精度，同時保證格式在間斷附近具有基本無振蕩性質。
  10. We discuss the connection between the accuracy of approximate matrix and the degree of interpolating polynomials and study the method of estimating the accuracy of the numerical solution

    我們討論了近似矩陣的精度與插值多項式的階數的關系，討論了近似解的精度的估計方法。
  11. So, we put forward an optimized exponential algorithm in which the multiplication with itself was substituted mostly by square. through expanding of composition fields, the time consuming of optimal algorithm is, where n is the number of bits of exponential

    通過對演算法的分析我們可以得出結論，隨著復合域的不斷增大，域上指數運算所需的時間可近似表示為，式中n為指數以二進製表示時的比特串長度，為域元素進行多項式相乘所需的時間。
  12. The best combination of size parameters of supported domain and sub - domain is obtained. upwind scheme is developed to eliminate the instability of solutions obtained by using mlpg approach. 2

    分析了試函數構造的近似方法、節點和輔助點數量、多項式基函數位數和支撐域尺度對數值模擬結果的影響。
  13. In the analysis process, the six main peaks in 88 - 100 kev region, including the y peaks of 234th, the k peaks of th and the k peaks of u, are chosen. the smoothly joined gaussian function and low energy exponential tail is taken as peak shape function and quadratic polynomial is taken as background function. the two functions are fitted to gether to calculate the peak area

    在分析過程中，選擇了88 - 100kev能區的~ （ 234 ） th的射線峰， th的k _射線峰以及u的k _射線峰共六個主要能峰，通過採用高斯函數和低能指數尾部光滑聯接的峰形函數和二次多項式本底函數一起擬合，來求出峰面積；而該能區所有能峰的探測效率可以認為是近似相等的，由此得到鈾富集度。
  14. Unknown displacement jumps in the equations are approximated with the products of the fundamental density functions and polynomials, in which the fundamental density functions are expressed with exact solutions of the two - dimensional interface cracks due to axial - symmetries of the problems herein

    方程中的未知位移間斷近似表示為基本密度函數與多項式之積，其中基本密度函數考慮到問題的對稱性用二維界面裂紋精確解表示。
  15. Polynomial - time approximation schemes ( ptas ) : a ptas is a family of algorithm { a | > 0 } such that for any fixed > 0, a runs in time polynomial in the length of the input and gets a solution with an objective value which is at most 1 + e times of the optimum

    若每次修正後，實例的目標函數值不超過原來的1 + o （ ）倍，我們稱修正費用不超過1 + o （ ） 。 ptas演算法：若演算法列{ a _ }對于問題的任一個例子都是1 +近似演算法，計算次數是問題大小的多項式（將視為常數） ，稱它為ptas演算法。
  16. In this paper, three correlative results are given : 1 ) the average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q. 2 ) the average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges. 3 ) the average crossing number of r - regular graphs greater than that of non - regular graphs within given vertices and edges where n is odd or r < n / 2

    並得出相關的規律： 1 ） n個頂點q條邊的單二連通分支圖的平均交叉數aac （ n ， q ）可近似地表示為q的二次多項式， 2 ）在給定頂點數n與邊數q的單二連通分支圖中圍長較大的圖的平均交叉數大於圍長較小的圖的平均交叉數， 3 ）在給定頂點數n與邊數q的單二連通分支圖中當n為奇數或r n / 2時， r正則圖的平均交叉數大於非r正則圖的平均交叉數。
  17. Based on tabu search, a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem, which provides an approach to control the optimizing process flexibly

    基於tabu搜索設計了變鄰域結構的局部搜索技術，提供了靈活控制尋優過程的途徑;全多項式時間復雜性近似策略的開發，使得0一1背包問題的求解成為了n戶c問題近似演算法設計中最為成功的範例。
  18. Two - order enhanced un - split finite volume euler method for multi - fluid flow, which combines the roe approximate riemann solver, is developed to simulate the multi - fluid interactions, such as the fluid described by polynomial eos, stiffen gas eos, jones - wilkins - lee ( jwl ) gaseous explosive eos, cochran - chan ( cc ) solid explosive eos and hom shock wave eos, etc. numerical results of the id, 2d and 3d multi - fluid interaction examples show that the high - resolution method and interface capturing equations can resolve the multi - fluid flow correctly and successfully. a simple fluid - mixture type ppm algorithm for multi - fluid flow, which is based on vof interface capturing method and resolved by langange / remap two steps, is developed to simulate the high density or high pressure ratio flow at both sides of the interface

    本文提出了實用於多介質流體的增強型二階精度有限體積歐拉數值計算方法，採用roe方法近似求解riemann問題，可以適用於多項式狀態方程、 「 stiffengas 」狀態方程、 jones - wilkins - lee爆轟產物狀態方程、 cochran - chan固體炸藥狀態方程以及hom狀態方程等，並對多介質流體相互作用的一維、二維、三維問題進行數值計算，數值驗證了本文給出的高精度差分格式和界面捕捉方法的正確性，兩種方法耦合形成的多介質流體數值計算方法是成功的。
  19. 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

    摘要把工件之間不帶前後約束的延誤排序的后移演算法移植到帶有前後約束的情況，提出一個多項式時間的近似演算法。
  20. This feature reflects the physical phenomenon of breaking of waves and development of shock waves. in the fields of fulid dynamics, ( 0. 2. 1 ) is an approximation of small visvosity phenomenon. if viscosity ( or the diffusion term, two derivatives ) are added to ( 0. 2. 1 ), it can be researched in the classical way which say that the solutions become very smooth immediately even for coarse inital data because of the diffusion of viscosity. a natural idea ( method of regularity ) is obtained as follows : solutions of the viscous convection - diffusion pr oblem approachs to the solutions of ( 0. 2. 1 ) when the viscosity goes to zeros. another method is numerical method such as difference methods, finite element method, spectrum method or finite volume method etc. numerical solutions which is constructed from the numerical scheme approximate to the solutions of the hyperbolic con - ervation laws ( 0. 2. 1 ) as the discretation parameter goes to zero. the aim of these two methods is to construct approximate solutions and then to conside the stability of approximate so - lutions ( i, e. the upper bound of approximate solutions in the suitable norms, especally for that independent of the approximate parameters ). using the compactness framework ( such as bv compactness, l1 compactness and compensated compactness etc ) and the fact that the truncation is small, the approximate function consquence approch to a function which is exactly the solutions of ( 0. 2. 1 ) in some sense of definiton

    當考慮粘性后，即在數學上反映為（ 0 . 1 . 1 ）中多了擴散項（二階導數項） ，即使很粗糙的初始數據，解在瞬間內變的很光滑，這由於流體的粘性擴散引起，這種對流-擴散問題可用古典的微分方程來研究。自然的想法就是當粘性趨于零時，帶粘性的對流-擴散問題的解在某意義下趨于無粘性問題（ 0 . 1 . 1 ）的解，這就是正則化方法。另一辦法從離散（數值）角度上研究僅有對流項的守恆律（ 0 . 1 . 1 ） ，如構造它的差分格式，甚至更一般的有限體積格式，有限元及譜方法等，從這些格式構造近似解（常表現為分片多項式）來逼近原守恆律的解。
分享友人
分享到 Line

分享到臉書