Abstract
Tearing methods for large systems have been widely studied and applied over the last decade. Most of the applications used single-level partitioning of a system into subsystems. In the paper, tearing is applied to hierarchically described systems, where each subsystem is itself composed of subsystems, and so on to arbitrary depth. This structure gives rise naturally to ‘recursive’ bordered block diagonal (BBD) matrices, where each diagonal block is itself in the BBD form. Algorithms for LU decomposition and forward and back substitution of such matrices are described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEE Proceedings G (Electronic Circuits and Systems)
Disclaimer: 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.