the reduction to hamiltonian schur form explained
play

The Reduction to Hamiltonian Schur Form Explained David S. Watkins - PowerPoint PPT Presentation

Nov 02, 2022 •217 likes •1.27k views

The Reduction to Hamiltonian Schur Form Explained David S. Watkins watkins@math.wsu.edu Department of Mathematics Washington State University July 2006 p.1 Linear-Quadratic Gaussian Problem July 2006 p.2 Linear-Quadratic Gaussian

  1. Construction of Q T   ∗ ⇒ ∗       ∗ ⇒     0     ⇒ ∗     ⇒ ∗ July 2006 – p.10

  2. Construction of Q T   ∗ ⇒ ∗       ∗ ⇒     0     ⇒  0    ⇒ ∗ July 2006 – p.10

  3. Construction of Q T   ∗ ∗       ∗ ⇒     0      0    ⇒ ∗ July 2006 – p.10

  4. Construction of Q T   ∗ ∗       ∗ ⇒     0      0    ⇒ 0 July 2006 – p.10

  5. Construction of Q T   ∗ ⇒ ∗       ∗ ⇒     0     ⇒  0    ⇒ 0 July 2006 – p.10

  6. Construction of Q T   ∗ ⇒ ∗       ⇒ 0     0     ⇒  0    ⇒ 0 July 2006 – p.10

  7. Construction of Q T   ⇒ ∗ ⇒ ∗       0     ⇒ 0     ⇒  0    0 July 2006 – p.10

  8. Construction of Q T   ⇒ ∗ ⇒ 0       0     ⇒ 0     ⇒  0    0 July 2006 – p.10

  9. Construction of Q T   ⇒ ∗ ⇒ 0       0     ⇒ 0     ⇒  0    0 Done! July 2006 – p.10

  10. Why it Works July 2006 – p.11

  11. Why it Works H 2 stays in skew-Hamiltonian Schur form . . . July 2006 – p.11

  12. Why it Works H 2 stays in skew-Hamiltonian Schur form . . . . . . every step of the way. July 2006 – p.11

  13. Why it Works H 2 stays in skew-Hamiltonian Schur form . . . . . . every step of the way. H x = λ 1 x July 2006 – p.11

  14. Why it Works H 2 stays in skew-Hamiltonian Schur form . . . . . . every step of the way. H x = λ 1 x H 2 x = λ 2 1 x July 2006 – p.11

  15. Why it Works H 2 stays in skew-Hamiltonian Schur form . . . . . . every step of the way. H x = λ 1 x H 2 x = λ 2 1 x relationships preserved throughout the transformation July 2006 – p.11

  16. Close up July 2006 – p.12

  17. Close up H 2 x = xλ 2 1 July 2006 – p.12

  18. Close up H 2 x = xλ 2 1       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 1 λ 2 ∗ ∗ ∗ ∗ ∗ 0       2       λ 2       ∗ ∗ ∗ ∗ 0 λ 2  3      =       1 λ 2 ∗ ∗       1       λ 2 ∗ ∗ ∗       2       λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.12

  19. Close up H 2 x = xλ 2 1       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 1 λ 2 ∗ ∗ ∗ ∗ ∗ 0       2       λ 2       ∗ ∗ ∗ ∗ 0 λ 2  3      =       1 λ 2 ∗ ∗       1       λ 2 ∗ ∗ ∗       2       λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.12

  20.       λ 2 ∗ ∗ 1  λ 2 λ 2 ∗ ∗ ∗  =       1 2     λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.13

  21.       λ 2 ⇒ ∗ ∗ 1  λ 2 λ 2 ⇒ ∗ ∗ ∗  =       1 2     λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.13

  22.       ⇒ ∗ ∗ 0 0  λ 2 ⇒ ∗ ∗ ∗ ∗  =       1     λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.13

  23.       ⇒ ∗ 0 0 0  λ 2 ⇒ ∗ ∗ ∗ ∗  =       1     λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.13

  24.       ⇒ ∗ 0 0 0  λ 2 λ 2 ⇒ ∗ ∗ ∗  =       1 1     λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.13

  25.       λ 2 ⇒ 0 0 0 2  λ 2 λ 2 ⇒ ∗ ∗ ∗  =       1 1     λ 2 ∗ ∗ ∗ ∗ 3 July 2006 – p.13

  26.       λ 2 0 0 2  λ 2 λ 2 ⇒ ∗ ∗ ∗  =       1 1     λ 2 ⇒ ∗ ∗ ∗ ∗ 3 July 2006 – p.13

  27.       λ 2 0 0 2  λ 2 ⇒ ∗ ∗ ∗  = 0 0       1     ⇒ ∗ ∗ ∗ ∗ ∗ July 2006 – p.13

  28.       λ 2 0 0 2  λ 2 ⇒ ∗ ∗  = 0 0 0       1     ⇒ ∗ ∗ ∗ ∗ ∗ July 2006 – p.13

  29.       λ 2 0 0 2  λ 2 ⇒ ∗ ∗  = 0 0 0       1     λ 2 ⇒ ∗ ∗ ∗ ∗ 1 July 2006 – p.13

  30.       λ 2 0 0 2  λ 2 λ 2 ⇒ ∗  = 0 0 0       1 3     λ 2 ⇒ ∗ ∗ ∗ ∗ 1 July 2006 – p.13

  31.       λ 2 0 0 2  λ 2 λ 2 ∗  = 0 0       1 3     λ 2 ∗ ∗ ∗ ∗ 1 July 2006 – p.13

  32.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ∗ ∗ ∗ ∗ ∗ 0       3       λ 2       ∗ ∗ ∗ ∗ 0 1 λ 2       =       1 λ 2 0 0       2       λ 2 ∗    0   0  3       λ 2 ∗ ∗ ∗ ∗ 1 July 2006 – p.14

  33.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ∗ ∗ ∗ ∗ ∗ 0       3       λ 2       ⇒ ∗ ∗ ∗ ∗ 0 1 λ 2       =       1 λ 2 0 0       2       λ 2 ∗    0   0  3       λ 2 ⇒ ∗ ∗ ∗ ∗ 1 July 2006 – p.14

  34.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ∗ ∗ ∗ ∗ ∗ 0       3       λ 2       ⇒ ∗ ∗ ∗ ∗ 0 1 λ 2       =       1 λ 2 0 0       2       λ 2 ∗    0   0  3       λ 2 ⇒ ∗ ∗ ∗ ∗ 0 1 July 2006 – p.14

  35.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ∗ ∗ ∗ ∗ ∗ 0       3       λ 2       ⇒ ∗ ∗ ∗ ∗ 0 1 λ 2       =       1 λ 2 0 0       2       λ 2 ∗    0   0  3       λ 2 ⇒ ∗ ∗ 0 0 0 1 July 2006 – p.14

  36.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ 0       3       λ 2       ⇒ ∗ ∗ ∗ ∗ 0 1 λ 2       =       1 λ 2 0 0       2       λ 2 ⇒ ∗    0   0  3       λ 2 ⇒ ∗ ∗ 0 0 1 July 2006 – p.14

  37.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ 0       3       λ 2       ⇒ ∗ ∗ ∗ ∗ ∗ 0 1 λ 2       =       1 λ 2 0 0       2       λ 2 ⇒ ∗ ∗    0   0  3       λ 2 ⇒ ∗ ∗ 0 0 1 July 2006 – p.14

  38.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ 0       1       λ 2       ⇒ ∗ ∗ 0 0 0 3 λ 2       =       1 λ 2 0 0       2       λ 2 ⇒ ∗    0   0  1       λ 2 ⇒ ∗ ∗ 0 0 3 July 2006 – p.14

  39.       λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ 0       1       λ 2       ∗ ∗ 0 0 0 3 λ 2       =       1 λ 2 ⇒ 0 0       2       λ 2 ⇒ ∗    0   0  1       λ 2 ∗ ∗ 0 0 3 July 2006 – p.14

  40.       λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ ∗ 0 2 λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ ∗ 0       1       λ 2       ∗ ∗ 0 0 0 3 λ 2       =       1 λ 2 ⇒ ∗ 0 0       2       λ 2 ⇒ ∗    0   0  1       λ 2 ∗ ∗ 0 0 3 July 2006 – p.14

  41.       λ 2 ⇒ ∗ ∗ ∗ ∗ ∗ ∗ 0 1 λ 2 ⇒ ∗ ∗ ∗ 0 0 0       2       λ 2       ∗ ∗ 0 0 0 3 λ 2       =       1 λ 2 ⇒ 0 0       1       λ 2 ⇒ ∗    0   0  2       λ 2 ∗ ∗ 0 0 3 July 2006 – p.14

  42.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 1 λ 2 ∗ ∗ ∗ 0 0 0       2       λ 2       ∗ ∗ 0 0 0 3 λ 2       =       1 λ 2 0 0       1       λ 2 ∗    0   0  2       λ 2 ∗ ∗ 0 0 3 July 2006 – p.14

  43.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 1 λ 2 ∗ ∗ ∗ 0 0 0       2       λ 2       ∗ ∗ 0 0 0 3 λ 2       =       1 λ 2 0 0       1       λ 2 ∗    0   0  2       λ 2 ∗ ∗ 0 0 3 It looks like we’re back where we started, July 2006 – p.15

  44.       λ 2 ∗ ∗ ∗ ∗ ∗ ∗ 0 1 λ 2 ∗ ∗ ∗ 0 0 0       2       λ 2       ∗ ∗ 0 0 0 3 λ 2       =       1 λ 2 0 0       1       λ 2 ∗    0   0  2       λ 2 ∗ ∗ 0 0 3 It looks like we’re back where we started, but . . . July 2006 – p.15

  45.   ∗ ∗ ∗ ∗ ∗ λ 1 ∗ ∗ ∗ ∗ ∗       ∗ ∗ ∗ ∗ ∗   H =   − λ 1     ∗ ∗ ∗ ∗ ∗     ∗ ∗ ∗ ∗ ∗ July 2006 – p.16

  46.   ∗ ∗ ∗ ∗ ∗ λ 1 ∗ ∗ ∗ ∗ ∗       ∗ ∗ ∗ ∗ ∗   H =   − λ 1     ∗ ∗ ∗ ∗ ∗     ∗ ∗ ∗ ∗ ∗ Now we can deflate. July 2006 – p.16

  47. In Conclusion July 2006 – p.17

  48. In Conclusion By keeping H 2 in skew-Hamiltonian Schur form July 2006 – p.17

  49. In Conclusion By keeping H 2 in skew-Hamiltonian Schur form every step of the way July 2006 – p.17

Recommend

Ruijsenaars-Schneider system from reduction Quasi- quasi-Hamiltonian reduction Hamiltonian

Ruijsenaars-Schneider system from reduction Quasi- quasi-Hamiltonian reduction Hamiltonian

Marsden- Weinstein Ruijsenaars-Schneider system from reduction Quasi- quasi-Hamiltonian reduction Hamiltonian reduction Classification of compact integrable Timo Kluck systems Larger coupling Mathematisch Instituut, Universiteit

660 views • 62 slides
A KRYLOV-SCHUR-TYPE ALGORITHM FOR EIGENPROBLEMS WITH HAMILTONIAN SPECTRAL SYMMETRY Peter Benner

A KRYLOV-SCHUR-TYPE ALGORITHM FOR EIGENPROBLEMS WITH HAMILTONIAN SPECTRAL SYMMETRY Peter Benner

A KRYLOV-SCHUR-TYPE ALGORITHM FOR EIGENPROBLEMS WITH HAMILTONIAN SPECTRAL SYMMETRY Peter Benner Professur Mathematik in Industrie und Technik Fakult at f ur Mathematik Technische Universit at Chemnitz RANMEP2008 National Tsinghua

1.19k views • 79 slides
Model reduction for port-Hamiltonian differential-algebraic systems Volker Mehrmann Institut

Model reduction for port-Hamiltonian differential-algebraic systems Volker Mehrmann Institut

Model reduction for port-Hamiltonian differential-algebraic systems Volker Mehrmann Institut fr Mathematik Technische Universitt Berlin Research Center M ATHEON Mathematics for key technologies ICERM 20.02.2020 Theses Key

981 views • 69 slides
Complex dynamics in normal form Hamiltonian systems Hiromitsu Harada , 1 Akira Shudo , 1 Amaury

Complex dynamics in normal form Hamiltonian systems Hiromitsu Harada , 1 Akira Shudo , 1 Amaury

1 Quantum chaos: fundamentals and applications 17th March. 2015 Complex dynamics in normal form Hamiltonian systems Hiromitsu Harada , 1 Akira Shudo , 1 Amaury Mouchet , 2 and J emy Le Deun ff 3 er 1 Department of Physics , Tokyo

479 views • 20 slides
Hamiltonian Systems Hamiltonian Systems H ( p 1 , . . . p N , q 1 , . . . q N ) q i = H p i =

Hamiltonian Systems Hamiltonian Systems H ( p 1 , . . . p N , q 1 , . . . q N ) q i = H p i =

Laurette TUCKERMAN laurette@pmmh.espci.fr Hamiltonian Systems Hamiltonian Systems H ( p 1 , . . . p N , q 1 , . . . q N ) q i = H p i = H p i q i q i : positions p i : momenta convention for number of degrees of freedom:

594 views • 44 slides
Hamiltonian engineering for many-body quantum systems by Shortcuts To Adiabaticity Kazutaka

Hamiltonian engineering for many-body quantum systems by Shortcuts To Adiabaticity Kazutaka

Hamiltonian engineering for many-body quantum systems by Shortcuts To Adiabaticity Kazutaka Takahashi Tokyo Tech Trieste, August 23, 2016 01/23 Motivation: QA Target Hamiltonian Best driver Hamiltonian? Best schedule? Hamiltonian

461 views • 23 slides
Around the Plancherel measure on integer partitions (an introduction to Schur processes without

Around the Plancherel measure on integer partitions (an introduction to Schur processes without

Around the Plancherel measure on integer partitions (an introduction to Schur processes without Schur functions) J er emie Bouttier A subject which I learned with Dan Betea, C edric Boutillier, Guillaume Chapuy, Sylvie Corteel, Sanjay

698 views • 30 slides
A Rule of Three for Schur Q-functions Ewin Tang August 2, 2017 Outline Rule of Three Schur

A Rule of Three for Schur Q-functions Ewin Tang August 2, 2017 Outline Rule of Three Schur

A Rule of Three for Schur Q-functions Ewin Tang August 2, 2017 Outline Rule of Three Schur Q-functions Results and Approach Notation e k s are elementary symmetric polynomials: e k ( x 1 , , x n ) = x j k x j 1 1 j

454 views • 27 slides
Intermolecular Forces, Then we explained how atoms combine to form molecules: the most common way

Intermolecular Forces, Then we explained how atoms combine to form molecules: the most common way

Slide 1 / 92 Slide 2 / 92 Intermolecular Forces Intermolecular forces are the piece we need to add to the puzzle to explain the world around us. We first explained atoms, and how to build up the periodic table from quantum numbers.

485 views • 16 slides
Algebraic Fourier bases and probability Alexei Borodin Rational Schur symmetric functions Two

Algebraic Fourier bases and probability Alexei Borodin Rational Schur symmetric functions Two

Algebraic Fourier bases and probability Alexei Borodin Rational Schur symmetric functions Two orthogonality relations : The Schur functions are characters of the (complex) irreducible representations of (or ). Rational Schur

588 views • 24 slides
Block numbers, 321-avoidance and Schur-positivity Eli Bagno (Jerusalem College of Technology)

Block numbers, 321-avoidance and Schur-positivity Eli Bagno (Jerusalem College of Technology)

Introduction Equi-distribution Symmetry and Schur-positivity Proof idea Open problems Block numbers, 321-avoidance and Schur-positivity Eli Bagno (Jerusalem College of Technology) joint work with Ron M. Adin and Yuval Roichman Permutation

665 views • 52 slides
Schur -groups Michael Bush Washington and Lee University August 5, 2013 Michael Bush Schur

Schur -groups Michael Bush Washington and Lee University August 5, 2013 Michael Bush Schur

Schur -groups Michael Bush Washington and Lee University August 5, 2013 Michael Bush Schur -groups August 5, 2013 1 / 16 Motivation Let K be a number field and let O K be the ring of integers of K . O K is sometimes a UFD (Unique

640 views • 16 slides
Equalizing what should be equal Solving the even eigenvalue problem by transforming an even

Equalizing what should be equal Solving the even eigenvalue problem by transforming an even

Equalizing what should be equal Solving the even eigenvalue problem by transforming an even URV form to even Schur form Christian Schr oder TU Berlin Research Center Matheon Conference on Computational Methods with Applications

491 views • 36 slides
What is an explanation? What happens when we explain ? What sort of facts need to be explained?

What is an explanation? What happens when we explain ? What sort of facts need to be explained?

What is an explanation? What happens when we explain ? What sort of facts need to be explained? What determines when a fact has been explained? Explananda as why - questions Explanandum explained by explanans . Explananda can be

1.65k views • 41 slides
Quantization of Poisson-Lie Hamiltonian systems Chiara Esposito Julius Maximilian University of

Quantization of Poisson-Lie Hamiltonian systems Chiara Esposito Julius Maximilian University of

Hamiltonian actions Quantization Quantization of Poisson-Lie Hamiltonian systems Chiara Esposito Julius Maximilian University of W urzburg August 22, 2014 1 / 15 Hamiltonian actions Quantization Outline Hamiltonian actions Hamiltonian

759 views • 21 slides
HERZ-SCHUR MULTIPLIERS IVAN G. TODOROV Contents 1. Introduction 1 2. Preliminaries 2 2.1.

HERZ-SCHUR MULTIPLIERS IVAN G. TODOROV Contents 1. Introduction 1 2. Preliminaries 2 2.1.

HERZ-SCHUR MULTIPLIERS IVAN G. TODOROV Contents 1. Introduction 1 2. Preliminaries 2 2.1. Operator spaces 2 2.2. Harmonic analysis 4 The spaces MA ( G ) and M cb A ( G ) 3. 8 3.1. The case of commutative groups 12 4. Schur

737 views • 54 slides
Cylindric Schur Functions R e t r o s p e c t i v e I n C o m b i n a t o

Cylindric Schur Functions R e t r o s p e c t i v e I n C o m b i n a t o

Cylindric Schur Functions R e t r o s p e c t i v e I n C o m b i n a t o r i c s : H o n o r i n g t h S T A N L E Y S 6 0 b i R t h - D a y 24 June 2004 Peter McNamara Slides and

648 views • 21 slides
Variational Hamiltonian Monte Carlo via Score Matching Cheng Zhang (Joint work with Prof. Shahbaba

Variational Hamiltonian Monte Carlo via Score Matching Cheng Zhang (Joint work with Prof. Shahbaba

Background Markov chain Monte Carlo Fixed-Form Variational Bayes Variational Hamiltonian Monte Carlo Conclusion Rfrences Variational Hamiltonian Monte Carlo via Score Matching Cheng Zhang (Joint work with Prof. Shahbaba and Prof. Zhao)

451 views • 44 slides
Isotropic Schur roots Charles Paquette University of Connecticut May 1 st , 2016 joint with

Isotropic Schur roots Charles Paquette University of Connecticut May 1 st , 2016 joint with

Isotropic Schur roots Charles Paquette University of Connecticut May 1 st , 2016 joint with Jerzy Weyman Auslander Conference 2016, Woods Hole, MA Outline Describe the perpendicular category of an isotropic Schur root. Describe the cone of

541 views • 22 slides
Formal proof of SCHUR conjugate function Toumazet Objectives and tools SCHUR Micaela Mayero 1

Formal proof of SCHUR conjugate function Toumazet Objectives and tools SCHUR Micaela Mayero 1

Formal Proof of conjugate function Butelle Hivert Mayero Formal proof of SCHUR conjugate function Toumazet Objectives and tools SCHUR Micaela Mayero 1 Frama-C Franck Butelle 1 Florent Hivert 2 Some combi- Frdric Toumazet 3 natorial

403 views • 28 slides
Hamiltonian Cycles Hamiltonian Cycles CSE, IIT KGP Hamiltonian Cycle Hamiltonian Cycle A A

Hamiltonian Cycles Hamiltonian Cycles CSE, IIT KGP Hamiltonian Cycle Hamiltonian Cycle A A

Hamiltonian Cycles Hamiltonian Cycles CSE, IIT KGP Hamiltonian Cycle Hamiltonian Cycle A A Hamiltonian cycle Hamiltonian cycle is a spanning cycle in a is a spanning cycle in a graph. graph. The c The c ircumference

276 views • 5 slides
Norms of idempotent Schur multipliers Rupert Levene University College Dublin Banach Algebras

Norms of idempotent Schur multipliers Rupert Levene University College Dublin Banach Algebras

Norms of idempotent Schur multipliers Rupert Levene University College Dublin Banach Algebras and Applications 29 July 2013 Rupert Levene (Dublin) Norms of idempotent Schur multipliers 1 / 14 Outline Schur multipliers 1 Some norm

328 views • 15 slides
Hamiltonian systems Marc R. Roussel October 31, 2019 Marc R. Roussel Hamiltonian systems

Hamiltonian systems Marc R. Roussel October 31, 2019 Marc R. Roussel Hamiltonian systems

Hamiltonian systems Marc R. Roussel October 31, 2019 Marc R. Roussel Hamiltonian systems October 31, 2019 1 / 11 Hamiltonian systems Suppose that we have a dynamical system whose equations of motion are related to a function H ( x , p ) by x

317 views • 11 slides
Uniquely Hamiltonian Graphs Benedikt Klocker Algorithms and Complexity Group Institute of

Uniquely Hamiltonian Graphs Benedikt Klocker Algorithms and Complexity Group Institute of

Uniquely Hamiltonian Graphs Benedikt Klocker Algorithms and Complexity Group Institute of Computer Graphics and Algorithms TU Wien Retreat Talk Basic Definitions Definition (Hamiltonian Graph) Let G be a (multi)graph. A hamiltonian cycle in G

156 views • 14 slides

More recommend