iteration function 中文意思是什麼
iteration function
解釋
迭代函數-
On each step of iteration, no trigonometric function is used, and only four multiplications for cardioid curve are required
迭代過程中避免了三角函數的運算，每步僅需4次（心臟線）乘法運算。 -
In each iteration, no trigonometric function is used and only two multiplications are required. by taking the advantage of symmetry, only the points in one octant are need to be generated
該演算法避免三角函數的運算，每步僅需兩次乘法，並且充分利用對稱性只計算一個八分象限的點。 -
Conclusion r1 represent pixel - value of original image range block, r represent mean - value of original image range block, d represent mean - value of original image domain block, d1 represent pixel - value of resumptive image domain block, d represent mean - value of resumptive image domain block. superior perfermance of resumptive image range block is obtained as compared to conventional creative function by one iteration, that is,
） ， d _ i （ i = 1 ， 2 ， … ， n ）分別為某一恢復圖像定義域塊的均值和每一像素的像素值，我們用傳統的和改進的生成函數分別進行一次迭代，則用改進的生成函數進行迭代的恢復圖像每一值域塊的效果較好，即： -
With the numerical iteration method we use the hnc integral equations to calculate the direct correlation function c ( r, t, p ) and the total correlation function h ( r, t, p ) in a soft - sphere ionic fluid which something like the system of the alkali - metal salts
我們採用迭代方法用超網鏈積分方程組計算了一種類似於堿金屬鹽的軟球離子液體系統的直接關聯函數c （ （ ? ） ， t ， ）和總關聯函數h （ （ ? ） ， t ， ） 。 -
Compared with normal weight selection method, the new method can reduce the iteration times of weight function selection, and ensure the synthetical performance of the resulting h ( subscript ) loop shaping controller
與常規的權重函數選取方法相比，該方法能夠減少權重函數選取時迭代的次數，保證控制器的綜合性能。 -
The smaller the value of the merit function is, the closer the iteration point is to the solution
當價值函數的值越小時，迭代點越靠近最優解。 -
For problems whose objective function or constraint functions have sharp curves on their contour maps ( such as the rosenbrock ' s function which has banana shape contours ), monotonicity may cause a series of very small steps, causing a huge number of iteration to reach their solutions. by using the nonmonotone technique, we get the sequence of successful interative point which should make the objective function mono - tonically decreasing. hence, we use both trust region strategy and line search technique and make each iterate generate an acceptable trial step in interior feasible set as next interative point
我們利用非單調技術得到使目標函數非單調下降的迭代點，因為非單調克服高度非線性化函數的求解問題，從而避免了只使用單調搜索在「峽谷」現象局部最優解被卡的情況，我們用信賴域策略和非單調線搜索技術相結合的方法，使演算法產生的迭代步落在可行域內點，同時又在信賴域內滿足接受準則。 -
The hydraulic hitch is the common means that the operator be joined with the prime motor in farm machine. the paper made the hitch ? vector equation and found the solutions by newton iteration method through the strong numerical calculation function of computer. so the analytical solution insteaded the graphic method, the design accuracy and efficiency were acceptable
本研究推導了懸掛機構的矢量方程，並藉助于計算機強大的數值計算功能，用牛頓迭代法解決了解矢量方程的問題，從而用解析法取代了圖解法設計此類機構，提高了設計精度和效率。 -
To assure astringency, some technologies have been used such as iterative penality function methods, assemblage mass matrix, reduced integration algoritlun, newton iteration method with parameters for non - linear equation set, introducing relax factors and double steps solution and so on, and an algorithin for solving the nonlinear equation set of flow field by fem has been presented
基於有限元法建立了流場求解列式，為保證其收斂性，採用了迭代罰函數法，集中質量矩陣，縮減積分計算，帶參數的newton迭代求解，引入松馳因子及雙層解法等技術，提出了一套適合流場有限元方程計算的非線性方程求解方法。 -
Abstract aiming at the defects of diffusion function with lower diffusing speed and needing multiple round iteration to resist differential attack in the image encryption algorithm based on chaotic block cipher, a new chaotic image encryption algorithm based on output ? cryptograph mixed feedback was proposed
摘要針對現有基於混沌分組密碼的圖像加密演算法中，擴散函數擴散速度慢、需要多輪迭代才能抵抗差分攻擊的缺點，提出了一種新的基於密文和輸出混合反饋的混沌圖像加密演算法。 -
The thesis uses 0 - 1 integer linear programming to construct algorithm - hardware mapping models. based on bounds of data flow graph proposed by barwell and hodges, cost function combining iteration periodic bound with periodic delay bound and several constraints are proposed
根據已提出的數據流圖的界，確定規劃和映射模型的目標函數，即最小化循環周期界和周期延遲界，進而建立規劃和映射問題的一系列的約束條件。 -
The fipwa based on electric integral equation ( efie ) is presented firstly, the green ’ s function expansion with sommerfeld identity ( based on bessel kernel ) is studied and the msdp for two cases is formulated. in order to improve the iteration property and avoid inner resonance, the combined field integral equation ( cfie ) fipwa is then constructed successfully
首先研究了基於電場積分方程的快速非均勻平面波演算法，對索末菲恆等式（基於貝塞爾積分核）展開的格林函數進行了深入研究，分兩種情形解決了修正最陡下降路徑的設計問題。 -
First of all, the algorithm base on the boundary problem of helmholtz equation and finite - difference technique, calculate the field in “ cold ” cavity and disperse the helmholtz equation, as a result of the formula : ax = x. secondly, according to the eigenvalue of matrix theory and applied iterative methods, eigenmode adopt a numerical approach which allows the improved chebyshev polynomial iteration which based on the power method to extract the isolated eigenmode in the spectrum. finally, we resolve the problem of compatibility in software and insert the eigenmode module into the chipic which will have the function of eigenmode analysis
具體的說: （ 1 ）首先以電磁理論中的亥姆霍茲方程的邊值問題理論和計算電磁學中的有限差分法為基礎，計算冷腔中的場分佈並離散亥姆霍茲方程，得到標準的本徵值問題: ax = x ; （ 2 ）然後根據矩陣理論中的eigenvalue問題和數值計算中的迭代方法，採用改進后的chebyshev多項式，在power迭代法的基礎上對ax = x進行多項式迭代，實現對頻譜中孤立本徵模的萃取; （ 3 ）最後將用fortran語言編制的eigenmode模塊加入到chipic軟體中，解決了eigenmode模塊與chipic主代碼的兼容問題，從而實現了chipic軟體的模式分析功能。 -
In a password - based key derivation function, the base key is a password and the other parameters are a salt value and an iteration count
在基於密碼的密鑰派生功能中，基本密鑰是一個密碼，其他參數是一個salt值和一個迭代次數。 -
By studying the solution to generalized effective medium satori resistivity model in laminated and dispersed shaly sand, it shows that there is a local minimum of the function about w derived from the model in the range from 0 to, and the w corresponding to the minimum varies with or w as well as other parameters, therefore, in order to ensure the iteration convergence, here, we adopt a hybrid algorithm combining newton and bisection, and the calculated result shows that using the hybrid algorithm to solve the equation about w is convergent. it is pointed out that shale distribution largely affects water saturatio n predicted by this model
通過研究混合泥質砂巖有效介質通用satori電阻率模型的求解方法，表明模型導出的關于_ w函數在0 -區間內存在一個局部極小值，且該極小值點對應的_ w隨或_ w及其他參數的變化而變化，因此，為了保證迭代收斂，採用牛頓和二分結合的混合迭代演算法，試算結果表明利用牛頓和二分混合迭代演算法求解關于_ w的方程是收斂。 -
The cnn with based - term will be restudieiin chapter 3. under certain parameters, the stationary solutions " iteration map is topological conjugate to a beruonulli shift of certain symbolic space. moreover, the spatial entropy function of the map is two - dimensional and can be obtained explicitly as a space devil - staircase
在本文第三部分，我們在閾值非零的情況下，重新對其定態解誘導的一維迭代映射進行了細致分析，得知在不同的參數范圍內，迭代映射拓撲共軛于不同的符號空間的有限子移位。 -
In this article we discuss the methods of 3d tree modeling by iteration function system ( ifs ) and l system based on the fractal. at the same time, we compare the two methods from the application of tree modeling in 3d cis and give the class definition of tree object from the object oriented point of view, in order that the tree object can be applied in 3d gis. all this research find a new and effective way for the visualization of tree in 3d gis
同時，針對樹木實體在3dgis中的應用，對兩種建模方法進行比較，確定l系統是3dgis中構建樹木實體的最佳方法，並從面向對象角度出發，給出基於l系統的樹木實體類，從而使樹木實體作為3dgis中的對象之一融合到系統之中，為3dgis領域中關于樹木實體的表達尋找到一條新的而且是更有效的解決途徑。 -
Earlier in 1900s p. fatou and g. julia indepently developed iteration theory of a complex function, from then on, the thoery of the dynamics system of complex function has developed about one hundred years
自二十世紀一，二十年代， p . fatou和g . julia對復解析動力系統的開創性的研究工作以來，復解析動力系統的研究一有近百年的歷史了。 -
Period and attractive point of self - iteration for linear fractional function
線性分式函數的自迭代周期與吸引子 -
The inner product of the mapping value of the original data in feature space is replaced by a kernel function, and the weights of each neuron can be initialized and updated by initializing and updating the combinatorial coefficient vector of each weight in the algorithm of ksom, so some intuitive and simple iteration formulas are obtained
該演算法以核函數代替原始數據在特徵空間中映射值的內積，並且神經元權值向量的初始化和更新都可由其組合系數向量表示，從而獲得了直觀而簡單的迭代公式。
分享友人