Show simple item record

dc.contributor.authorSweet, Roland A.en_US
dc.date.accessioned2007-04-09T21:01:48Z
dc.date.available2007-04-09T21:01:48Z
dc.date.issued1968-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-16en_US
dc.identifier.urihttps://hdl.handle.net/1813/5871
dc.description.abstractA recursive relation is developed for the determinant of a pentadiagonal matrix $S$ which satisfies $s_{i,j} \neq 0$ for $|i-j|=1$. When $S$ is symmetric, one has a six-term recursive relation. An example is given to illustrate its use in the computation of eigenvalues.en_US
dc.format.extent425371 bytes
dc.format.extent176968 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Recursive Relation for the Determinant of a Pentadiagonal Matrixen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics