A new algorithm for solving ill conditioned linear systems
Authors:
- Hyoung Joong KimHKHyoung Joong Kim
- Kyung ChoiKCKyung Choi
- H.B. LeeHLH.B. Lee
- H.K. JungHJH.K. Jung
- S.Y. HahnSHS.Y. Hahn
- 1 May 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 32 (3) , 1373-1376
Abstract
A new algorithm is presented for solving ill-conditioned linear equations. This method is radically different from conventional methods. We improve the condition of the linear equation first and then solve the well-conditioned one. The approximate solution is modified to get the exact solution. Numerical simulations show that the proposed method is effective enough to be applied to the practical finite element problems. Mathematical soundness of the algorithm is also shown. Several implementation techniques are discussed. It can be used not only for solving ill-conditioned equations but also for inverse problems and many other areasKeywords
This publication has 3 references indexed in Scilit:
- New recursive algorithm for solving linear algebraic equationsElectronics Letters, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- Projection method for solving a singular system of linear equations and its applicationsNumerische Mathematik, 1971