Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Mathematical Preliminaries Kapitel lesen Erstes Kapitel lesen

2018 | OriginalPaper | Buchkapitel

8. EDM Completions and Bar Frameworks

verfasst von : Abdo Y. Alfakih

Erschienen in: Euclidean Distance Matrices and Their Applications in Rigidity Theory

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This chapter has three parts. Part one addresses the problem of EDM completions. Part two is an introduction to the theory of bar-and-joint frameworks. Such frameworks, which are interesting in their own right, are particularly useful in the study of various uniqueness notions of EDM completions. In the third part, we discuss stress matrices, which play a pivotal role in the theory of bar-and-joint frameworks. The chapter concludes with the classic Maxwell–Cremona theorem. We begin first with EDM completions.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel The Entries of EDMs
Nächstes Kapitel Local and Infinitesimal Rigidities
Fußnoten
1
In this monograph we are only interested in bar-and joint frameworks.
 
2
This example was discussed in Schoenberg [171] from a Cayley–Menger determinant point of view.
 
Literatur
1.
2.
3.
A.Y. Alfakih, On the uniqueness of Euclidean distance matrix completions: the case of points in general position. Linear Algebra Appl. 397, 265–277 (2005)MathSciNetCrossRef
9.
A.Y. Alfakih, On the universal rigidity of generic bar frameworks. Contrib. Discret. Math. 5, 7–17 (2010)MathSciNetMATH
10.
A.Y. Alfakih, On bar frameworks, stress matrices and semidefinite programming. Math. Program. Ser. B 129, 113–128 (2011)MathSciNetCrossRef
16.
A.Y. Alfakih, Universal rigidity of bar frameworks via the geometry of spectrahedra. J. Glob. Optim. 67, 909–924 (2017)MathSciNetCrossRef
21.
A.Y. Alfakih, A. Khandani, H. Wolkowicz, Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12, 13–30 (1999)MathSciNetCrossRef
23.
S. AlHomidan, Hybrid Methods for Optimization Problems with Positive Semidefinite Matrix Constraints. PhD thesis, University of Dundee, 1993
24.
S. AlHomidan, R. Fletcher, Hybrid methods for finding the nearest Euclidean distance matrix, in Recent Advances in Nonsmooth Optimization (World Scientific Publishing, River Edge, 1995), pp. 1–17CrossRef
25.
S. AlHomidan, H. Wolkowicz, Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming. Linear Algebra Appl. 406, 109–141 (2005)MathSciNetCrossRef
31.
M. Bakonyi, C.R. Johnson, The Euclidean distance matrix completion problem. SIAM J. Matrix Anal. Appl. 16, 646–654 (1995)MathSciNetCrossRef
43.
P. Biswas, Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization, in Proceedings 3rd IPSN, 2004, pp. 46–54
65.
H. Crapo, W. Whiteley, Plane self stresses and projected polyhedra I: the basic pattern. Struct. Topol. 20, 55–77 (1993)MATH
66.
G.M. Crippen, T.F. Havel, Distance Geometry and Molecular Conformation (Wiley, New York, 1988)MATH
71.
Y. Ding, N. Krislock, J. Qian, H. Wolkowicz, Sensor network localization, Euclidean distance matrix completions, and graph realization. Optim. Eng. 11, 45–66 (2010)MathSciNetCrossRef
77.
H. Fang, D.P. O’leary, Euclidean distance matrix completion problems. Optim. Methods Softw. 27, 695–717 (2012)MathSciNetCrossRef
85.
M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York, 1979)MATH
98.
R. Grone, C.R. Johnson, E.M. Sá, H. Wolkowicz, Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109–124 (1984)MathSciNetCrossRef
100.
T.F. Havel, I.D. Kuntz, G.M. Crippen, Theory and practice of distance geometry. Bull. Math. Biol. 45, 665–720 (1983)MathSciNetCrossRef
106.
B. Hendrickson, The molecule problem: exploiting the structure in global optimization. SIAM J. Optim. 5, 835–857 (1995)MathSciNetCrossRef
111.
122.
N. Krislock, H. Wolkowicz, Explicit sensor network localization using semidefinite representations and facial reductions. SIAM J. Optim. 20, 2679–2708 (2010)MathSciNetCrossRef
128.
M. Laurent, Cuts, matrix completion and graph rigidity. Math. Program. 79, 255–283 (1997)MathSciNetMATH
129.
M. Laurent, A connection between positive semidefinite and Euclidean distance matrix completion problems. Linear Algebra Appl. 273, 9–22 (1998)MathSciNetCrossRef
130.
M. Laurent, Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems. SIAM J. Matrix Anal. Appl. 22, 874–894 (2000)MathSciNetCrossRef
134.
C.-K. Li, T. Milligan, Uniqueness of the solutions of some completion problems. Technical report, Dept. of Mathematics, The College of William and Mary, 2003
135.
L. Liberti, C. Lavor, Euclidean Distance Geometry, An Introduction (Springer, Cham, 2017)CrossRef
141.
J.C. Maxwell, On reciprocal figures and diagrams of forces. Philos. Mag. 4, 250–261 (1864)CrossRef
142.
J.C. Maxwell, On reciprocal figures, frameworks and diagrams of forces. Trans. R. Soc. Edinb. 26, 1–40 (1870)CrossRef
147.
148.
J.J. Moré, Z. Wu, Distance geometry optimization for protein structures. J. Glob. Optim. 15, 219–234 (1999)MathSciNetCrossRef
159.
J. Richter-Gebert, Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol. 1643 (Springer, Berlin, 1996)CrossRef
164.
J.B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard. Proceedings of the 17th Allerton Conference in Communications, Control, and Computing, 1979, pp. 480–489
171.
I.J. Schoenberg, Linkages and distance geometry. Nedrel. Akad. Wetensch. proc. Ser A. 72, Indag. Math. 31, 43–52 (1969)MathSciNetCrossRef
176.
M. Sitharam, H. Gao, Characterizing graphs with convex and connected Cayley configuration spaces. Discret. Comput. Geom. 43, 594–625 (2010)MathSciNetCrossRef
178.
A.M.-C. So, Y. Ye, Semidefinite programming approach to tensegrity theory and realizability of graphs, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), 2006, pp. 766–775
179.
A.M.-C. So, Y. Ye, Theory of semidefinite programming for sensor network localization. Math. Prog. Ser. B 109, 367–384 (2007)MathSciNetCrossRef
190.
192.
H.S. White, Cremona’s work. Bull. Am. Math. Soc. 24, 238–243 (1918)CrossRef
193.
W. Whiteley, Motions and stresses of projected polyhedra. Struct. Topol. 7, 13–38 (1982)MathSciNetMATH
198.
H. Wolkowicz, R. Saigal, L. Vandenberghe (eds.), Handbook of Semidefinite Programming. Theory, Algorithms and Applications (Kluwer Academic Publishers, Boston, 2000)MATH
199.
Y. Yemini, Some theoretical aspects of location-location problems, in Proceedings of the IEEE Symposium on Foundations of Computer Science, 1979, pp. 1–8
Metadaten
Titel
EDM Completions and Bar Frameworks
verfasst von
Abdo Y. Alfakih
Copyright-Jahr
2018
Buch
Euclidean Distance Matrices and Their Applications in Rigidity Theory

Print ISBN: 978-3-319-97845-1

Electronic ISBN: 978-3-319-97846-8

Copyright-Jahr: 2018

DOI
https://doi.org/10.1007/978-3-319-97846-8_8