By Topic

LU decomposition and forward-backward substitution of recursive bordered block diagonal matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Vlach, M. ; University of Waterloo, Department of Electrical Engineering, Waterloo, Canada

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.

Published in:

Electronic Circuits and Systems, IEE Proceedings G  (Volume:132 ,  Issue: 1 )