Trees | Indices | Help |
---|
|
Just a container class with helper functions taken from the script tens.py of golem which generates most of the golem95 tens_rec.f fortran code.
|
|||
|
|||
|
|||
|
|||
|
|
|||
PRIMES =
|
|
Generates a mapping from tensor components \hat{C}(a_1, ..., a_k) into a one dimensional array. PARAMETER R -- rank k -- number of non-zero components of q RETURN (lst, dic) lst -- list of (a_1, ..., a_k) dic -- mapping from (a_1, ..., a_k) -> int lst[dic[X]] = X if X in dic |
Generates a set of equations for a given number of non-zero components and fixed maximum rank. PARAMETER R -- rank k -- number of non-zero components of q RETURN (LHS, RHS) LHS -- a matrix (i.e. list of lists) of coefficients RHS -- a list of values of q |
Iterator over all selections of k elements from a given list. PARAMETER items -- list of elements to choose from (no repetitions) k -- number of elements to select. |
|
PRIMES
|
Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Mon Feb 4 12:20:10 2019 | http://epydoc.sourceforge.net |