منابع مشابه
Block Diagonal Matrices
For simplicity, we adopt the following rules: i, j, m, n, k denote natural numbers, x denotes a set, K denotes a field, a, a1, a2 denote elements of K, D denotes a non empty set, d, d1, d2 denote elements of D, M , M1, M2 denote matrices over D, A, A1, A2, B1, B2 denote matrices over K, and f , g denote finite sequences of elements of N. One can prove the following propositions: (1) Let K be a ...
متن کامل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...
متن کاملON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION
The matrix functions appear in several applications in engineering and sciences. The computation of these functions almost involved complicated theory. Thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. The aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. More...
متن کاملBlock Companion Matrices, Discrete–time Block Diagonal Stability and Polynomial Matrices
A polynomial matrix G(z) = Izm −∑m−1 i=0 Ciz with complex coefficients is called discrete-time stable if its characteristic values (i.e. the zeros of detG(z) ) are in the unit disc. A corresponding block companion matrix C is used to study discrete-time stability of G(z) . The main tool is the construction of block diagonal solutions P of a discrete-time Lyapunov inequality P−C∗PC 0 .
متن کاملPermuting Sparse Square Matrices into Block Diagonal Form with Overlap
In this whitepaper, we describe the problem of permuting sparse square matrices into block diagonal form with overlap (BDO) and propose a graph partitioning algorithm for solving this problem. A block diagonal matrix with overlap is a block diagonal matrix whose consecutive diagonal blocks may overlap. The objective in this permutation problem is to minimize the total overlap size, whereas the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2008
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-008-0031-1