Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/20568| Title: | The Decomposition of Matrices |
| Authors: | Ward, Wilfred A. |
| Advisor: | Csima, J. |
| Department: | Mathematics |
| Publication Date: | May-1970 |
| Abstract: | <p>This thesis deals with algorithms which, for a given square matrix A of order n, construct permutation matrices P and Q (if they exist) such that PAQ is a canonical form of A. The pertinent theory of fully indecomposable matrices is discussed and detailed description is given of the algorithm by Dulmage and Mendelsohn. The connection between irreducible and fully indecomposable matrices is also examined, and it is observed that Harary's algorithm for bringing a matrix to a normal form is interchangeable with the second part of the Dulmage and Mendelsohn algorithm. Efficient computer programs for the Dulmage and Mendelsohn algorithm are presented which are directly applicable to various numerical problems.</p> |
| Description: | Title: The Decomposition of Matrices, Author: Wilfred A. Ward, Location: Thode |
| URI: | http://hdl.handle.net/11375/20568 |
| Appears in Collections: | Digitized Open Access Dissertations and Theses |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Ward_Wilfred_A_1970_05_master.pdf | Title: The Decomposition of Matrices, Author: Wilfred A. Ward, Location: Thode | 5.98 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.
