Abstract
This work examines the relation between Gaussian elimination and the conjugate directions algorithm [Hestenes and Steifel, 1952]. Analysis is extended to the case where the sequence of the conjugated vectors is modified, which is shown to result in reordering of the solution vector. Based on these analyses an algorithm is described which combines Gaussian elimination with a look-ahead algorithm. The purpose of the algorithm is to employ Gaussian elimination on a system of smaller order and to use this solution to approximate the solution of the original system. The algorithm was tested on a range of linear systems and performed well when the components in the solution vector varied by large magnitude.
Sign-in/Register to access full text options 
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.
