Polynomial System Solving: the Case of a Six-Atom Molecule - Archive ouverte HAL Access content directly
Reports Year : 1996

Polynomial System Solving: the Case of a Six-Atom Molecule

(1) ,
1
Bernard Mourrain

Abstract

A relatively new branch of computational biology and chemistry has been emerging as an effort to apply successful paradigms and algorithms from geometry and robot kinematics to predicting the structure of molecules, embedding them in Euclidean space, and finding the energetically favorable configurations. We illustrate several efficient algebraic algorithms for enumerating all possible conformations of a cyclic molecule and for studying its singular locus. Recent advances in computational algebra are exploited, including distance geometry, sparse polynomial theory based on Newton polytopes, and matrix methods for solving nonlinear multivariate polynomial systems. With respect to the latter, we compare sparse resultants, Bezoutians, and Sylvester resultants in cascade, in terms of performance and numerical stability.
Fichier principal
Vignette du fichier
RR-3075.pdf (416.68 Ko) Télécharger le fichier

Dates and versions

inria-00073617 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073617 , version 1

Cite

Ioannis Z. Emiris, Bernard Mourrain. Polynomial System Solving: the Case of a Six-Atom Molecule. RR-3075, INRIA. 1996. ⟨inria-00073617⟩
66 View
107 Download

Share

Gmail Facebook Twitter LinkedIn More