Abstract
Sparse vector methods enhance the efficiency of matrix solution algorithms and are now used for solving almost all large sparse systems of linear equations. This paper presents an efficient sparse vector method (ESVM) based on the node-reordering technique for a problem that requires only one factorization path. The proposed method is tested for different cases of solution requirements and the results for four test systems of up to 118 buses are presented. The performance of the proposed method in comparison with the standard sparse vector methods (SSVM) reveals it to be much faster. The proposed technique also has the merit that it does not require any path-finding algorithm/table for highly sparse vector operations and can be applied to any general problem that requires matrix solution with sparse vectors.
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: International Journal of Electrical Power and Energy 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.
