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

Ioannis Z. Emiris 1 Bernard Mourrain
1 SAFIR - Algebraic Formal Systems for Industry and Research
CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Type de document :
RR-3075, INRIA. 1996
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:20:32
Dernière modification le : mercredi 17 octobre 2018 - 17:02:07
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:10:31



  • HAL Id : inria-00073617, version 1



Ioannis Z. Emiris, Bernard Mourrain. Polynomial System Solving: the Case of a Six-Atom Molecule. RR-3075, INRIA. 1996. 〈inria-00073617〉



Consultations de la notice


Téléchargements de fichiers