Year: 2019
Author: Liqiang Song, Weihong Yang
Journal of Computational Mathematics, Vol. 37 (2019), Iss. 2 : pp. 240–260
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/jcm.1712-m2017-0064
Journal of Computational Mathematics, Vol. 37 (2019), Iss. 2 : pp. 240–260
Published online: 2019-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 21
Keywords: CDT subproblem Trust-region subproblem Block-Lanczos method Krylov subspace Error bounds.