# TransportMaps.Algorithms.SparsityIdentification¶

Classes

Class Description
ReverseCholesky
MinFill
MinDegree

Functions

Function Description
SING Identify a sparse edge set of the undirected graph corresponding to the data.
gen_precision
TransportMaps.Algorithms.SparsityIdentification.SING(data, p_order, ordering, delta, REG=None)[source]
Parameters: data – data $${\bf x}_i, i = 1,\dots,n$$, p_order (int) – polynomial order of the transport map representation, ordering – scheme used to reorder the variables, delta (float) – tolerance $$\delta$$ REG (dict) – regularization dictionary with keys ‘type’ and ‘reweight’ the generalized precision $$\Omega$$