1 option
Euclidean Distance Geometry : An Introduction / by Leo Liberti, Carlile Lavor.
Springer Nature - Springer Mathematics and Statistics eBooks 2017 English International Available online
View online- Format:
- Book
- Author/Creator:
- Liberti, Leo., Author.
- Lavor, Carlile., Author.
- Series:
- Springer Undergraduate Texts in Mathematics and Technology, 1867-5506
- Language:
- English
- Subjects (All):
- Convex geometry.
- Discrete geometry.
- Mathematical optimization.
- Computer science—Mathematics.
- Algorithms.
- Discrete mathematics.
- Convex and Discrete Geometry.
- Discrete Optimization.
- Discrete Mathematics in Computer Science.
- Discrete Mathematics.
- Local Subjects:
- Convex and Discrete Geometry.
- Discrete Optimization.
- Discrete Mathematics in Computer Science.
- Algorithms.
- Discrete Mathematics.
- Physical Description:
- 1 online resource (XIII, 133 p. 60 illus., 31 illus. in color.)
- Edition:
- 1st ed. 2017.
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2017.
- Summary:
- 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 in real life.
- Contents:
- 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.
- ISBN:
- 3-319-60792-8
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.