Ill-conditioned linear equations and its algorithm
Authors
Dazhou Wang, Yueguang Li
Corresponding Author
Dazhou Wang
Available Online January 2015.
- DOI
- 10.2991/isci-15.2015.290How to use a DOI?
- Keywords
- Wilkinson algorithm; ill-conditioned linear equations; step size; amended conjugate gradient
- Abstract
In this paper, according to the characteristics of ill-conditioned linear equations. An improved Wilkinson algorithm(IWA) for solving ill-conditioned linear equations is proposed. An amendment factor is introduced to reduce the condition number of the coefficient matrix of ill-conditioned linear equations. An automatic step size is adopted to estimate the local error and change the step size correspondingly. The numerical results demonstrate that this new iterative algorithm is superior to other methods such as the amended conjugate gradient. The new algorithm is more applicable for solving ill-conditioned linear equations.
- Copyright
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Dazhou Wang AU - Yueguang Li PY - 2015/01 DA - 2015/01 TI - Ill-conditioned linear equations and its algorithm BT - Proceedings of the 2015 International Symposium on Computers & Informatics PB - Atlantis Press SP - 2216 EP - 2221 SN - 2352-538X UR - https://doi.org/10.2991/isci-15.2015.290 DO - 10.2991/isci-15.2015.290 ID - Wang2015/01 ER -