On the Stability of a Partitioning Algorithm for Tridiagonal Systems

DOI10.1137/S0895479896314418zbMATH Open0924.65019MaRDI QIDQ4243499FDOQ4243499

Authors: Velisar Pavlov, Plamen Yalamov 

Publication date: 18 May 1999

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• Publication:4945785
• Stability of a partitioning algorithm for bidiagonal systems
• Backward stability of a parallel partitioning algorithm for banded linear systems
• On the stability of the cyclic reduction without back substitution for tridiagonal systems

zbMATH Keywords

numerical experimentsnonnegative matricescondition numberstridiagonal matricesdiagonally dominant matricesM-matricessymmetric positive definite matricesroundoff error analysisparallel partitioning algorithm

Mathematics Subject Classification ID

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

Cited In (9)

• Backward stability of a parallel partitioning algorithm for banded linear systems
• Componentwise error analysis for the block LU factorization of totally nonnegative matrices
• An application of partition method for solving 3D Stokes equation
• Stability of block LU factorization for block tridiagonal matrices
• Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the stability of the cyclic reduction without back substitution for tridiagonal systems
• Stability of the 8-tetrahedra shortest-interior-edge partitioning method

This page was built for publication: On the Stability of a Partitioning Algorithm for Tridiagonal Systems

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