A kernel based reordering algorithm

A class of mesh-free algorithms for mathematical finance, machine learning and fluid dynamics

“…We emphasize that this algorithm assumes that the initial map is positive in the sense that its Jacobian is positive, that is, ∇ x h ≥ 0. To this purpose, a reordering algorithm is required (and is described in [18]). In particular, the operator (∇ x ) −1 is presented in [16].…”

“…• Update the variable x to now be x σ , where σ = LSAP (d k (x, y)) denotes the permutation computed by the linear sum assignment problem (LSAP) described in [18] and d K denotes the discrepancy error matrix.…”