1986
DOI: 10.1109/mper.1986.5528174
|View full text |Cite
|
Sign up to set email alerts
|

Partial Matrix Refactorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

1991
1991
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 4 publications
0
13
0
Order By: Relevance
“…Beside the three methods described in Section 2.1, method SW0 was implemented for reference purposes; it exploits the partial matrix re-factorisation techniques described in Chan and Brandwajn (1986) to compute the triangular factors of the updated B 00 matrix.…”
Section: Tests and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Beside the three methods described in Section 2.1, method SW0 was implemented for reference purposes; it exploits the partial matrix re-factorisation techniques described in Chan and Brandwajn (1986) to compute the triangular factors of the updated B 00 matrix.…”
Section: Tests and Resultsmentioning
confidence: 99%
“…More efficient approaches based on sparse vector methods were proposed (Chang and Brandwajn, 1988) including partial matrix re-factorisation and factor update (Chan and Brandwajn, 1986). The difficulty of managing PV-PQ node type switching in the framework of contingency screening is witnessed by two recent papers (Davis and Overbye, 2011;Obah and Kim, 2008); in the former the reactive problem is not considered, while in the latter, a sensitivity method is proposed to correct the outage severity index obtained by a DC load flow computation, but again no PV-PQ type switching is performed.…”
Section: Introductionmentioning
confidence: 99%
“…As has been pointed out by Betancourt [3,4], a m e z and Franquelo [6, 31 and others [5], ordinary ordering algorithms such as Tinney Scheme 2 are not the best from the perspective of sparse vector methods. In a forthcoming accepted paper [2], this discusser and his co-workers will give further evidence of the significant impact that these new ordering schemes will have in the field of sparsity. From the perspective of the present paper, however, it should be clear that existing ordering techniques lead to long paths and the need for "skip forward" and "skip back" techniques.…”
Section: F L Alvarado (The University Of Wisconsin-madison)mentioning
confidence: 95%
“…A brief review of SV techniques is given to establish background, terminology and notation. For more information see [1,2].…”
Section: Wf T H E Y Fellow Ieee Consultant Portland Oregon 97219mentioning
confidence: 99%
“…In the SDCFD Method, the B can be refactorized by the partial matrix refactorization method [19] so as to reflect the PV-PQ bus switchings. In the SDCNR Method, the factorization of the J is simple and straightforward with the bus switching effect.…”
Section: Q Limits Enforcement At Pvmentioning
confidence: 99%