Abstract
Componentwise error analysis for a modification of the cyclic reduction without back substitution for a tridiagonal system is presented. We consider relative roundoff errors and equivalent perturbations, so the main supposition is that all the data is nonzero. First, backward analysis for the computation of each component of the solution in separate is presented. Bounds on the relative equivalent perturbations are obtained depending on two constants. From these bounds it is easy to obtain a componentwise forward error analysis. Then the two constants are defined for some special classes of matrices, i.e. diagonally dominant (row or column), symmetric positive definite, totally nonnegative andM-matrices, and it is shown that the bounds for these classes of matrices are small.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Berman and R. J. Plemmons,Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
O. Buneman,A compact non-iterative Poisson solver, Report 294, Stanford University Institute of Plasma Research, Stanford, California, 1969.
F. W. Dorr,An example of ill-conditioning in the numerical solution of singular perturbed problems, Math. Comp., 25 (1971), pp. 271–283.
G. Golub and C. F. Van Loan,Matrix Computations, 2nd Edition, The John Hopkins University Press, Baltimore, MD, 1989.
N. J. Higham,Bounding the error in Gaussian elimination for tridiagonal systems, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 521–530.
R. Hockney,A fast direct solution of Poisson's equation using Fourier analysis, J. ACM, 12 (1965), p. 95–113.
R. Hockney and C. Jesshope,Parallel Computers 2, Adam Hilger, Bristol, 1988.
R. A. Horn and C. R. Johnson,Matrix Analysis, Cambridge University Press, 1986.
W. Oettli and W. Prager,Compatibility of approximate solution of linear equations with given error bounds for coefficients and right hand sides, Numer. Math., 6 (1964), pp. 405–409.
G. Peters and J. H. Wilkinson,On the stability of Gauss-Jordan elimination with pivoting, Comm. ACM, 18 (1975), pp. 20–24.
F. Stummel,Perturbation theory for evaluation algorithms of arithmetic expressions, Math. Comp., 37 (1981), pp. 435–473.
V. V. Voevodin and P. Y. Yalamov,A new method of roundoff error estimation, Parallel and Distributed Processing, 1990 (K. Boyanov, Ed.), Elsevier, Amsterdam, 1990, pp. 315–333.
J. H. Wilkinson,Error analysis of direct methods of matrix inversion, J. ACM, 1961, pp. 281–330.
J. H. Wilkinson,The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.
P. Y. Yalamov,Stability of a partitioning algorithm for bidiagonal systems, Preprint N19, 1994, Technical University of Russe. (submitted to SIAM J. Matrix Anal. Appl.)
P. Y. Yalamov,Stability of parallel bidiagonal solvers, in Proceedings of the Workshop on Parallel Scientific Computing, PARA94, J. Dongarra and J. Wasniewski editors, Lecture Notes in Computer Science, v. 879, Springer Verlag Year, 1994, pp. 520–533.
Author information
Authors and Affiliations
Additional information
The author was supported by Grants MM-211/92 and MM-434/94 from the National Scientific Research Fund of the Bulgarian Ministry of Education and Science.
Rights and permissions
About this article
Cite this article
Yalamov, P.Y. On the stability of the cyclic reduction without back substitution for tridiagonal systems. Bit Numer Math 35, 428–447 (1995). https://doi.org/10.1007/BF01732615
Issue Date:
DOI: https://doi.org/10.1007/BF01732615