No CrossRef data available.
Published online by Cambridge University Press: 01 January 2025
The problem of locating two sets of points in a joint space, given the Euclidean distances between elements from distinct sets, is solved algebraically. For error free data the solution is exact, for fallible data it has least squares properties.
This remedy did not work as well in practice as had been hoped when these lines were written. If M has nonpositive roots the program should be terminated. One of my students, Miss Wang, is presently working on a more robust least squares solution to handle the fallible case.