Abstract
A systolic network for the Gauss-Jordan algorithms is presented for the solution of dense linear systems. This network compares favorably with Melhem's network since its execution time (4 n − 1) is the same and the number of cells is decreased from n 2 2 to 3n 2 8 .
Sign-in/Register to access full text options 
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.
