求解信赖域子问题的库塔三阶方法  

A kuta third-order method for solving trust domain sub-problems

作　　者：武姝廷 王希云[1] WU Shuting;WANG Xiyun(School of Applied Science,Taiyuan University of Science and Technology,Shanxi Taiyuan 03002)

机构地区：[1]太原科技大学应用科学学院,山西太原030024

出　　处：《宁夏师范学院学报》2018年第10期30-41,共12页Journal of Ningxia Normal University

基　　金：山西省自然科学基金(2008011013);山西省"131"领军人才工程项目

摘　　要：提出了一种求解信赖域子问题的库塔三阶算法,并进一步分析了库塔三阶折线路径的性质,证明了库塔三阶折线算法的适定性.数值实验表明此算法是有效且可行的.According to the idea of solving the subproblem of trust domain accurately by quadratic function model, a threeorder fold line of kuta is constructed by using the threeorder method of kuta. A kuta thirdorder algorithm for solving trust domain subproblems is proposed, and the properties of the kuta thirdorder fold path are analyzed. The fitness of the kuta thirdorder foldpath algorithm is proved. Numerical experiments show that the algorithm is effective and feasible.

关 键 词：最优曲线 库塔三阶算法 信赖域子问题 微分方程 

分 类 号：O221[理学—运筹学与控制论]