On the stability of the cyclic reduction without back substitution for tridiagonal systems

DOI10.1007/BF01732615zbMath0837.65018MaRDI QIDQ1904281

Plamen Yordanov Yalamov

Publication date: 21 May 1996

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

positive definite matriceserror boundsM-matricesdiagonally dominanttridiagonal systemcyclic reduction algorithm without back substitution

Mathematics Subject Classification ID

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

Related Items

A parallel numerical algorithm for fredholm integro-differential two-point boundary value problems, Solving banded and near symmetric systems, The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub, Stability of block LU factorization for block tridiagonal matrices, Stability of the block cyclic reduction, A parallel numerical algorithm for near symmetric and banded systems, A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability of a partitioning algorithm for bidiagonal systems
• Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
• Bounding the Error in Gaussian Eimination for Tridiagonal Systems
• Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions
• Error Analysis of Direct Methods of Matrix Inversion
• On the stability of Gauss-Jordan elimination with pivoting
• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
• An Example of Ill-Conditioning in the Numerical Solution of Singular Perturbation Problems