Results 21 to 30 of about 257,716 (284)
Spectral Theory of Sparse Non-Hermitian Random Matrices [PDF]
, 2019 Sparse non-Hermitian random matrices arise in the study of disordered physical systems with asymmetric local interactions, and have applications ranging from neural networks to ecosystem dynamics.
Abou-Chacra R +38 more
core +3 more sources
Some results on sparse matrices [PDF]
Mathematics of Computation, 1970 A comparison in the context of sparse matrices is made between the Product Form of the Inverse PFI (a form of Gauss-Jordan elimination) and the Elimination Form of the Inverse EFI (a form of Gaussian elimination). The precise relation of the elements of these two forms of the inverse is given in terms of the nontrivial elements of the three matricesLL ...
Brayton, Robert K. +2 more
openaire +2 more sources
New Orthogonal Transforms for Signal and Image Processing
Applied Sciences, 2021 In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. These transforms can be considered as generalized Walsh–Hadamard Transforms.
Andrzej Dziech
doaj +1 more source
Sparse matrices in frame theory [PDF]
Computational Statistics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Krahmer, Felix +2 more
openaire +4 more sources
Journal of Telecommunications and Information Technology, 2019 This paper considers several algorithms for parallelizing the procedure of forward and back substitution for high-order symmetric sparse matrices on multi-core computers with shared memory.
Sergiy Fialko
doaj +1 more source
Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms
IEEE Access, 2021 This paper presents factorizations of each discrete sine transform (DST) matrix of types I, II, III, and IV into a product of sparse, diagonal, bidiagonal, and scaled orthogonal matrices.
Sirani M. Perera, Levi E. Lingsch
doaj +1 more source
Spectral radii of sparse random matrices
, 2020 We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices. In particular,
Benaych-Georges, Florent +2 more
core +3 more sources
Inference for High-dimensional Differential Correlation Matrices [PDF]
, 2015 Motivated by differential co-expression analysis in genomics, we consider in this paper estimation and testing of high-dimensional differential correlation matrices.
Cai, T. Tony, Zhang, Anru
core +3 more sources
Structured random measurements in signal processing [PDF]
, 2014 Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a minimal number ...
Krahmer, Felix, Rauhut, Holger
core +1 more source
The Electronic Journal of Linear Algebra, 2019 Given a polynomial $p(z)$, a companion matrix can be thought of as a simple template for placing the coefficients of $p(z)$ in a matrix such that the characteristic polynomial is $p(z)$. The Frobenius companion and the more recently-discovered Fiedler companion matrices are examples.
Deaett, Louis +3 more
openaire +2 more sources