On condition numbers in the cyclic reduction processes of a tridiagonal matrix
Tan Wang, Masashi Iwasaki, Yoshimasa Nakamura
Abstract
Tan Wang, Masashi Iwasaki, Yoshimasa Nakamura
Abstract
The cyclic reduction method is a direct method for solving tridiagonal linear systems. At the first step of this method, a tridiagonal coefficient matrix is transformed into a pentadiagonal form. In this article, we prove that the condition number for eigenvalues of some classes of coefficient matrices always decreases after the first step of the cyclic reduction method.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The cyclic reduction method is a direct method for solving tridiagonal linear systems. At the first step of this method, a tridiagonal coefficient matrix is transformed into a pentadiagonal form. In this article, we prove that the condition number for eigenvalues of some classes of coefficient matrices always decreases after the first step of the cyclic reduction method.
Key concepts: Tridiagonal matrix, Mathematics, Tridiagonal matrix algorithm, Coefficient matrix, Reduction (mathematics), Eigenvalues and eigenvectors, Matrix (chemical analysis), Band matrix