Answers are grounded in this paper and cite their sources.
We present a fast algorithm for generating the inverse and the determinant of an extended, periodic, tridiagonal matrix. We use backward continued fractions to generate the elements of the inverse in closed form. By trading memory use against the cost of repeating the computation of certain quantities we are able to produce an effective procedure for a symbolic algebra implementation. We compare the performance of our Maple implementation that of the standard Maple library procedures for matrix inversion and computation of the determinant on a set of illustrative example matrices.
No takes yet. Share an insight, caveat, or question.
Hopkins et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: