Matrices, digraphs and determinants

dc.contributor.authorMaybee, John S.
dc.contributor.authorOlesky, D.D.
dc.contributor.authorvan den Driessche, P.
dc.contributor.authorWiener, G.
dc.date.accessioned2009-08-14T21:33:55Z
dc.date.available2009-08-14T21:33:55Z
dc.date.copyright1987en
dc.date.issued2009-08-14T21:33:55Z
dc.description.abstractWe present a detailed account of various determinantal formulas in a graph-theoretic form involving paths and cycles in the digraph of the matrix. For cases in which the digraph has special local properties, for example a cutpoint or a bridge, we give particular formulas which are more efficient for computing the determinant than simply using the matrix representation. Applications are also given to characteristic determinants, general minors and cofactors.en
dc.description.sponsorshipNSERC Grant A8214, NSERC Grant A8965 and the University of Victoria Committee on Faculty Research and Travelen
dc.identifier.urihttp://hdl.handle.net/1828/1509
dc.language.isoenen
dc.relation.ispartofseriesDM-445-IRen
dc.subjectdigraphen
dc.subjectcycleen
dc.subjectdeterminanten
dc.subjectminoren
dc.subjectcofactoren
dc.titleMatrices, digraphs and determinantsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
DM 445 IR.pdf
Size:
1.28 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description: