Embedding with a Rigid Substructure

04/29/2018
by   Igor Najfeld, et al.
0

This paper presents a new distance geometry algorithm for calculating atomic coordinates from estimates of the interatomic distances, which maintains the positions of the atoms in a known rigid substructure. Given an M × 3 matrix of coordinates for the rigid substructure X, this problem consists of finding the N × 3 matrix Y that yields of global minimum of the so-called STRAIN, i.e. _ Y< b m a t r i x > - < b m a t r i x >_ F^2 , where A = XX^ , and B, C are matrices of inner products calculated from the estimated distances. The vanishing of the gradient of the STRAIN is shown to be equivalent to a system of only six nonlinear equations in six unknowns for the inertial tensor associated with the solution Y . The entire solution space is characterized in terms of the geometry of the intersection curves between the unit sphere and certain variable ellipsoids. Upon deriving tight bilateral bounds on the moments of inertia of any possible solution, we construct a search procedure that reliably locates the global minimum. The effectiveness of this method is demonstrated on realistic simulated and chemical test problems.

READ FULL TEXT

page 24

page 35

research
10/18/2018

Nonlinear Mapping and Distance Geometry

Distance Geometry Problem (DGP) and Nonlinear Mapping (NLM) are two well...
research
01/03/2022

Realizations of Rigid Graphs

A minimally rigid graph, also called Laman graph, models a planar framew...
research
07/28/2017

Fractions, Projective Representation, Duality, Linear Algebra and Geometry

This contribution describes relationship between fractions, projective r...
research
10/13/2022

Codes from incidence matrices of hypergraphs

Binary codes are constructed from incidence matrices of hypergraphs. A c...
research
09/13/2019

Direct transformation from Cartesian into geodetic coordinates on a triaxial ellipsoid

This paper presents two new direct symbolic-numerical algorithms for the...
research
10/11/2018

A random model for multidimensional fitting method

Multidimensional fitting (MDF) method is a multivariate data analysis me...
research
09/11/2020

A new algorithm for the ^KDMDGP subclass of Distance Geometry Problems

The fundamental inverse problem in distance geometry is the one of findi...

Please sign up or login with your details

Forgot password? Click here to reset