Abstract
Power distribution networks (PDN) data is expressed through irregular and very sparse, definite and sometimes indefinite matrices, depending on the application used. For multi-phase PDN, matrices naturally contain blocks, whose size depends on the number of phases used. As matrices can be processed faster when blocked, many algorithms have been modified to process blocks. LU factorization is the simplest direct method for solving linear systems. It is not widely used in PDN applications as it tends to destabilize the system with indefinite matrices. Using right ordering and pivoting techniques, blocked LU factorization can be used efficiently for solving PDN application problems, without violation of system stability. In this paper we are proposing blocked, minimum degree ordered LU factorization algorithm to be used in PDN applications. Using partial diagonal pivoting the algorithm is tuned to solve both, definite and indefinite types of PDN matrices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
