On the computation of the rank of block bidiagonal Toeplitz matrices

Authors:
Dimitrios Triantafyllou;Marilena Mitrouli
Affiliations:
Department of Mathematics, University of Athens Panepistemiopolis 15784, Athens, Greece;Department of Mathematics, University of Athens Panepistemiopolis 15784, Athens, Greece
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 9
Cited 0

An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values

Journal of Computational and Applied Mathematics
Partial singular value decomposition algorithm (Algorithm 32)

Journal of Computational and Applied Mathematics
Generalized Displacement Structure for Block-Toeplitz,Toeplitz-Block, and Toeplitz-Derived Matrices

SIAM Journal on Matrix Analysis and Applications
A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices

SIAM Journal on Matrix Analysis and Applications
Displacement structure: theory and applications

SIAM Review
Stability Issues in the Factorization of Structured Matrices

SIAM Journal on Matrix Analysis and Applications
A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations

SIAM Journal on Matrix Analysis and Applications
A fast algorithm for subspace state-space system identification via exploitation of the displacement structure

Journal of Computational and Applied Mathematics
Linear System Theory and Design

Linear System Theory and Design

Quantified Score

Hi-index	7.29

Visualization

Abstract

In the present paper we study the computation of the rank of a block bidiagonal Toeplitz (BBT) sequence of matrices. We propose matrix-based, numerical and symbolical, updating and direct methods, computing the rank of BBT matrices and comparing them with classical procedures. The methods deploy the special form of the BBT sequence, significantly reducing the required flops and leading to fast and efficient algorithms. The numerical implementation of the algorithms computes the numerical rank in contrast with the symbolical implementation, which guarantees the computation of the exact rank of the matrix. The combination of numerical and symbolical operations suggests a new approach in software mathematical computations denoted as hybrid computations.