Results 1 to 10 of about 256,397 (171)
Quantum circuits from non-unitary sparse binary matrices [PDF]
Quantum computing leverages unitary matrices to perform reversible computations while preserving probability norms. However, many real-world applications involve non-unitary sparse matrices, posing a challenge for quantum implementation.
Krishnageetha Karuppasamy +3 more
doaj +2 more sources
Sparse random block matrices [PDF]
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
Random matrices and random graphs* [PDF]
We collect recent results on random matrices and random graphs. The topics covered are: fluctuations of the empirical measure of random matrices, finite-size effects of algorithms involving random matrices, characteristic polynomial of sparse matrices ...
Capitaine Mireille +4 more
doaj +1 more source
Sparse block-structured random matrices: universality
We study ensembles of sparse block-structured random matrices generated from the adjacency matrix of a Erdös–Renyi random graph with N vertices of average degree Z , inserting a real symmetric d × d random block at each non-vanishing entry. We consider
Giovanni M Cicuta, Mario Pernici
doaj +1 more source
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
The Chunks and Tasks Matrix Library
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
Explicit Expression for Arbitrary Positive Integer Powers of Special Sparse Matrices
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
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
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
Hierarchical Orthogonal Factorization: Sparse Square Matrices [PDF]
In this work, we develop a new fast algorithm, spaQR -- sparsified QR, for solving large, sparse linear systems. The key to our approach is using low-rank approximations to sparsify the separators in a Nested Dissection based Householder QR factorization.
Abeynaya Gnanasekaran, Eric Darve
openaire +3 more sources

