Results 11 to 20 of about 1,502,182 (290)
The Inverses of Block Toeplitz Matrices [PDF]
Journal of Mathematics, 2013 We study the inverses of block Toeplitz matrices based on the analysis of the block cyclic displacement. New formulas for the inverses of block Toeplitz matrices are proposed.
Xiao-Guang Lv, Ting-Zhu Huang
doaj +5 more sources
Quantum LDPC Codes Based on Cocyclic Block Matrices [PDF]
Entropy, 2023 Motivated by a family of binary cocyclic block matrices over GF(2), we proposed a construction method to gain the stabilizer of long-length quantum error-correction codes (QECCs).
Yuan Li, Ying Guo
doaj +2 more sources
Block Iterators for Sparse Matrices [PDF]
Annals of computer science and information systems, 2016 Finding an optimal block size for a given sparse matrix forms an important problem for storage formats that partition matrices into uniformly-sized blocks. Finding a solution to this problem can take a significant amount of time, which, effectively, may negate the benefits that such a format brings into sparse-matrix computations.
Daniel Langr +2 more
doaj +3 more sources
Block Eigenvalues of block compound matrices [PDF]
Linear Algebra and its Applications, 1982 AbstractWe obtain some results about the block eigenvalues of block compound matrices and additive block compound matrices. Assuming that a certain block Vandermonde matrix is nonsingular, we generalize known results for (scalar) compound and additive compound matrices.
Victória, José
openaire +3 more sources
On the Limiting Distribution of the Spectra of Random Block Matrices
MathematicsThe behavior of the spectra of symmetric block-type random matrices with symmetric blocks of high dimensionality is considered in this paper. Under minimal conditions regarding the distributions of matrix block elements (Lindeberg conditions), the ...
Alexander N. Tikhomirov
doaj +3 more sources
The eigenvalue distribution of block diagonally dominant matrices and block H-matrices [PDF]
The Electronic Journal of Linear Algebra, 2010 The paper studies the eigenvalue distribution of some special matrices, including block diagonally dominant matrices and block H matrices. A well-known theorem of Taussky on the eigenvalue distribution is extended to such matrices. Conditions on a block matrix are also given so that it has certain numbers of eigenvalues with positive and negative real ...
Cheng-Yi Zhang +3 more
openaire +3 more sources
Algorithms for Recursive Block Matrices [PDF]
CoRRTo appear in "LALO 60: Matrices and Polynomials in Computer Algebra"
Watt, Stephen M.
core +4 more sources
Alternative methods for representing the inverse of linear programming basis matrices [PDF]
, 1988 Methods for representing the inverse of Linear Programming (LP) basis matrices are closely related to techniques for solving a system of sparse unsymmetric linear equations by direct methods.
Mitra, G, Tamiz, M
core +6 more sources
Sparse random block matrices [PDF]
Journal of Physics A: Mathematical and Theoretical, 2022 Abstract The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erdös–Renyi random graph. The blocks are i.i.d. random matrices of the classical ensembles GOE or GUE. The moments are evaluated for finite or infinite
Giovanni M Cicuta, Mario Pernici
openaire +3 more sources
Exact bounds for (λ,n)–stable 0-1 matrices. [PDF]
Transactions on Combinatorics, 2020 Consider a v × v (0, 1) matrix A with exactly k ones in each row and each column. A is (λ, n)–stable, if it does not contain any λ × n submatrix with exactly one 0. If A is (λ, n)–stable, λ, n ≥ 2, then under suitable conditions on A, v ≥ k k(n−1)+(λ−2) .
Trevor Bruen
doaj +1 more source