https://hal.inria.fr/inria-00073617Emiris, Ioannis Z.Ioannis Z.EmirisSAFIR - Algebraic Formal Systems for Industry and Research - CRISAM - Inria Sophia Antipolis - MÃ©diterranÃ©e - Inria - Institut National de Recherche en Informatique et en AutomatiqueMourrain, BernardBernardMourrainPolynomial System Solving: the Case of a Six-Atom MoleculeHAL CCSD1996POLYNOMIAL EQUATIONSPARSE RESULTANTBEZOUTIANSYLVESTER RESULTANTEIGENVALUESINGULAR VALUESINGULAR LOCUSGEOMETRY OF LINESCYLCLOHEXANECOMPUTATIONAL BIOLOGY AND CHEMISTRY[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]Inria, Rapport De Recherche2006-05-24 13:20:322023-03-15 08:58:092006-05-31 14:24:28enReportsapplication/pdf1A 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.