A comparison of the computatlonal complexities of the stride reduction methods

DOI10.1080/00207169608804518MaRDI QIDQ2710795zbMATH OpenOpenAlexFDO

Authors A. A. al-Wali, D. J. Evans

Publication date 19 December 2002

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

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

zbMATH Keywords

Gaussian elimination direct methodSOR methodstride of 3tridiagonal systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• Cyclic and stride reduction methods for generalised tridiagonal matrices
• The solution of unsymmetric tridiagonal Toeplitz systems by the strides reduction algorithm
• On the forward stability of a modified `stride of 3' reduction method
• The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm
• Strides reduction algorithms for block tridiagonal linear systems

Cites work

• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
• A fourth order difference method for the one-dimensional general quasilinear parabolic partial differential equation
• scientific article; zbMATH DE number 41859 (Why is no real title available?)
• On the FACR(l) algorithm for the discrete Poisson equation
• The strides reduction algorithms for solving tridiagonal linear systems

Cited in

(1)

• On the forward stability of a modified `stride of 3' reduction method

This page was built for publication: A comparison of the computatlonal complexities of the stride reduction methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2710795)