A new method for solving symmetric circulant tridiagonal systems of linear equations (Q1173903): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5540873 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3272866 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Direct Methods for Solving Poisson’s Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Fourier-Toeplitz Methods for Separable Elliptic Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Solution of Circulant Linear Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5543004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4749086 / rank | |||
Normal rank |
Revision as of 08:47, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new method for solving symmetric circulant tridiagonal systems of linear equations |
scientific article |
Statements
A new method for solving symmetric circulant tridiagonal systems of linear equations (English)
0 references
25 June 1992
0 references
The author presents a method for solving a tridiagonal system with circulant matrix \(B\) whose diagonal entries are all \(\lambda>2\) and whose off-diagonal entries are all \(-1\) (or which can be scaled to such a matrix). This matrix is related to the tridiagonal matrix \(C\) whose upper right entry is \(\mu\), whose other diagonal entries are \(\lambda\) and whose off-diagonal entries are \(-1\). \(\mu\) satisfies the expression \(\mu+1/\mu=\lambda\). The two matrices are related by the expression \(B^{-1}=C^{-1}-\mu^{-1}C^{-1}e_ 1(1+\mu^{-1}e^ T_ 1C^{- 1}e_ 1)^{-1}e^ T_ 1C^{-1}\) where \(e_ 1\) is the column vector with 1 in first position, 0 elsewhere. The expression and its block generalization can be used to generate efficient solution algorithms for circulant and block circulant matrices.
0 references
tridiagonal system
0 references
circulant matrix
0 references
algorithms
0 references
block circulant matrices
0 references