Euclidean Distance Geometry - Carlile Lavor

. .

Résumé :
This textbook, the first of its kind, presents the fundamentals of distance geometry: theory, useful methodologies for obtaining solutions, and real world applications. Concise proofs are given and step-by-step algorithms for solving fundamental problems efficiently and precisely are presented in Mathematica?, enabling the reader to experiment with concepts and methods as they are introduced. Descriptive graphics, examples, and problems, accompany the real gems of the text, namely the applications in visualization of graphs, localization of sensor networks, protein conformation from distance data, clock synchronization protocols, robotics, and control of unmanned underwater vehicles, to name several. Aimed at intermediate undergraduates, beginning graduate students, researchers, and practitioners, the reader with a basic knowledge of linear algebra will gain an understanding of the basic theories of distance geometry and why they work inreal life....

Biographie:
Leo Liberti is a research director at CNRS and a professor at Ecole Polytechnique, France. Professor Liberti's mathematical and optimization-related research interests are broad and his publications are extensive. In addition to co-authorship of this present textbook, he has co-edited two volumes with Springer: Distance Geometry, (c) 2013, 978-1-4614-5127-3 and Global Optimization: From Theory to Implementation, (c) 2008, 978-0-387-28260-2. Carlile Lavor is a Full Professor at the Department of Applied Mathematics, University of Campinas, Campinas, Brazil. His main research interests are related to theory and applications of distance geometry and geometric algebra. In addition to co-authorship of this present textbook, he is co-author of the SpringerBrief Introduction to Distance Geometry Applied to Molecular Geometry, (c) 2017, 978-3-319-57182-9, and co-editor of Distance Geometry, (c) 2013, 978-1-4614-5127-3....

Sommaire:
Introduction.- 1. Motivation.- 2. The Distance Geometry Problem.- 3. Realizing Complete Graphs.- 4. Discretizability.- 5. Molecular Distance Geometry Problems.- 6.Vertex Orders.- 7. Flexibility and Rigidity.- 8. Approximate Realizations.- 9. Taking DG Further.- Appendix A. Mathematical Notions.