Some algorithms for solving special tridiagonal block Toeplitz linear systems

Authors:
Borislav V. Minchev
Affiliations:
Department of Computer Science, University of Bergen, Bergen N-5020, Norway
Venue:
Journal of Computational and Applied Mathematics
Year:
2003

Citing 4
Cited 0

Multigrid Methods for Symmetric Positive Definite Block Toeplitz Matrices with Nonnegative Generating Functions

SIAM Journal on Scientific Computing
Computing the Extremal Positive Definite Solutions of a Matrix Equation

SIAM Journal on Scientific Computing
Iterative solution of two matrix equations

Mathematics of Computation
Matrix Equations and Structures: Efficient Solution of Special Discrete Algebraic Riccati Equations

NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications

Quantified Score

Hi-index	7.29

Visualization

Abstract

This paper is focused on different methods and algorithms for solving tridiagonal block Toeplitz systems of linear equations. We consider the El-Sayed method (Ph.D. Thesis, 1996) for such systems and propose several modifications that lead to different algorithms, which we discuss in detail. Our algorithms are then compared with some classical techniques as far as implementation time is concerned, number of operations and storage. Comments and conclusions for computing efficiency of the proposed new algorithms are given. Numerical experiments corroborating the theoretical results are also presented.