Cyclic and stride reduction methods for generalised tridiagonal matrices
From MaRDI portal
Recommendations
Cited in
(12)- Eigenvalue clustering of coefficient matrices in the iterative stride reductions for linear systems
- A Tricyclic Tridiagonal Equation Solver
- Fast and accurate recursive algorithms for solving cyclic tridiagonal linear systems
- A tridiagonalization-based arbitrary-stride reduction approach for (p,q)-pentadiagonal linear systems
- Solving separable elliptic equations by the block stride reduction algorithm
- A fast numerical algorithm for solving nearly penta-diagonal linear systems
- On the forward stability of a modified `stride of 3' reduction method
- Strides reduction algorithms for block tridiagonal linear systems
- scientific article; zbMATH DE number 5951875 (Why is no real title available?)
- A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices
- On condition numbers in the cyclic reduction processes of a tridiagonal matrix
- A comparison of the computatlonal complexities of the stride reduction methods
This page was built for publication: Cyclic and stride reduction methods for generalised tridiagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950628)