๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the computation of the rank of block bidiagonal Toeplitz matrices

โœ Scribed by Dimitrios Triantafyllou; Marilena Mitrouli


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
526 KB
Volume
227
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


On the ranks of Toeplitz matrices over f
โœ Geoffrey L. Price; Glenn H. Truitt ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 220 KB

Let T be a skew-symmetric Toeplitz matrix with entries in a ยฎnite ยฎeld. For all positive integers n let n be the upper n ร‚ n corner of T, with nullity m n m n . The sequence fm n X n P Ng satisยฎes a unimodality property and is eventually periodic if the entries of T satisfy a periodicity condition.

On the extreme eigenvalues of hermitian
โœ Stefano Serra ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 758 KB

We are concerned with the behavior of the minimum (maximum) eigenvalue A~0 "~ (A~ "~) of an (n + 1) X (n + 1) Hermitian Toeplitz matrix T~(f) where f is an integrable real-valued function. Kac, Murdoch, and Szeg5, Widom, Patter, and R. H. Chan obtained that A}~ 0 -rain f = O(1/n 2k) in the case whe

On the rank of random matrices
โœ C. Cooper ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 209 KB ๐Ÿ‘ 2 views

Let M = m ij be a random n ร— n matrix over GF(2). Each matrix entry m ij is independently and identically distributed, with Pr m ij = 0 = 1 -p n and Pr m ij = 1 = p n . The probability that the matrix M is nonsingular tends to c 2 โ‰ˆ 0 28879 provided min p 1 -p โ‰ฅ log n + d n /n for any d n โ†’ โˆž. Sharp

On the rank of certain matrices
โœ Pietro Corvaja; Umberto Zannier ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 98 KB

Osculating spaces and diophantine equations (with an Appendix by Pietro Corvaja and Umberto Zannier)" by M. Bolognesi and G. Pirola.