Abstract
The concept of preconditioning hitherto successfully applied to accelerate the convergence rate of iterative methods is now extended to the direct methods of solution of small order dense illconditioned matrix systems. It is shown that by solving the equivalent preconditioned linear system using Gaussian elimination and Choleski factorisation methods minimises the rounding errors incurred in the computational process. Theoretical analysis justifying this theory are included together with supporting numerical evidence.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
