An R package for Euclidean (squared) distance matrix completion (and determining point configurations based on the completed matrix.)
Implements various general algorithms to estimate missing elements of a Euclidean (squared) distance matrix. Includes optimization methods based on semi-definite programming, nonparametric position, and dissimilarity parameterization formulas.
When the only non-missing distances are those on the minimal spanning tree, the guided random search algorithm will complete the matrix while preserving the minimal spanning tree.
Point configurations in specified dimensions can be determined from the completions.
Special problems such as the sensor localization problem and reconstructing the geometry of a molecular structure can also be solved.
Online documentation: https://great-northern-diver.github.io/edmcr/
Other source code:
C
source code (sparse matrix column ordering authored by Stefan I. Larimore and Timothy A. Davis) from the Suite Sparse collection.Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.