Year: 2024
Type: article
Abstract: In this study, we focus on reanalyzing and reducing a recursive formula that generates the permanents of a family of matrices called k-tridiagonal Toeplitz. This recursive formula is dependent on two free variables and is in non-linear form. We first propose an alternative proof to the one given in “Recursive and combinational formulas for permanents of general k-tridiagonal Toeplitz matrices”. This alternative proof is derived from a detailed examination of the designs of the submatrix blocks resulting from the expansion of permanents. Subsequently, we reduce this recursive formula to a linear form. This linear recursive formula simplifies the computation process by effectively reducing k-tridiagonal Toeplitz matrix permanents to those with a bandwidth of 1.
Source: Journal of Science and Arts
Authors: AHMET ZAHİD KÜÇÜK, MEHMET ÖZEN
Institutions: Karabük University, Sakarya University
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4403489360