Publication:2730453
From MaRDI portal
zbMath0977.65016MaRDI QIDQ2730453
Publication date: 8 August 2001
spheres; Newton iteration; distance geometry; nonlinear least squares problem; points of intersection
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, Discretization orders and efficient computation of Cartesian coordinates for distance geometry, Extending the geometric build-up algorithm for the molecular distance geometry problem, Realizing Euclidean distance matrices by sphere intersection, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, On the geometry of some localisation problems in robotics, Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension, The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, On the number of realizations of certain Henneberg graphs arising in protein conformation
