期刊
GEODESY AND GEODYNAMICS
卷 6, 期 6, 页码 453-459出版社
SCIENCE PRESS
DOI: 10.1016/j.geog.2015.06.004
关键词
Severe ill-conditioned matrix; Linear least squares problems; Self-adaptive; Iterative scheme; Cholesky decomposition; Regularization parameter; Tikhonov solution; Truncated SVD solution
Linear Least Squares (LLS) problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm (SAIA) is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence, and also greatly enhance the computation accuracy. (C) 2015, Institute of Seismology, China Earthquake Administration, etc. Production and hosting by Elsevier B.V. on behalf of KeAi Communications Co., Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据