Fast tridiagonalization of (p, q)-pentadiagonal matrices and its applications

( p ,  q )-Pentadiagonal matrices have attracted considerable attention in the past few years, which are one of the generalizations of pentadiagonal matrices. In the current paper, we present an algorithm for tridiagonalization of ( p ,  q )-pentadiagonal matrices using permutation matrices. Moreove...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing 2024-09, Vol.80 (13), p.19414-19432
Main Authors: Jia, Ji-Teng, Xie, Rong, Yılmaz, Fatih
Format: Article
Language:English
Subjects:
Algorithms
Compilers
Computer Science
Determinants
Fields (mathematics)
Interpreters
Linear algebra
Matrices (mathematics)
Permutations
Processor Architectures
Programming Languages
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:( p ,  q )-Pentadiagonal matrices have attracted considerable attention in the past few years, which are one of the generalizations of pentadiagonal matrices. In the current paper, we present an algorithm for tridiagonalization of ( p ,  q )-pentadiagonal matrices using permutation matrices. Moreover, we give the explicit representations of the permutation matrices and describe the nonzero structure of the obtained tridiagonal matrix. As applications, the tridiagonalization provides us with some useful results such as a breakdown-free algorithm of the matrix determinants and permanents, efficient parallel matrix multiplications and integer powers, and a property of the ( p ,  q )-pentadiagonal matrix over the finite field. Some other applications on numerical linear algebra are also discussed.
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-024-06173-y