Abstract
Two processor arrays for triangularisation of dense matrices using Gaussian elimination with partial pivoting are synthesised from the algorithm description. These arrays consist of processing modules with FIFO buffers and manifest local intermodule communications. Both the one- and two-dimensional arrays process an n × n matrix in O(n2) time, while the last allows an O(n) block pipelining period. The estimations of the processing time on the 1-D array and the block pipelining period on the 2-D array are identical to those for the numerically unstable case of Gaussian elimination without pivoting.
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 callMore From: IEE Proceedings E Computers and Digital Techniques
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.
