A comparison of the computatlonal complexities of the stride reduction methods

DOI10.1080/00207169608804518zbMath1001.65509OpenAlexW2035517957MaRDI QIDQ2710795

A. A. al-Wali, David 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

tridiagonal systemsSOR methodGaussian elimination direct methodstride of 3

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• Unnamed Item
• On the FACR(l) algorithm for the discrete Poisson equation
• A fourth order difference method for the one-dimensional general quasilinear parabolic partial differential equation
• The strides reduction algorithms for solving tridiagonal linear systems
• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis

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