solution set 中文意思是什麼

solution set 解釋
【數學】解集。

  • solution : n. 1. 溶解；溶液，溶體，溶劑。2. （補輪胎用的）橡膠水；〈美國〉藥水。3. 解決，解答 （of; for; to）; 解釋；（數學等的）解法，解式。4. 免除，解除。5. 【醫學】消散，消退。
  • set : SET ＝safe electronic transaction 安全電子交易〈指用信用卡通過因特網支付款項的商業交易〉。n 【埃...
  1. The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation. it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design. the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence, the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample, it assures the sample approach to the pareto optimal solution set in fast convergent speed

    較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的模擬方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳演算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文採用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證演算法始終以較好的速度向pareto最優解集逼近。
  2. Determining the optimal solution set for linear programming in general form

    一般形式線性規劃最優解集的確定
  3. A structure to the solution set of a nonlinear equation on banach manifolds

    流形上一類非線性方程的解集的結構
  4. Connectedness of the solution set of multiobjective optimization with cone quasiconvex set - valued mapping

    錐擬凸集值映射多目標優化的解集的連通性
  5. Because of its hardness, a genetic algorithm is developed with a reduced solution set on its property

    針對模型提出一種改進的遺傳演算法，並根據其特性減少了搜索空間。
  6. The necessary and sufficient condition for centrosymmetric solution of matrix equation was presented and general solutions were obtained. the optimal approximation solution to a given matrix was provided in the solution set

    先討論一類矩陣方程存在中心對稱解的充分必要條件，給出解的一般表達式，並在解集合中給出了與給定矩陣的最佳逼近解。
  7. In the end, when the domain is finite, b is a meet - irreducible element or 6 has an irredundant finite meet - decomposition, a sufficient and necessary condition that the solution set is nonempty is given and the number of distinct minimal solutions is formulated

    最後，當論域為有限集， b為交既約元或有不可約有限交分解時，給出了方程inf _ （ i j ） （ a _ j ， x _ j ） = b解集非空的充要條件以及極大元的個數公式。
  8. In order to determine the solution set of the equation, by the means of meet - irreducible element and irredundant finite meet - decomposition, we first obtain the maximal solutions to the simple equation in the case that b has an irredundant finite meet - decomposition, and then consider the relation between the equation and the equation, based on this, we obtain the maximal solutions to the equation in the case that each element of the matrix b has an irredundant finite meet - decomposition and so determine its solution set completely

    為了確定方程的解集，本文利用交既約元與不可縮短的有限交分解等工具，同樣地先求出簡單形式的型矩陣方程的所有極大解，然後討論方程與方程之間的關系，在此基礎上，在b的每個元素均有不可縮短的有限交分解的情況下，求出了方程的所有極大解，從而完全確定了方程的解集
  9. Secondly, the penalty coefficient may converge to infinity in many situations when the iterative point is closely near the bound of feasible set, while the parameters are bounded if the solution set of constrained optimization is nonempty, which is available for numerical computation

    另外在很多情況下，罰函數法中的罰因子當迭代點接近可行域邊界時趨于無窮大，而參數控制演算法中，只要約束優化問題有最優解，則參數是有界的，這對數值計算是有利的。
  10. Recently, yamashita and fukushima [ 4 ] show that the sequence produced by the levenberg - marquardt method converges quadraticlly to the solution set of the equations, if the parameter is chosen as the quadratic norm of the function and under the weaker condition than the nonsingularity that the function provides a local error bound near the solution. however, the quadratic term has some unsatisfactory properties

    最近yamashita & fukushima [ 4 ]提出，在弱於非奇異性條件的局部誤差界條件下，如果選取的迭代參數為當前迭代點處函數值模的平方，則levenberg - marquardt方法產生的迭代點列二階收斂于方程組的解集。
  11. Further, it is proved that there exists a minimal solution such that for every if the solution set

    進一步，證明了如果方程的解集非空，則解集中的每一解都存在一個大於等於它的極大解。
  12. Please note that since problem set 2 is effectively the beginning of the final project, each student ' s answers will be more or less unique, and therefore no solution set is available

    請注意，由於習題集2實際上就是期末專題的開頭，每個學生的答案或多或少都將是獨特唯一的，因此不提供答案集。
  13. One is, based on answering the above open problem on a finite dimensional euclidean space by means of partially ordered theory, to research the existence of solutions, global error bounds of proximal solutions and sensitivity of parametric unique solutions and present a class of variable - parameter three - step iterative algorithms for generalized set - valued variational inclusion problems by using - resolvent operator of set - valued mapping. two is to consider the convexity, closedness and boundedness of the solution set of general set - valued variational inclusion problems and the sensitivity of the parametric solution set by means of graphical convergence theory. three is to discuss directly the existence of solutions by using analytical methods for set - valued mixed quasi - variational - like inequalities and suggest a class of direct variable - parameter three - step iterative algorithms for solving generalized set - valued variational inclusions

    研究分有三個方面：一是藉助于偏序理論在有限維歐氏空間中解決了上述公開問題，在此基礎上利用集值映射的-預解運算元，研究了廣義集值變分包含問題解的存在性、逼近解的全局誤差界、參數唯一解的靈敏性，並提出了一類變參數三步迭代演算法；二是藉助于圖收斂理論研究了一般集值變分包含問題解集的凸性、閉性和有界性以及參數解集的靈敏性；三是用分析的方法直接討論了集值混合擬類變分不等式問題解的存在性並提出了一類求解廣義集值變分包含問題的直接變參數三步迭代演算法。
  14. Connectedness of the super efficient solution set of multiobjective optimization with cone upper semicontinuous cone quasiconvex set - valued mapping

    錐撓動意義下弱有效解的上半連續性
  15. When / is infinite and 6 is a compact element and with an irredundant finite join - decomposition, it is showed that a sufficient and necessary condition that the solution set is nonempty. it is also proved that there exists a minimal solution if the solution set of the equation sup t ( ai, xi ) = b is nonempty

    當論域為無限集， b為緊元且有不可約有限並分解時，給出了解集非空的充要條件，證明了如果方程sup _ （ i i ） （ a _ i ， x _ i ） = b有解，則一定存在極小解。
  16. In the case of infinite domains, it is proven that there exists a maximal solution x " of a @ x = b such that x * x for every solution x of a @ x = b if the solution set of a @ x = b is unempty and b has an irredundant completely meet - irreducible decomposition. it is also identified that there exists a maximal solution x * of a @ x = b such that x * x for every solution x of a @ x = b if the solution set of a @ x = bis unempty and every component of b is dual - compact and has an irredundant finite - decomposition. in the end, a necssary and sufficient condition that there exists a maximal solution x * of a @ x = bsuch that x * x for every solution x of a @ x = b is given when the solution set of a @ x = b is unempty

    當論域為無限集時，證明了如果方程a @ x = b有解且b有不可約完全交既分解，則對方程a @ x = b的每一個解至少存在一個大於等於它的極大解；進一步證明了如果方程a @ x = b有解且b的每一個分量為對偶緊元並有不可約有限交分解，則對方程a @ x = b的每一個解存在一個大於等於它的極大解；最後給出了對方程a @ x = b的每一個解存在一個大於等於它的極大解的一個充要條件及[ 0 ， 1 ]格上方程a @ x = b的解集中存在極大解的一個充要條件。
  17. Motivated by this fact and peng ' s promising result, we utilize a special algebraic transformation, namely logarithmic transformation, to establish a non - infeasible long - step primal - dual path following algorithm. this algorithm arrives at the primal - dual solution set along the steepest descent direction of primal - dual

    第七章，通過構造一個新的鄰近度量函數，提出一個具有自調節功能的原一對偶路徑跟蹤內點演算法，並將其與線性規劃軟體lipsol和彭等人的m 。
  18. In addition, in the solution set of corresponding equation, the expression of the optimal approximation solution to given matrix is derived

    另外，導出了在矩陣方程的解集合中與給定矩陣的最佳逼近解的表達式。
  19. This ph. d. thesis - firstly considers the real asymmetric, real symmetric, bisym - metric, and symmetric and skew antisymmetric matrix extension problems constrained by the matrix inverse problem ax = b. and also considers, in the solution set, of the corresponding matrix extension problems, the optimal approximation solution to a given matrix a *. the necessary and sufficient conditions for the existence of and the expressions for the above problems are derived, and the numerical algorithm and examples to solve the problems are also given

    首次提出並討論了矩陣反問題ax = b約束下實矩陣、實對稱矩陣、雙對稱矩陣和對稱次反對稱矩陣的擴充問題，討論了在其解集合中與給定矩陣a ~ *的最佳逼近問題，得到了問題的解存在的條件及通式的表示，給出求解問題的數值演算法和數值例子。
  20. The existence conditions of unique solutions are discussed by using - reslovent operators for set - valued mixed quasi - variational - like inequality and generalized set - valued variational inclusion problems on finite dimensional euclidean spaces ; respectively. the problem that under what conditions the solution set is nonempty ( not necessarily unique solution ) is

    ?利用-預解運算元在有限維空間中探討了集值混合擬類變分不等式問題和廣義集值變分包含問題存在唯一解的條件；利用分析的方法在實hilbert空間中討論了集值混合擬類變分不等式問題解集的非空性（不一定只有唯一解） 。
分享友人
分享到 Line

分享到臉書