Repositorio de producción científica de la Universidad de Sevilla

An efficient ordering algorithm to improve sparse vector methods

 

Advanced Search
 
Opened Access An efficient ordering algorithm to improve sparse vector methods
Cites

Show item statistics
Icon
Export to
Author: Gómez Expósito, Antonio
García Franquelo, Leopoldo
Department: Universidad de Sevilla. Departamento de Ingeniería Electrónica
Date: 1988-11
Published in: IEEE Transactions on Power Systems, 3(4), 1538 - 1544
Document type: Article
Abstract: This paper presents a new node ordering algorithm to enhance sparse vector methods. The proposed technique locally minimizes the number of non-zero elements of the inverse of the table of factors. It uses the cardinality of the set of nodes which precede each node in the path graph as a tie-break criterion in the minimum degree elimination process. Test results are included showing that the method performs better than previously published methods.
Cite: Gómez Expósito, A. y García Franquelo, L. (1988). An efficient ordering algorithm to improve sparse vector methods. IEEE Transactions on Power Systems, 3 (4), 1538-1544.
Size: 4.753Mb
Format: PDF

URI: http://hdl.handle.net/11441/23740

DOI: 10.1109/59.192963

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)