Artículo
An efficient ordering algorithm to improve sparse vector methods
Autor/es | Gómez Expósito, Antonio
García Franquelo, Leopoldo |
Departamento | Universidad de Sevilla. Departamento de Ingeniería Electrónica |
Fecha de publicación | 1988-11 |
Fecha de depósito | 2015-04-09 |
Publicado en |
|
Resumen | 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 ... 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. |
Agencias financiadoras | IEEE Power & Energy Society |
Cita | 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
An efficient ordering algorithm ... | 4.753Mb | [PDF] | Ver/ | |