Other operations are defined in terms of four - byte words . addition , as usual , corresponds with the simple bitwise exor at the byte level . in the polynomial representation , multiplication in gf 2 如果它是遠(yuǎn)程安裝的,即使已經(jīng)由文件系統(tǒng)重新命名了,它也可以讓基于inode的psid /對(duì)象映射表跟蹤文件。
The method employs a recently developed direct optimization technique that uses a piecewise polynomial representation for the state and controls , thus converting the optimal control problem into a nonlinear programming problem . the method is remarkably robust to initial guesses , which is better than traditional method 這種方法利用了近些年來(lái)發(fā)展起來(lái)的直接優(yōu)化技術(shù),用分段多項(xiàng)式來(lái)表示整個(gè)軌道的狀態(tài)和控制向量,將最優(yōu)控制問(wèn)題轉(zhuǎn)化為非線性規(guī)劃問(wèn)題來(lái)研究。
In the computational methods of tpbvp , in order to reduce some difficulties involved in solving a tpbvp via adjoint variables , we discuss a direct method in which state and control variables are indirectly parameterized , the method employs a recently developed direct optimization technique that uses a piecewise polynomial representation for the state and control variables , thus converting the optimal control problem into a nonlinear programming problem , which can be solved numerically . it makes the initial iterative variable more easy to be determined 在數(shù)值解法中,為了減少解決兩點(diǎn)邊值問(wèn)題共軛變量帶來(lái)的困難,主要討論了將狀態(tài)變量和控制變量進(jìn)行參數(shù)化的一種直接方法,這種方法采用了近段發(fā)展起來(lái)的使用分段的多項(xiàng)式來(lái)代替狀態(tài)和控制變量的直接優(yōu)化方法,然后最優(yōu)控制問(wèn)題就轉(zhuǎn)化成可以用數(shù)值方法解決的非線性規(guī)劃問(wèn)題,使得迭代初值更加容易選取。