Abstract

The idea of symmetric bordering is a new strategy introduced by Evans and Levin [1] for the inversion of a full matrix, although as a special case the solution of a linear system can be found. The aim of this paper is to demonstrate that symmetric bordering can be performed by a systolic array and that the technique is more efficient than previous arrays for computing the matrix inverse and the solution of linear systems by elimination techniques. Symmetric bordering is a similar concept to the well known bordering methods, except that the bordering strategy is applied to the left hand top and bottom right hand elements of the matrix simultaneously. The amount of parallelism has been shown to be superior to that achieved by the Gauss Jordan algorithm [1].

Full Text
Paper version not known

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 call

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.