10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

376 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX<br />

Figure 103: A depiction of molecular conformation. [99]<br />

This semidefinite program realizes the wireless location problem illustrated in<br />

Figure 101. Location X ⋆ (:, 1) is taken as solution, although measurement<br />

noise will often cause rankG ⋆ to exceed 2. Randomized search for a rank-2<br />

optimal solution is not so easy here as in Example 5.4.2.2.7. We introduce a<br />

method in4.4 for enforcing the stronger rank-constraint (845). To formulate<br />

this same problem in three dimensions, point list X is simply redimensioned<br />

in the semidefinite program.<br />

<br />

5.4.2.2.9 Example. (Biswas, Nigam, Ye) Molecular Conformation.<br />

The subatomic measurement technique called nuclear magnetic resonance<br />

spectroscopy (NMR) is employed to ascertain physical conformation of<br />

molecules; e.g., Figure 3, Figure 103. From this technique, distance, angle,<br />

and dihedral angle measurements can be obtained. Dihedral angles arise<br />

consequent to a phenomenon where atom subsets are physically constrained<br />

to Euclidean planes.<br />

In the rigid covalent geometry approximation, the bond lengths<br />

and angles are treated as completely fixed, so that a given spatial<br />

structure can be described very compactly indeed by a list of<br />

torsion angles alone... These are the dihedral angles between<br />

the planes spanned by the two consecutive triples in a chain of<br />

four covalently bonded atoms. [77,1.1]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!