Results 21 to 30 of about 1,040,614 (343)
Nihon Kikai Gakkai ronbunshu, 2023 NV (Noise and Vibration) performance is determined by the influence of all components constituting a whole structure. It is difficult to design NV performance efficiently because the structural modification of a certain component affects the performance ...
Masashi INABA, Yuichi MATSUMURA
doaj +1 more source
On the Rank of Random Sparse Matrices [PDF]
Combinatorics, Probability and Computing, 2009 We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This allows us to obtain an exact estimate for the co-rank.
Kevin P. Costello, Van H. Vu
openaire +3 more sources
The Chunks and Tasks Matrix Library
SoftwareX, 2022 We present a C++ header-only parallel sparse matrix library, based on sparse quadtree representation of matrices using the Chunks and Tasks programming model.
Emanuel H. Rubensson +3 more
doaj +1 more source
Sparse matrices in frame theory [PDF]
Computational Statistics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felix Krahmer +2 more
openaire +4 more sources
Applied Sciences, 2022 The sparse matrix–vector product (SpMV), considered one of the seven dwarfs (numerical methods of significance), is essential in high-performance real-world scientific and analytical applications requiring solution of large sparse linear equation systems,
Muhammad Ahmed +6 more
doaj +1 more source
Explicit Expression for Arbitrary Positive Integer Powers of Special Sparse Matrices
Journal of Mathematics, 2022 Sparse matrices appear frequently in mathematical models. In this paper, we firstly present a general expression for the entries of the r th r∈ℕ power of a certain n-square sparse matrix, in terms of the Chebyshev polynomials of the second kind. Secondly,
Mohammad Beiranvand +1 more
doaj +1 more source
IEEE Access, 2022 Recent advances have shown that the challenging problem of matrix completion arises from real-world applications, such as image recovery, and recommendation systems.
Ying Zhang +3 more
doaj +1 more source
RadiX-Net: Structured Sparse Matrices for Deep Neural Networks [PDF]
IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, 2019 The sizes of deep neural networks (DNNs) are rapidly outgrowing the capacity of hardware to store and train them. Research over the past few decades has explored the prospect of sparsifying DNNs before, during, and after training by pruning edges from ...
Ryan A. Robinett, J. Kepner
semanticscholar +1 more source
Pentadiagonal Companion Matrices
Special Matrices, 2016 The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally ...
Eastman Brydon, Vander Meulen Kevin N.
doaj +1 more source
Application of Sparse Representation in Bioinformatics
Frontiers in Genetics, 2021 Inspired by L1-norm minimization methods, such as basis pursuit, compressed sensing, and Lasso feature selection, in recent years, sparse representation shows up as a novel and potent data processing method and displays powerful superiority.
Shuguang Han +8 more
doaj +1 more source