منابع مشابه
Block Diagonalization of Nearly Diagonal Matrices
In this paper we study the effect of block diagonalization of a nearly diagonal matrix by iterating the related Riccati equations. We show that the iteration is fast, if a matrix is diagonally dominant or scaled diagonally dominant and the block partition follows an appropriately defined spectral gap. We also show that both kinds of diagonal dominance are not destroyed after the block diagonali...
متن کاملFast block diagonalization of k-tridiagonal matrices
In the present paper, we give a fast algorithm for block diagonalization of k-tridiagonal matrices. The block diagonalization provides us with some useful results: e.g., another derivation of a very recent result on generalized k-Fibonacci numbers in [M.E.A. El-Mikkawy, T. Sogabe, A new family of k-Fibonacci numbers, Appl. Math. Comput. 215 (2010) 4456– 4461]; efficient (symbolic) algorithm for...
متن کاملBlind Separation of Cyclostationary Sources Using Joint Block Approximate Diagonalization
This paper introduces an extension of an earlier method of the author for separating stationary sources, based on the joint approximated diagonalization of interspectral matrices, to the case of cyclostationary sources, to take advantage of their cyclostationarity. the proposed method is based on the joint block approximate diagonlization of cyclic interspectral density. An algorithm for this d...
متن کاملOn Simultaneous Block-Diagonalization of Cyclic Commuting Matrices
We study simultaneous block-diagonalization of cyclic d-tuples of commuting matrices. Some application to ideal projectors are also presented. In particular we extend Hans Stetters theorem characterizing Lagrange projectors. 1 Introduction Let V be a nite-dimensional space over complex eld C and let L := (L1; :::; Ld) be a d-tuple of pairwise commuting operators on V . Every polynomial p(x1;...
متن کاملAlgorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices
An algorithm is given for the problem of finding the finest simultaneous block-diagonalization of a given set of square matrices. This problem has been studied independently in the area of semidefinite programming and independent component analysis. The proposed algorithm considers the commutant algebra of the matrix ∗-algebra generated by the given matrices. It is simpler than other existing m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Bohemica
سال: 2001
ISSN: 0862-7959,2464-7136
DOI: 10.21136/mb.2001.133928