点击次数：

影响因子：2.8

DOI码：10.1016/j.apnum.2022.06.016

发表刊物：Applied Numerical Mathematics

关键字：Extended trust-region (ETR) subproblem，Block Lanczos method，Block Krylov subspace，Orthogonal projection operator

摘要：Extended trust-region (ETR) subproblem plays an important role in many applications. The block Lanczos method proposed in Song and Yang, (2019) [27] is an efficient approach for solving large-scale ETR subproblem. In this method, the large-scale ETR subproblem is projected into a small-sized ETR subproblem by using the block Lanczos process, and some error bounds are established. However, the error bounds on the optimal value, the optimal solution, and the multipliers are not sharp enough. In this paper, we revisit the convergence of the block Lanczos method and refine all the error bounds. Examples are given to show the superiority of our theoretical results over the existing ones.

备注：中科院 2 区

第一作者：Bo Feng; Gang Wu

论文类型：SCI

通讯作者：Gang Wu

学科门类：理学

一级学科：数学

文献类型：SCI

卷号：118

页面范围：388–402

是否译文：否

发表时间：2022-06-30

收录刊物：SCI

发布期刊链接：https://doi.org/10.1016/j.apnum.2022.06.016