A fast and reliable algorithm for evaluating \(n\)th order pentadiagonal determinants
From MaRDI portal
Publication:941494
DOI10.1016/j.amc.2008.01.032zbMath1151.65038MaRDI QIDQ941494
Publication date: 1 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.01.032
Related Items
Numerical algorithm for the determinant evaluation of cyclic pentadiagonal matrices with Toeplitz structure, New algorithms for solving periodic tridiagonal and periodic pentadiagonal linear systems, Symbolic algorithm for inverting cyclic pentadiagonal matrices recursively - derivation and implementation, On solving pentadiagonal linear systems via transformations, An efficient numerical algorithm for the determinant of a cyclic pentadiagonal Toeplitz matrix, A novel algorithm for solving quasi penta-diagonal linear systems, Two symbolic algorithms for solving general periodic pentadiagonal linear systems, On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices, On determinants of cyclic pentadiagonal matrices with Toeplitz structure, On a structure-preserving matrix factorization for the determinants of cyclic pentadiagonal Toeplitz matrices, A note on solving nearly penta-diagonal linear systems
Uses Software
Cites Work
- A computational algorithm for special \(n\)th-order pentadiagonal Toeplitz determinants
- A note on ``A fast numerical algorithm for the determinant of a pentadiagonal matrix
- A fast algorithm for evaluating \(n\)th order tri-diagonal determinants.
- On computing the determinants and inverses of some special type of tridiagonal and constant-diagonals matrices
- A fast numerical algorithm for the determinant of a pentadiagonal matrix
- A recursive algorithm for determining the eigenvalues of a quindiagonal matrix
- A recursive relation for the determinant of a pentadiagonal matrix
- Matrix theory. Basic results and techniques
