dc.creatorAlves A.B.
dc.creatorAsada E.N.
dc.creatorMonticelli A.
dc.date1999
dc.date2015-06-30T15:22:34Z
dc.date2015-11-26T15:28:47Z
dc.date2015-06-30T15:22:34Z
dc.date2015-11-26T15:28:47Z
dc.date.accessioned2018-03-28T22:37:30Z
dc.date.available2018-03-28T22:37:30Z
dc.identifier780354796
dc.identifierIeee Power Industry Computer Applications Conference. Ieee, Piscataway, Nj, United States, v. , n. , p. 15 - 21, 1999.
dc.identifier
dc.identifier
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-0032597604&partnerID=40&md5=5ba9bab6747fd8c9783f1b1b130f6b2c
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/101237
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/101237
dc.identifier2-s2.0-0032597604
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1261685
dc.descriptionStudies comparing the performance of direct and iterative solvers of Ax = b systems have been performed. By direct methods we mean sparsity preserving Gaussian elimination based approaches, whereas by iterative methods we mean pre-conditioned conjugate gradient methods such as the ones based on incomplete factorization of matrix A (e.g., incomplete Cholesky and K0 pre-conditioners). A new ordering scheme has been developed which decreases the number of iterations required by iterative methods to reach convergence and an alternative conditioning approach is suggested in connection with the contingency screening problem. Tests have been performed with networks varying from 14 to 1663 buses, including base-case and contingency cases.
dc.description
dc.description
dc.description15
dc.description21
dc.languageen
dc.publisherIEEE, Piscataway, NJ, United States
dc.relationIEEE Power Industry Computer Applications Conference
dc.rightsfechado
dc.sourceScopus
dc.titleCritical Evaluation Of Direct And Iterative Methods For Solving Ax = B Systems In Power Flow Calculations And Contingency Analysis
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución