Cyclic and stride reduction methods for generalised tridiagonal matrices

DOI10.1080/00207160008804912zbMath0990.65039OpenAlexW1995814915MaRDI QIDQ4950628

David J. Evans

Publication date: 18 July 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804912

zbMATH Keywords

tridiagonal matrixcyclic reductionstride reduction

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

Solving separable elliptic equations by the block stride reduction algorithm ⋮ A fast numerical algorithm for solving nearly penta-diagonal linear systems ⋮ Eigenvalue clustering of coefficient matrices in the iterative stride reductions for linear systems ⋮ On condition numbers in the cyclic reduction processes of a tridiagonal matrix

Cites Work

• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis

This page was built for publication: Cyclic and stride reduction methods for generalised tridiagonal matrices