| dc.contributor | Universidade Estadual Paulista (Unesp) | |
| dc.date.accessioned | 2014-05-20T13:28:57Z | |
| dc.date.available | 2014-05-20T13:28:57Z | |
| dc.date.created | 2014-05-20T13:28:57Z | |
| dc.date.issued | 1999-11-01 | |
| dc.identifier | IEEE Transactions on Power Systems. New York: IEEE-Inst Electrical Electronics Engineers Inc., v. 14, n. 4, p. 1369-1374, 1999. | |
| dc.identifier | 0885-8950 | |
| dc.identifier | http://hdl.handle.net/11449/9681 | |
| dc.identifier | 10.1109/59.801898 | |
| dc.identifier | WOS:000083533500039 | |
| dc.identifier | 7166279400544764 | |
| dc.description.abstract | This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different approach has been presented using dependency-based substitution algorithm (DBSA). In this paper the focus is on new algorithms able to explore the sparsity of the vectors. The efficiency is tested using linear systems from power systems with 118, 320, 725 and 1729 buses. The tests were performed on a CRAY Y MP2E/232. The speedups for a fast-forward/fast-backward using a 1729-bus system are near 19 and 14 for real and complex arithmetic operations, respectively. When forward/backward is employed the speedups are about 8 and 6 to perform the same simulations. | |
| dc.language | eng | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | |
| dc.relation | IEEE Transactions on Power Systems | |
| dc.relation | 5.255 | |
| dc.relation | 2,742 | |
| dc.rights | Acesso restrito | |
| dc.source | Web of Science | |
| dc.subject | sparse linear systems | |
| dc.subject | direct methods | |
| dc.subject | sparse vector | |
| dc.subject | vector processing | |
| dc.title | Fast-forward/fast-backward substitutions on vector computers | |
| dc.type | Artículos de revistas | |
