Sparse Partial-Tracing

03/19/2023
by   Julio Candanedo, et al.
0

Matrices and more generally multidimensional arrays, form the backbone of computational studies. In this paper we demonstrate increases in computational efficiency by performing partial-tracing/tensor-contractions on sparse-arrays. It was shown that sparse-arrays are really 3 dense-arrays (dense-shape, index-array, and data-array). Dense-array manipulations of these constituent arrays are used to determine the resulting partial-trace. Because computational arrays are used in a verity of different studies, these methods are broadly applicable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2020

Families of Multidimensional Arrays with Good Autocorrelation and Asymptotically Optimal Cross-correlation

We introduce a construction for families of 2n-dimensional arrays with a...
research
07/27/2018

Sparse Matrix Code Dependence Analysis Simplification at Compile Time

Analyzing array-based computations to determine data dependences is usef...
research
07/30/2016

TRIOT: Faster tensor manipulation in C++11

[abridged] Context: Multidimensional arrays are used by many different a...
research
05/01/2020

Multi-dimensional Arrays with Levels

We explore a data structure that generalises rectangular multi-dimension...
research
06/09/2022

Linear Delta Arrays for Compliant Dexterous Distributed Manipulation

This paper presents a new type of distributed dexterous manipulator: del...
research
05/23/2016

Stochastic Patching Process

Stochastic partition models tailor a product space into a number of rect...
research
02/01/2017

Location and Orientation Optimisation for Spatially Stretched Tripole Arrays Based on Compressive Sensing

The design of sparse spatially stretched tripole arrays is an important ...

Please sign up or login with your details

Forgot password? Click here to reset