A BLOCK LANCZOS METHOD FOR THE CDT SUBPROBLEM  

作　　者：Liqiang Song Wei Hong Yang 

机构地区：[1]School of Mathematical Sciences, Fudan University, Shanghai 200433, China

出　　处：《Journal of Computational Mathematics》2019年第2期240-260,共21页计算数学（英文）

摘　　要：In this paper, we present a block Lanczos met hod for solving the large-scale CDT subproblem. During the algorithm, the original CDT subproblem is projected to a smallscale one, and then some classical method is employed to solve this small-scale CDT subproblem to get a solution, which can be used to derive an approximate solution of the original CDT subproblem. Theoretical analysis of the error bounds for both the optimal value and the optimal solution is also proposed. Numerical experiments are carried out, and it is demonstrated that the block Lanczos method is effective and can achieve high accuracy for large-scale CDT subproblems.

关 键 词：CDT subproblem TRUST-REGION subproblem Block-Lanczos method Krylov SUBSPACE Error BOUNDS 

分 类 号：O1[理学—数学]