1#ifndef CANONICAL_POLYADIC_DECOMPOSITION_DEFINED
2#define CANONICAL_POLYADIC_DECOMPOSITION_DEFINED
12template <
typename F =
double>
21template <
typename F =
double>
39template <
typename F =
double>
61template <
typename F =
double>
Definition Algorithm.hpp:10
void dryContractWithCanonicalPolyadicDecompositionTensors(DryTensor< F > &T, char const *indicesT, DryTensor< F > &B, char const idxB, DryTensor< F > &C, char const idxC, DryTensor< F > &A, char const idxA)
Performs a dry run of the calculation using a contraction order with minimal memory footprint.
Definition CanonicalPolyadicDecomposition.cxx:172
void composeCanonicalPolyadicDecompositionTensors(Tensor< F > &A, Tensor< F > &B, Tensor< F > &C, Tensor< F > &T)
Calculates with minimal memory footprint.
Definition CanonicalPolyadicDecomposition.cxx:11
void contractWithCanonicalPolyadicDecompositionTensors(Tensor< F > &T, char const *indicesT, Tensor< F > &B, char const idxB, Tensor< F > &C, char const idxC, Tensor< F > &A, char const idxA)
Calculates using a contraction order with minimal memory footprint.
Definition CanonicalPolyadicDecomposition.cxx:103
void dryComposeCanonicalPolyadicDecompositionTensors(DryTensor< F > &A, DryTensor< F > &B, DryTensor< F > &C, DryTensor< F > &T)
Performs a dry run of the calculation with minimal memory footprint.
Definition CanonicalPolyadicDecomposition.cxx:61