Fast block diagonalization of k-tridiagonal matrices

DOI10.1016/J.AMC.2011.08.014MaRDI QIDQ425465zbMATH OpenOpenAlexFDO

Authors Tomohiro Sogabe, Moawwad El-Mikkawy

Publication date 8 June 2012

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2011.08.014

zbMATH Keywords

determinantfinite fieldgeneral linear group\(k\)-tridiagonal matrixblock diagonalizationsgeneralized \(k\)-Fibonacci numbers

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Numerical computation of determinants (65F40)

Recommendations

• A block diagonalization based algorithm for the determinants of block k-tridiagonal matrices
• Bidiagonalization of \((k, k + 1)\)-tridiagonal matrices
• A note on a fast breakdown-free algorithm for computing the determinants and the permanents of \(k\)-tridiagonal matrices
• On determinants and permanents of \(k\)-tridiagonal Toeplitz matrices
• An incomplete block-diagonalization approach for evaluating the determinants of bordered \(k\)-tridiagonal matrices

Cites work

• A fast algorithm for evaluating \(n\)th order tri-diagonal determinants.
• A new family of \(k\)-Fibonacci numbers
• Direct Methods for Sparse Linear Systems
• Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix
• On a constant-diagonals matrix
• On computing the determinants and inverses of some special type of tridiagonal and constant-diagonals matrices
• Templates for the Solution of Algebraic Eigenvalue Problems
• The LU factorizations and determinants of the \(k\)-tridiagonal matrices
• The inverse of a tridiagonal matrix

Cited in

(20)

• A block diagonalization based algorithm for the determinants of block k-tridiagonal matrices
• Symbolic algorithms for the inverses of general \(k\)-tridiagonal matrices
• Eigenvalue clustering of coefficient matrices in the iterative stride reductions for linear systems
• Elliptical higher rank numerical range of some Toeplitz matrices
• A bidiagonalization-based numerical algorithm for computing the inverses of \((p, q)\)-tridiagonal matrices
• A new recursive algorithm for inverting general \(k\)-tridiagonal matrices
• A note on a fast breakdown-free algorithm for computing the determinants and the permanents of \(k\)-tridiagonal matrices
• A periodic determinantal property for (0,1) double banded matrices
• Bidiagonalization of \((k, k + 1)\)-tridiagonal matrices
• An incomplete block-diagonalization approach for evaluating the determinants of bordered \(k\)-tridiagonal matrices
• A tridiagonalization-based numerical algorithm for computing the inverses of \((p, q)\)-pentadiagonal matrices
• Fast O(n) complexity algorithms for diagonal innovation matrices
• On decomposition of k-tridiagonal -Toeplitz matrices and its applications
• A family of permutations for concurrent factorization of block tridiagonal matrices
• On singular values related to DAEs in Kronecker canonical form
• An efficient breakdown-free algorithm for numerically evaluating the determinants of \((p, q)\)-pentadiagonal matrices
• A novel algorithm for inverting a general \(k\)-tridiagonal matrix
• Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
• Some comments on k-tridiagonal matrices: determinant, spectra, and inversion
• Explicit formula for positive integer powers of \(k\)-tridiagonal Toeplitz matrices

Describes a project that uses

Uses Software

• CSparse
• JDQZ
• JDQR

This page was built for publication: Fast block diagonalization of \(k\)-tridiagonal matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425465)