Effective Methods for Solving Banded Toeplitz Systems

DOI10.1137/S0895479897324585zbMath0930.65015OpenAlexW2013541998MaRDI QIDQ4243525

Beatrice Meini, Dario Andrea Bini

Publication date: 18 May 1999

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

Full work available at URL: https://doi.org/10.1137/s0895479897324585

zbMATH Keywords

algorithmsiterative methodquadratic convergencedirect methodToeplitz matricescyclic reductionbanded matricesdisplacement rank

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (28)

A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial ⋮ Efficient computation of the extreme solutions of $X+A^*X^{-1}A=Q$ and $X-A^*X^{-1}A=Q$ ⋮ On solution of large systems of linear equations with block-Toeplitz banded matrices ⋮ Computations with infinite Toeplitz matrices and polynomials ⋮ Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform ⋮ Efficient cyclic reduction for quasi-birth-death problems with rank structured blocks ⋮ A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain ⋮ Korovkin theorems and linear positive Gram matrix algebra approximations of Toeplitz matrices ⋮ A parallel radix-4 block cyclic reduction algorithm ⋮ On the acceleration of an algorithm for polynomial factorization ⋮ Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox ⋮ Analysis of preconditioning strategies for collocation linear systems ⋮ Using the Sherman-Morrison-Woodbury inversion formula for a fast solution of tridiagonal block Toeplitz systems ⋮ A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle ⋮ Recursive algorithms for unbalanced banded Toeplitz systems ⋮ On the banded Toeplitz structured distance to symmetric positive semidefiniteness ⋮ A fast algorithm for solving banded Toeplitz systems ⋮ Circular trichotomy of the spectrum of regular matrix pencils ⋮ Preconditioned HSS method for large multilevel block Toeplitz linear systems via the notion of matrix‐valued symbol ⋮ A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks ⋮ Newton-like iteration based on a cubic polynomial for structured matrices ⋮ The palindromic cyclic reduction and related algorithms ⋮ Spectral behavior of matrix sequences and discretized boundary value problems ⋮ Superlinear convergence for PCG using band plus algebra preconditioners for Toeplitz systems ⋮ The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub ⋮ Fast solution of unsymmetric banded Toeplitz systems by means of spectral factorizations and Woodbury's formula ⋮ Some theorems on linear positive operators and functionals and their applications ⋮ The tensor structure of the inverse of a banded Toeplitz matrix

Uses Software

• na12

This page was built for publication: Effective Methods for Solving Banded Toeplitz Systems