The strides reduction algorithms for solving tridiagonal linear systems

DOI10.1080/00207169208804043zbMath0748.65023OpenAlexW2118964994MaRDI QIDQ3989783

David J. Evans

Publication date: 28 June 1992

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

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

zbMATH Keywords

tridiagonal systemsodd-even cyclic reduction algorithmstrides reduction algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (9)

A preconditioning strategy for banded circulant and toeplitz systems ⋮ SOLVING TRIDIAGONAL LINEAR SYSTEMS BY THE ENHANCED PARALLEL STRIDE OF THREE REDUCTION METHOD ⋮ The quadstride reduction algorithm ⋮ A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices ⋮ Strides reduction algorithms for block tridiagonal linear systems ⋮ A comparison of the computatlonal complexities of the stride reduction methods ⋮ Block iterative methods for the nine-point approximation to the convection-diffusion equation ⋮ The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm ⋮ THE PARALLEL SOLUTION OF TRIDIAGONAL SYSTEMS BY RECURSIVE STRIDING

Cites Work

• The Direct Solution of the Discrete Poisson Equation on a Rectangle
• On Direct Methods for Solving Poisson’s Equations
• Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations

This page was built for publication: The strides reduction algorithms for solving tridiagonal linear systems