JavaScript is disabled for your browser. Some features of this site may not work without it.
A Recursive Relation for the Determinant of a Pentadiagonal Matrix

Author
Sweet, Roland A.
Abstract
A 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.
Date Issued
1968-05Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-16
Type
technical report