On the stability of the cyclic reduction without back substitution for tridiagonal systems
type: Item
instance of: scholarly article
title: On the stability of the cyclic reduction without back substitution for tridiagonal systems
zbMATH Open document ID: 0837.65018
DOI: 10.1007/BF01732615
published in: BIT
publication date: 1996-05-21T00:00:00Z
review text: For a tridiagonal system a componentwise error analysis is given via the cyclic reduction algorithm without back substitution. Error bounds are obtained depending on two constants; constants are defined for some special classes of matrices (diagonally dominant, M-matrices, positive definite matrices). It is shown that the bounds are small.
reviewed by: Horst Hollatz
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 827437
zbMATH Keywords: error bounds
zbMATH Keywords: diagonally dominant
zbMATH Keywords: tridiagonal system
zbMATH Keywords: cyclic reduction algorithm without back substitution
zbMATH Keywords: M-matrices
zbMATH Keywords: positive definite matrices
author: Plamen Yalamov
MaRDI profile type: Publication
cites work: Q3943082
cites work: Q5624690
cites work: An Example of Ill-Conditioning in the Numerical Solution of Singular Perturbation Problems
cites work: Q3359644
cites work: Bounding the Error in Gaussian Eimination for Tridiagonal Systems
cites work: A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
cites work: Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
cites work: On the stability of Gauss-Jordan elimination with pivoting
cites work: Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions
cites work: Error Analysis of Direct Methods of Matrix Inversion
cites work: Q5674306
cites work: Stability of a partitioning algorithm for bidiagonal systems
description: scientific article; zbMATH DE number 827437