Results 21 to 30 of about 640,424 (149)
Nonconventional random matrix products
Electronic Communications in Probability, 2018 Let $ _1, _2,...$ be independent identically distributed random variables and $F:\bbR^\ell\to SL_d(\bbR)$ be a Borel measurable matrix-valued function.
Kifer, Y, SODIN, A
openaire +3 more sources
Parallel Algorithms for Masked Sparse Matrix-Matrix Products
Proceedings of the 51st International Conference on Parallel Processing, 2022 Computing the product of two sparse matrices (SpGEMM) is a fundamental operation in various combinatorial and graph algorithms as well as various bioinformatics and data analytics applications for computing inner-product similarities. For an important class of algorithms, only a subset of the output entries are needed, and the resulting operation is ...
Milaković, Srđan +4 more
openaire +2 more sources
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
Special Matrices, 2018 In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
AN ORDER-P TENSOR MULTIPLICATION WITH CIRCULANT STRUCTURE
Barekeng, 2023 Research on mathematical operations involving multidimensional arrays or tensors has increased along with the growing applications involving multidimensional data analysis. The -product of order- tensor is one of tensor multiplications.
Itsar Mangngiri +2 more
doaj +1 more source
Matrix product and sum rule for Macdonald polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We present a new, explicit sum formula for symmetric Macdonald polynomials Pλ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov– Faddeev (ZF) algebra.
Luigi Cantini +2 more
doaj +1 more source
Matrix Product States with Large Sites [PDF]
Journal of Chemical Theory and Computation, 2022 We explore various ways to group orbitals into clusters in a matrix product state (MPS). We explain how a generic cluster MPS can often lead to an increase in computational cost and instead propose a special cluster structure, involving only the first and last orbitals/sites, with a wider scope for computational advantage.
Henrik R. Larsson +3 more
openaire +4 more sources
Quantum Error Mitigation via Matrix Product Operators
PRX Quantum, 2022 In the era of noisy intermediate-scale quantum devices, the number of controllable hardware qubits is insufficient to implement quantum error correction.
Yuchen Guo, Shuo Yang
doaj +1 more source
Thermoplastic matrix towpreg production
Advances in Polymer Technology, 2010 AbstractThis work was carried out to establish the processing window for the cost‐efficient production of thermoplastic matrix towpregs with a recently developed powder‐coating equipment. Three different fiber‐reinforced thermoplastic matrix systems were studied: one for highly demanding markets (carbon fiber/Primospire™) and other two for commercial ...
Silva, J. F. +4 more
openaire +2 more sources
Light-cone matrix product [PDF]
Journal of Mathematical Physics, 2009 We show how to combine the light-cone and matrix product algorithms to simulate quantum systems far from equilibrium for long times. For the case of the XXZ spin chain at Δ=0.5, we simulate to a time of ≈22.5. While part of the long simulation time is due to the use of the light-cone method, we also describe a modification of the infinite time-evolving
openaire +2 more sources
Optimising Matrix Product State Simulations of Shor's Algorithm [PDF]
Quantum, 2019 We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure of a matrix ...
Aidan Dang +2 more
doaj +1 more source