Euclidean Distance Geometry
Produktnummer:
18366ca41f4d6047459313ce12ff261563
| Autor: | Lavor, Carlile Liberti, Leo |
|---|---|
| Themengebiete: | Branch-and-Prune algorithm K-laterative graphs Mathematica complete graphs convex optimization discretizability graph visualization mathematical programming vertex orders weighted adjacency matrix |
| Veröffentlichungsdatum: | 17.05.2018 |
| EAN: | 9783319869346 |
| Sprache: | Englisch |
| Seitenzahl: | 133 |
| Produktart: | Kartoniert / Broschiert |
| Verlag: | Springer International Publishing |
| Untertitel: | An Introduction |
Produktinformationen "Euclidean Distance Geometry"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen