Results 141 to 150 of about 2,725,619 (370)
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
Karppa & Kaski (2019) proposed a novel ``broken" or ``opportunistic" matrix multiplication algorithm, based on a variant of Strassen's algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks. Their algorithm can compute Boolean matrix multiplication in $O(n^{2.778})$ time.
openaire +5 more sources
This article provides an overview of recent advancements in bulk processing of rare‐earth‐free hard magnetic materials. It also addresses related simulation approaches at different scales. The research on rare‐earth‐free magnetic materials has increased significantly in recent years, driven by supply chain issues, environmental and social concerns, and
Daniel Scheiber, Andrea Bachmaier
wiley +1 more source
Matrix computation over homomorphic plaintext-ciphertext and its application
Those homomorphic encryption schemes supporting single instruction multiple data (SIMD) operations effectively enhance the amortized efficiency of ciphertext computations, yet the structure of ciphertexts leads to high complexity in matrix operations.In ...
Yang LIU +4 more
doaj +2 more sources
Emulating quantum computing with optical matrix multiplication
Optical computing harnesses the speed of light to perform vector-matrix operations efficiently. It leverages interference, a cornerstone of quantum computing algorithms, to enable parallel computations.
Mwezi Koni +2 more
doaj +1 more source
Sparse matrix multiplication in a record-low power self-rectifying memristor array for scientific computing. [PDF]
Li J +11 more
europepmc +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Multiple context-free path querying by matrix multiplication
Many graph analysis problems can be formulated as formal language-constrained path querying problems where the formal languages are used as constraints for navigational path queries.
I. V. Epelbaum +2 more
doaj +1 more source
Straggler- and Adversary-Tolerant Secure Distributed Matrix Multiplication Using Polynomial Codes. [PDF]
Byrne E, Gnilke OW, Kliewer J.
europepmc +1 more source
Optical implementation of systolic array processing [PDF]
Algorithms for matrix vector multiplication are implemented using acousto-optic cells for multiplication and input data transfer and using charge coupled devices detector arrays for accumulation and output of the results.
Caulfield, H. J. +3 more
core +1 more source
Curvature‐tuned auxetic lattices are designed, fabricated, and mechanically characterized to reveal how geometric curvature governs stretchability, stress redistribution, and Poisson's ratio evolution. Photoelastic experiments visualize stress pathways, while hyperelastic simulations quantify deformation mechanics.
Shuvodeep De +3 more
wiley +1 more source

