Computation of a Unimodular Matrix
dc.citation.bibtexName | techreport | en_US |
dc.citation.issueNumber | 7916 | en_US |
dc.citation.journalTitle | Rice University ECE Technical Report | en_US |
dc.contributor.author | Kontos, Athanassios | en_US |
dc.contributor.author | de Figueiredo, Rui J.P. | en_US |
dc.date.accessioned | 2007-10-31T00:50:32Z | en_US |
dc.date.available | 2007-10-31T00:50:32Z | en_US |
dc.date.issued | 1979-12-01 | en_US |
dc.date.modified | 2004-03-16 | en_US |
dc.date.submitted | 2004-03-16 | en_US |
dc.description | Tech Report | en_US |
dc.description.abstract | An algorithm for computing a unimodular matrix U(λ) satisfying the equation [A(λ) B(λ)] U(λ) = [1 0] is presented where A(λ) and B(λ) are relatively left prime polynomial matrices. The approach used avoids Euclidean-type operations used in standard Gaussian elimination and thus appears to be superior to any direct approach based on the computation of Smith forms. | en_US |
dc.identifier.citation | A. Kontos and R. J. de Figueiredo, "Computation of a Unimodular Matrix," <i>Rice University ECE Technical Report,</i> no. 7916, 1979. | en_US |
dc.identifier.uri | https://hdl.handle.net/1911/20035 | en_US |
dc.language.iso | eng | en_US |
dc.subject | linear systems | en_US |
dc.subject | matrices | en_US |
dc.subject | APL programs | en_US |
dc.subject | multivariable theory | en_US |
dc.subject.keyword | linear systems | en_US |
dc.subject.keyword | matrices | en_US |
dc.subject.keyword | APL programs | en_US |
dc.subject.keyword | multivariable theory | en_US |
dc.title | Computation of a Unimodular Matrix | en_US |
dc.type | Report | en_US |
dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1