Jacob Sanders edited Molecular Vibrations 5.tex  over 9 years ago

Commit id: e9ac8f826a8e4cd4f4340b4d5847714958083dfe

deletions | additions      

       

As Fig.~\ref{fig:HessSparsity} shows, for moderately-sized molecules, the sparsity \(S\) of a quantum mechanical Hessian does not scale linearly with the number of atoms \(N\) in the molecule. Fig.~\ref{fig:NColumnsVsNRings} illustrates the results of applying compressed sensing to the recovery of the quantum mechanical Hessians of polyacenes. We recover the quantum mechanical Hessians in a variety of sparse bases and, in all cases, columns are sampled in the DCT basis with respect to the recovery basis. We plot the minimum number of columns which must be sampled to achieve a relative Frobenius norm error less than \(10^{-3}\) as a function of both the recovery basis and the size of the polyacene.  Recovering the Hessian in the atomic coordinate basis already provides a considerable computational advantage over directly computing the entire Hessian. In fact, this curve mirrors the sparsity per column curve for quantum mechanical Hessians in Fig.~\ref{fig:HessSparsity}, consistent with our prediction that the number of sampled columns scales as \(O(S/N \log N) \times OE\). More significantly, recovering the quantum mechanical Hessian in the basis of molecular mechanics normal modes provides a substantial advantage over recovery in the basis of atomic coordinates, reducing the number of columns which must be sampled approximately by a factor of two. This is consistent with the fact that the quantum mechanical Hessian is considerably sparser in the approximate eigenbasis of molecular mechanics normal modes. Of course, nothing beats recovery in the exact eigenbasis, which is as sparse as possible, but that which  requires knowing the exact Hessian in the first place. In short, the take-home message of Fig.~\ref{fig:NColumnsVsNRings} is that using compressed sensing to recover a quantum mechanical Hessian in its basis of molecular mechanics normal modes is a practical procedure which substantially reduces the computational cost of the procedure.