@Article{JCM-37-240,
author = {Song , Liqiang and Yang , Weihong},
title = {A Block Lanczos Method for the CDT Subproblem},
journal = {Journal of Computational Mathematics},
year = {2018},
volume = {37},
number = {2},
pages = {240--260},
abstract = {<p style="text-align: justify;">In this paper, we present a block Lanczos method for solving the large-scale CDT
subproblem. During the algorithm, the original CDT subproblem is projected to a small-scale
one, and then some classical methods are 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.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1712-m2017-0064},
url = {http://global-sci.org/intro/article_detail/jcm/12678.html}
}