Differential Geometry and Lie Groups : A Computational Perspective / Jean Gallier, Jocelyn Quaintance |
Autore | Gallier, Jean |
Pubbl/distr/stampa | Cham, : Springer, 2020 |
Descrizione fisica | xv, 777 p. : ill. ; 24 cm |
Altri autori (Persone) | Quaintance, Jocelyn |
Soggetto topico |
53-XX - Differential geometry [MSC 2020]
22-XX - Topological groups, Lie groups [MSC 2020] |
Soggetto non controllato |
Adjoint representation
Connections on real manifolds Differential geometry Grassmannian manifold Homogeneous spaces Lie Brackets Lie algebras for computing Linear lie groups Lorentz groups Matrix Lie groups Matrix exponential Riemannian manifold Riemannian manifold curvature Stiefel manifold Theory of manifold optimization techniques |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN0249001 |
Gallier, Jean | ||
Cham, : Springer, 2020 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Differential Geometry and Lie Groups : A Computational Perspective / Jean Gallier, Jocelyn Quaintance |
Autore | Gallier, Jean |
Pubbl/distr/stampa | Cham, : Springer, 2020 |
Descrizione fisica | xv, 777 p. : ill. ; 24 cm |
Altri autori (Persone) | Quaintance, Jocelyn |
Soggetto topico |
22-XX - Topological groups, Lie groups [MSC 2020]
53-XX - Differential geometry [MSC 2020] |
Soggetto non controllato |
Adjoint representation
Connections on real manifolds Differential geometry Grassmannian manifold Homogeneous spaces Lie Brackets Lie algebras for computing Linear lie groups Lorentz groups Matrix Lie groups Matrix exponential Riemannian manifold Riemannian manifold curvature Stiefel manifold Theory of manifold optimization techniques |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Titolo uniforme | |
Record Nr. | UNICAMPANIA-VAN00249001 |
Gallier, Jean | ||
Cham, : Springer, 2020 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
Autore | Mesbahi Mehran |
Edizione | [STU student edition] |
Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
Descrizione fisica | 1 online resource (424 pages) |
Disciplina | 006.3 |
Collana | Princeton series in applied mathematics |
Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
Record Nr. | UNINA-9910785659103321 |
Mesbahi Mehran | ||
Princeton : , : Princeton University Press, , [2010] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
Autore | Mesbahi Mehran |
Edizione | [STU student edition] |
Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
Descrizione fisica | 1 online resource (424 pages) |
Disciplina | 006.3 |
Collana | Princeton series in applied mathematics |
Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
Record Nr. | UNINA-9910816716403321 |
Mesbahi Mehran | ||
Princeton : , : Princeton University Press, , [2010] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|