|
|||||
|
|
| 基于随机矩阵的差分代换算法的完备化 | |
| 引用本文： | 徐嘉,姚勇. 基于随机矩阵的差分代换算法的完备化[J]. 数学学报, 2011, 0(2) |
| 作者姓名： | 徐嘉 姚勇 |
| 作者单位： | 西南民族大学计算机科学与技术学院;中国科学院成都计算机应用研究所; |
| 基金项目： | 国家自然科学基金(90718041,11001228,10901116); 中科院知识创新工程重要方向项目(KJCX-YW-S02); 西南民族大学中央高校基本科研业务费专项资金(09NZYZJ07)及人才引进项目(2009RC004) |
| 摘 要： | 本文利用有限核原理,给出了基于随机矩阵的逐次差分代换方法的一个完备化.获得了判定多项式半正定性的完全算法.此算法可进一步应用于计算有理函数的全局最优值.与常用的数值最优化方法不同的是,本方法获得的是精确符号解. |
| 关 键 词： | 逐次差分代换方法 不等式机器证明 完备化 |
Completion of Difference Substitution Method Based on Stochastic Matrix |
|
| Jia XU College of Computer Science , Technology,Southwest University for Nationalities,Chengdu ,P.R.China Yong YAO Chengdu Institute of Computer Applications,Chinese Academy of Sciences,P.R.China. Completion of Difference Substitution Method Based on Stochastic Matrix[J]. Acta Mathematica Sinica, 2011, 0(2) | |
| Authors: | Jia XU College of Computer Science Technology Southwest University for Nationalities Chengdu P.R.China Yong YAO Chengdu Institute of Computer Applications Chinese Academy of Sciences P.R.China |
| Affiliation: | Jia XU College of Computer Science and Technology,Southwest University for Nationalities,Chengdu 610041,P.R.China Yong YAO Chengdu Institute of Computer Applications,Chinese Academy of Sciences,P.R.China |
| Abstract: | In this paper,the principle of finite kernel is used to complete the successive difference substitution.Then a complete algorithm for deciding positive semi-definite polynomial is presented.This algorithm can be applied further to compute the global optimization of rational function.Being different from any other common methods of numerical optimization,the method in this paper gets accurate symbolic solution. |
| Keywords: | method of successive difference substitution automated proving for inequality completion |
| 本文献已被 CNKI 等数据库收录！ | |