Abstract
Structured Gaussian elimination (SGE) is a class of methods for efficiently solving sparse linear systems. The key idea is to first triangulate the original linear systems. The maximum component (MC)-based strategies are widely used to implement the triangulation process. The most straightforward way to find the MC is through exhaustive search. Instead, in this letter, we propose to use a disjoint-set data structure (DSDS) to efficiently maintain the components. The extra storage and time complexity introduced by the DSDS are respectively linear to the number of unknowns and constraints involved in a linear system. Simulation results show that using the DSDS can be several times faster than doing the exhaustive search to find the components.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.