On the computation of the rank of block bidiagonal Toeplitz matrices

DOI10.1016/j.cam.2008.07.023zbMath1162.65022OpenAlexW2002374265MaRDI QIDQ1012505

Dimitrios Triantafyllou, Marilena Mitrouli

Publication date: 21 April 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.07.023

zbMATH Keywords

algorithmsnumerical examplesrankdirect methodsToeplitzblock bidiagonalsymbolical implementationupdating methods

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rang revealing QR factorizations
• Rank and null space calculations using matrix decomposition without column interchanges
• An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
• Displacement ranks of matrices and linear equations
• A fast algorithm for index of annihilation computations
• Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
• High performance algorithms for Toeplitz and block Toeplitz matrices
• Partial singular value decomposition algorithm
• Stability Issues in the Factorization of Structured Matrices
• Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
• A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
• A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices
• Displacement Structure: Theory and Applications
• A fast algorithm for subspace state-space system identification via exploitation of the displacement structure

This page was built for publication: On the computation of the rank of block bidiagonal Toeplitz matrices