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

DOI10.1016/0167-8191(94)90074-4MaRDI QIDQ1334540zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 25 September 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90074-4

zbMATH Keywords

parallel computingiterative methoddiagonally dominant matricescyclic reductiontridiagonal systemselimination scheme

Mathematics Subject Classification ID

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

Recommendations

• Cyclic and stride reduction methods for generalised tridiagonal matrices
• Strides reduction algorithms for block tridiagonal linear systems
• The strides reduction algorithms for solving tridiagonal linear systems
• scientific article; zbMATH DE number 529796
• A comparison of the computatlonal complexities of the stride reduction methods

Cited in

(1)

• A comparison of the computatlonal complexities of the stride reduction methods

This page was built for publication: On the forward stability of a modified `stride of 3' reduction method

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