Results 11 to 20 of about 1,052,390 (266)
Random Block Matrices and Matrix Orthogonal Polynomials [PDF]
Journal of Theoretical Probability, 2008 In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be uniformly approximated by roots of matrix orthogonal polynomials which were investigated independently from the random ...
Holger Dette, Bettina Reuther
openaire +5 more sources
The inverse of a certain block matrix [PDF]
Bulletin of the Australian Mathematical Society, 1979 A simple formula for the inverse of a block matrix with non-zero blocks in the principal diagonal and the first sub-diagonal only is proved. The matrix had arisen in an investigation of a difference equation.
Vipul Singh
openalex +3 more sources
The Limiting Spectra of Girko's Block-Matrix [PDF]
Journal of Theoretical Probability, 2006 10 ...
Tamer Oraby
openalex +5 more sources
Block ILU factorization preconditioners for a block-tridiagonal H-matrix
Linear Algebra and its Applications, 2000 AbstractWe propose new parallelizable block ILU (incomplete LU) factorization preconditioners for a nonsymmetric block-tridiagonal H-matrix. Theoretical properties of these block ILU preconditioners are compared with those of block ILU preconditioners for the corresponding comparison matrix.
Sang‐Wook Kim, Jae Heon Yun
openalex +3 more sources
Block Matrix Formulations for Evolving Networks [PDF]
SIAM Journal on Matrix Analysis and Applications, 2017 18 pages, 2 ...
Fenu, Caterina, Higham, Desmond J.
openaire +5 more sources
Approximations for the general block distribution of a matrix [PDF]
Theoretical Computer Science, 1998 AbstractThe general block distribution of a matrix is a rectilinear partition of the matrix into orthogonal blocks such that the maximum sum of the elements within a single block is minimized. This corresponds to partitioning the matrix onto parallel processors so as to minimize processor load while maintaining regular communication patterns ...
Fredrik Manne +3 more
openaire +2 more sources
On the adjacency matrix of a block graph [PDF]
Linear and Multilinear Algebra, 2013 A block graph is a graph in which every block is a complete graph. Let be a block graph and let be the adjacency matrix of . We first obtain a formula for the determinant of over reals. It is shown that is nonsingular over if and only if the removal of any vertex from produces a graph with exactly one odd component. A formula for the inverse of over is
Ravindra B. Bapat, Souvik Roy
openaire +2 more sources
On similarity of an arbitrary matrix to a block diagonal matrix
Filomat, 2021 Let an n x n -matrix A have m < n (m ? 2) different eigenvalues ?j of the algebraic multiplicity ?j (j = 1,..., m). It is proved that there are ?j x ?j-matrices Aj, each of which has a unique eigenvalue ?j, such that A is similar to the block-diagonal matrix ?D = diag (A1,A2,..., Am). I.e. there is an invertible matrix T, such that T-1AT
openaire +2 more sources
The two-block covariance matrix and the CAPM [PDF]
International Journal of Portfolio Analysis and Management, 2012 The classical assumptions of the Capital Asset Pricing Model do not ensure obtaining a tangency (market) portfolio in which all the risky assets appear with positive proportions. This paper gives an additional set of assumptions that ensure obtaining such a portfolio.
David Disatnik, Simon Benninga
openaire +2 more sources
Matrix compression along isogenic blocks
Acta Scientiarum Mathematicarum, 2022 AbstractA matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation that Hadamard entrywise functional calculus preserves isogenic blocks has already proved to be of ...
Belton, Alexander +3 more
openaire +4 more sources