• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Triangular factorization
 

Triangular factorization

on

  • 798 views

TRIANGULAR FACTORIZATION in Power System Analysis

TRIANGULAR FACTORIZATION in Power System Analysis

Statistics

Views

Total Views
798
Views on SlideShare
798
Embed Views
0

Actions

Likes
0
Downloads
2
Comments
0

0 Embeds 0

No embeds

Accessibility

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Triangular factorization Triangular factorization Presentation Transcript

    • TRIANGULAR FACTORIZATION By Syed Zulqadar Hassan CIIT Abbottabad Campus
    • TRIANGULAR FACTORIZATION • It involves three steps: • Step 1 Triangular Factorization • Step 2 Forward Substitution • Step 3 Back Substitution
    • TRIANGULAR FACTORIZATION Count… • So we can write • We Know that
    • • Finally we get TRIANGULAR FACTORIZATION Count…
    • ADVANTAGES • Solution of a linear system by triangular factorization and subsequent forward and back substitution is very popular because of the many advantages of the method: • Efficiency • Ability to preserve sparsity of the matrix
    • Sparsity • The fraction of zero elements (non-zero elements) in a matrix is called the sparsity (density).
    • Sparsity in Power System • Let us analyze the requirements for a 1000 node/2000 branch circuit. • For this network, the admittance matrix Y will have approximately 5000 nonzero elements. The table of factors for this matrix will have 5000Rs nonzero elements. • If Rs = 2.5, then 12,500 nonzero elements need to be stored.
    • Sparsity in Power System Count… • The sparsity preservation index also impacts the efficiency of the method. • This becomes obvious by considering the fact that the forward and back substitutions require as many multiply-adds as the number of non-zeros entries in the table of factors. • If Rs = 2.5, then only 12,500 multiply-adds are required in the forward and back substitution, a small number compared with the required multiply- adds for the operation inverse of Y. • The inverse of Y have 10,000,000 Multiply-adds while Factorization have 900,000 Multiply-adds.
    • References • Power System Modeling, Analysis and Control By A. P. Sakis Meliopoulos (Page 18) • https://en.wikipedia.org/wiki/Sparse_matrix • “Triangular Factorization Method for Power Flow Analysis” by Y.Okamoto Published in journal “Electrical Engineering in Japan” Vol 96, No 1, January 1976, pp 31-35