Semi-Definite Programming for Real Root Finding
スポンサーリンク
概要
- 論文の詳細を見る
In this Letter, we explore semi-definite relaxation (SDR) program for finding the real roots of a real polynomial. By utilizing the square of the polynomial, the problem is approximated using the convex optimization framework and a real root is estimated from the corresponding minimum point. When there is only one real root, the proposed SDR method will give the exact solution. In case of multiple real roots, the resultant solution can be employed as an accurate initial guess for the iterative approach to get one of the real roots. Through factorization using the obtained root, the reminding real roots can then be solved in a sequential manner.
論文 | ランダム
- 28p-ZL-13 LPEマイクロチャンネルエピタキシーにおける積層欠陥からのステップ発生
- 5p-S-5 Alの積層欠陥及び双晶面への原子空孔の偏析
- 31a-M-4 GaP-on-Siにおける積層欠陥の発生・抑制
- 2D17 積層欠陥が炭化ケイ素のβ⟶α相転移に及ぼす影響
- 31a-M-1 原子空孔積層欠陥四面体の核形成機構