Abstract
Gaussian elimination with partial pivoting is the most favored technique for solution of a system of linear algebraic equations. However, in the existing form the algorithm requires the entire data before it can be implemented. In some applications, the data matrix is recursively augmented with new row and column vectors. Recomputing the entire solution from a scratch becomes expensive /spl Oscr/(n/sup 4/). We propose an order-recursive version of Gaussian elimination with complexity /spl Oscr/(n/sup 3/) to solve the recursively augmented system of equation.
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 callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: 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.
