structure preserving krylov subspace methods for
play

Structure-preserving Krylov subspace methods for Hamiltonian and - PowerPoint PPT Presentation

Sep 24, 2022 •470 likes •1.83k views

Structure-preserving Krylov subspace methods for Hamiltonian and symplectic eigenvalue problems David S. Watkins watkins@math.wsu.edu Department of Mathematics Washington State University March 2007 p.1 Definitions March 2007 p.2

  1. Preservation of Structure � A = S − 1 AS March 2007 – p.9

  2. Preservation of Structure � A = S − 1 AS S symplectic structure preserved ⇒ March 2007 – p.9

  3. Preservation of Structure � A = S − 1 AS S symplectic structure preserved ⇒ Lanczos process is a partial similarity transformation. March 2007 – p.9

  4. Preservation of Structure � A = S − 1 AS S symplectic structure preserved ⇒ Lanczos process is a partial similarity transformation. Vectors produced are columns of transforming matrix. March 2007 – p.9

  5. Preservation of Structure � A = S − 1 AS S symplectic structure preserved ⇒ Lanczos process is a partial similarity transformation. Vectors produced are columns of transforming matrix. Need process that produces vectors that are columns of a symplectic matrix. March 2007 – p.9

  6. Preservation of Structure � A = S − 1 AS S symplectic structure preserved ⇒ Lanczos process is a partial similarity transformation. Vectors produced are columns of transforming matrix. Need process that produces vectors that are columns of a symplectic matrix. Isotropy! March 2007 – p.9

  7. Isotropy March 2007 – p.10

  8. Isotropy Def: U = R ( U ) is isotropic if x T Jy = 0 for all x , y ∈ U , i.e. March 2007 – p.10

  9. Isotropy Def: U = R ( U ) is isotropic if x T Jy = 0 for all x , y ∈ U , i.e. U T JU = 0 March 2007 – p.10

  10. Isotropy Def: U = R ( U ) is isotropic if x T Jy = 0 for all x , y ∈ U , i.e. U T JU = 0 Symplectic matrix S = [ U V ] satisfies S T JS = J , i.e. March 2007 – p.10

  11. Isotropy Def: U = R ( U ) is isotropic if x T Jy = 0 for all x , y ∈ U , i.e. U T JU = 0 Symplectic matrix S = [ U V ] satisfies S T JS = J , i.e. V T JV = 0 , U T JV = I. U T JU = 0 , March 2007 – p.10

  12. Isotropy Def: U = R ( U ) is isotropic if x T Jy = 0 for all x , y ∈ U , i.e. U T JU = 0 Symplectic matrix S = [ U V ] satisfies S T JS = J , i.e. V T JV = 0 , U T JV = I. U T JU = 0 , In particular, R ( U ) , R ( V ) are isotropic. March 2007 – p.10

  13. Theorem: If B is skew Hamiltonian, then every Krylov subspace � � x, Bx, B 2 x, . . . , B j − 1 x κ j ( B, x ) = span is isotropic. March 2007 – p.11

  14. Theorem: If B is skew Hamiltonian, then every Krylov subspace � � x, Bx, B 2 x, . . . , B j − 1 x κ j ( B, x ) = span is isotropic. Proof: Mehrmann / W (2001) March 2007 – p.11

  15. Theorem: If B is skew Hamiltonian, then every Krylov subspace � � x, Bx, B 2 x, . . . , B j − 1 x κ j ( B, x ) = span is isotropic. Proof: Mehrmann / W (2001) Corollary: Every Krylov subspace method automatically preserves skew-Hamiltonian structure. March 2007 – p.11

  16. Skew-Hamiltonian Lanczos Process March 2007 – p.12

  17. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j B T w j − w j d j a j − w j − 1 d j − 1 b j − 1 = w j +1 d j +1 b j March 2007 – p.12

  18. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j B T w j − w j d j a j − w j − 1 d j − 1 b j − 1 = w j +1 d j +1 b j U T W T U T j JU j = 0 , j JW j = 0 , j W j = I March 2007 – p.12

  19. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j B T w j − w j d j a j − w j − 1 d j − 1 b j − 1 = w j +1 d j +1 b j U T W T U T j JU j = 0 , j JW j = 0 , j W j = I Let v k = − Jw k (So W j = JV j ) March 2007 – p.12

  20. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j B T w j − w j d j a j − w j − 1 d j − 1 b j − 1 = w j +1 d j +1 b j U T W T U T j JU j = 0 , j JW j = 0 , j W j = I Let v k = − Jw k (So W j = JV j ) ( JB ) T = − JB − JB T = − BJ ⇒ March 2007 – p.12

  21. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j = Bv j − v j d j a j − v j − 1 d j − 1 b j − 1 v j +1 d j +1 b j March 2007 – p.13

  22. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j = Bv j − v j d j a j − v j − 1 d j − 1 b j − 1 v j +1 d j +1 b j Start with u T 1 Jv 1 = 1 . March 2007 – p.13

  23. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j = Bv j − v j d j a j − v j − 1 d j − 1 b j − 1 v j +1 d j +1 b j Start with u T 1 Jv 1 = 1 . U T V T U T j JU j = 0 , j JV j = 0 , j JV j = I March 2007 – p.13

  24. Skew-Hamiltonian Lanczos Process = Bu j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j = Bv j − v j d j a j − v j − 1 d j − 1 b j − 1 v j +1 d j +1 b j Start with u T 1 Jv 1 = 1 . U T V T U T j JU j = 0 , j JV j = 0 , j JV j = I These are the columns of a symplectic matrix. March 2007 – p.13

  25. Hamiltonian Lanczos Process March 2007 – p.14

  26. Hamiltonian Lanczos Process H 2 skew Hamiltonian. H Hamiltonian ⇒ March 2007 – p.14

  27. Hamiltonian Lanczos Process H 2 skew Hamiltonian. H Hamiltonian ⇒ Apply skew-Hamiltonian Lanczos process to H 2 . March 2007 – p.14

  28. Hamiltonian Lanczos Process H 2 skew Hamiltonian. H Hamiltonian ⇒ Apply skew-Hamiltonian Lanczos process to H 2 . H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j March 2007 – p.14

  29. Hamiltonian Lanczos Process H 2 skew Hamiltonian. H Hamiltonian ⇒ Apply skew-Hamiltonian Lanczos process to H 2 . H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Let v j = Hu j d j . ˜ March 2007 – p.14

  30. Hamiltonian Lanczos Process H 2 skew Hamiltonian. H Hamiltonian ⇒ Apply skew-Hamiltonian Lanczos process to H 2 . H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Let v j = Hu j d j . ˜ Multiply first equation by H and by d j . March 2007 – p.14

  31. Hamiltonian Lanczos Process H 2 skew Hamiltonian. H Hamiltonian ⇒ Apply skew-Hamiltonian Lanczos process to H 2 . H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Let v j = Hu j d j . ˜ Multiply first equation by H and by d j . v j +1 d j +1 b j = H 2 ˜ ˜ v j − ˜ v j d j a j − ˜ v j − 1 d j − 1 b j − 1 March 2007 – p.14

  32. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j March 2007 – p.15

  33. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Start the process with v 1 = ˜ v 1 = Hu 1 d 1 . March 2007 – p.15

  34. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Start the process with v 1 = ˜ v 1 = Hu 1 d 1 . Then v j = ˜ v j for all j . March 2007 – p.15

  35. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Start the process with v 1 = ˜ v 1 = Hu 1 d 1 . Then v j = ˜ v j for all j . Conclusion: March 2007 – p.15

  36. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Start the process with v 1 = ˜ v 1 = Hu 1 d 1 . Then v j = ˜ v j for all j . Conclusion: The second recurrence is redundant. March 2007 – p.15

  37. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Start the process with v 1 = ˜ v 1 = Hu 1 d 1 . Then v j = ˜ v j for all j . Conclusion: The second recurrence is redundant. Just run the first recurrence March 2007 – p.15

  38. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j H 2 v j − v j d j a j − v j − 1 d j − 1 b j − 1 = v j +1 d j +1 b j Start the process with v 1 = ˜ v 1 = Hu 1 d 1 . Then v j = ˜ v j for all j . Conclusion: The second recurrence is redundant. Just run the first recurrence together with the supplementary condition v j d j = Hu j . March 2007 – p.15

  39. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j = v j +1 d j +1 Hu j +1 March 2007 – p.16

  40. Hamiltonian Lanczos Process H 2 u j − u j a j d j − u j − 1 b j − 1 d j = u j +1 b j d j = v j +1 d j +1 Hu j +1 March 2007 – p.16

  41. Hamiltonian Lanczos Process = Hv j d j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j = v j +1 d j +1 Hu j +1 March 2007 – p.16

  42. Hamiltonian Lanczos Process = Hv j d j − u j a j d j − u j − 1 b j − 1 d j u j +1 b j d j = v j +1 d j +1 Hu j +1 March 2007 – p.16

  43. Hamiltonian Lanczos Process = Hv j − u j a j − u j − 1 b j − 1 u j +1 b j = v j +1 d j +1 Hu j +1 March 2007 – p.16

  44. Hamiltonian Lanczos Process = Hv j − u j a j − u j − 1 b j − 1 u j +1 b j = v j +1 d j +1 Hu j +1 u T Start with v 1 d 1 = Hu 1 1 Jv 1 = 1 . March 2007 – p.16

  45. Hamiltonian Lanczos Process = Hv j − u j a j − u j − 1 b j − 1 u j +1 b j = v j +1 d j +1 Hu j +1 u T Start with v 1 d 1 = Hu 1 1 Jv 1 = 1 . This is easy to arrange. March 2007 – p.16

  46. Recurrences written as matrix products u j +1 b j = Hv j − u j a j − u j − 1 b j − 1 v j +1 d j +1 = Hu j +1 March 2007 – p.17

  47. Recurrences written as matrix products u j +1 b j = Hv j − u j a j − u j − 1 b j − 1 v j +1 d j +1 = Hu j +1 HV j = U j T j + u j +1 b j e T HU j = V j D j j , March 2007 – p.17

  48. Recurrences written as matrix products u j +1 b j = Hv j − u j a j − u j − 1 b j − 1 v j +1 d j +1 = Hu j +1 � � � � � � T j + u j +1 b j e T = H 2 j . U j V j U j V j D j March 2007 – p.17

  49. Recurrences written as matrix products u j +1 b j = Hv j − u j a j − u j − 1 b j − 1 v j +1 d j +1 = Hu j +1 � � � � � � T j + u j +1 b j e T = H 2 j . U j V j U j V j D j Implicit restarts: March 2007 – p.17

  50. Recurrences written as matrix products u j +1 b j = Hv j − u j a j − u j − 1 b j − 1 v j +1 d j +1 = Hu j +1 � � � � � � T j + u j +1 b j e T = H 2 j . U j V j U j V j D j Implicit restarts: Filter with the HR algorithm. March 2007 – p.17

  51. Recurrences written as matrix products u j +1 b j = Hv j − u j a j − u j − 1 b j − 1 v j +1 d j +1 = Hu j +1 � � � � � � T j + u j +1 b j e T = H 2 j . U j V j U j V j D j Implicit restarts: Filter with the HR algorithm. Next up: symplectic Lanczos process. March 2007 – p.17

  52. Symplectic Lanczos Process March 2007 – p.18

  53. Symplectic Lanczos Process S + S − 1 skew Hamiltonian. S symplectic ⇒ March 2007 – p.18

  54. Symplectic Lanczos Process S + S − 1 skew Hamiltonian. S symplectic ⇒ Apply skew-Hamiltonian Lanczos process to S + S − 1 . March 2007 – p.18

Recommend

Iterative Krylov Subspace Methods for Sparse Reconstruction James Nagy Mathematics and Computer

Iterative Krylov Subspace Methods for Sparse Reconstruction James Nagy Mathematics and Computer

Iterative Krylov Subspace Methods for Sparse Reconstruction James Nagy Mathematics and Computer Science Emory University Atlanta, GA USA Joint work with Silvia Gazzola University of Padova, Italy Iterative Krylov Subspace Methods for Sparse

1.09k views • 63 slides
Lanczos method 1D tight-binding model O(N) Krylov subspace method Applications

Lanczos method 1D tight-binding model O(N) Krylov subspace method Applications

Large-scale electronic structure methods Introduction Lanczos method 1D tight-binding model O(N) Krylov subspace method Applications Outlook Taisuke Ozaki (ISSP, Univ. of Tokyo) The Summer School on DFT: Theories and

689 views • 55 slides
Analysis of Krylov subspace methods: Moments, error estimators, numerical stability and

Analysis of Krylov subspace methods: Moments, error estimators, numerical stability and

Analysis of Krylov subspace methods: Moments, error estimators, numerical stability and unexpected consequences Zden ek Strako Academy of Sciences and Charles University, Prague http://www.cs.cas.cz/strakos A joint work with Dianne P

840 views • 64 slides
Exponential Integrators using Matrix Functions: Krylov Subspace Methods and Chebyshev Expansion

Exponential Integrators using Matrix Functions: Krylov Subspace Methods and Chebyshev Expansion

Exponential Integrators using Matrix Functions: Krylov Subspace Methods and Chebyshev Expansion approximations The HPC Approach Mxico, February 2018 Marlon Brenes brenesnm@tcd.ie

533 views • 30 slides
Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems

Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems

Existing Methods Inverse-free Preconditioned Krylov Subspace Method Block Generalization Blackbox Implementation Numerical Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems Qiang Ye University

743 views • 73 slides
Krylov Subspace Methods for an Initial Value Problem Arising in TEM Martin Afanasjew 1 Ralph-Uwe

Krylov Subspace Methods for an Initial Value Problem Arising in TEM Martin Afanasjew 1 Ralph-Uwe

Krylov Subspace Methods for an Initial Value Problem Arising in TEM Martin Afanasjew 1 Ralph-Uwe Brner 2 Oliver G. Ernst 1 Michael Eiermann 1 Stefan Gttel 1 Klaus Spitzer 2 1 Institut fr Numerische Mathematik und Optimierung 2 Institut fr

408 views • 30 slides
Moments, Krylov subspace methods and model reduction Zden ek Strako Academy of Sciences and

Moments, Krylov subspace methods and model reduction Zden ek Strako Academy of Sciences and

Moments, Krylov subspace methods and model reduction Zden ek Strako Academy of Sciences and Charles University, Prague http://www.cs.cas.cz/strakos 8th GAMM ALA Workshop, TU Hamburg-Harburg, September 2008. Thanks to the collaborators

696 views • 43 slides
Iterative methods Krylov subspace methods for symmetric eigenvalue problems Jacobi-Davidson

Iterative methods Krylov subspace methods for symmetric eigenvalue problems Jacobi-Davidson

CES 703/6 Imre P olik Outline Power method Iterative methods Krylov subspace methods for symmetric eigenvalue problems Jacobi-Davidson method Literature Imre P olik, PhD McMaster University School of Computational Engineering and

546 views • 12 slides
Krylov subspace methods and exascale computations: good match or lost case? Zden ek Strako

Krylov subspace methods and exascale computations: good match or lost case? Zden ek Strako

Krylov subspace methods and exascale computations: good match or lost case? Zden ek Strako Charles University in Prague and Czech Academy of Sciences http://www.karlin.mff.cuni.cz/strakos SPPEXA Symposium, Mnich, January 2016

630 views • 28 slides
Modern Krylov subspace methods (and applications to parabolic control problems) Daniel B. Szyld

Modern Krylov subspace methods (and applications to parabolic control problems) Daniel B. Szyld

Modern Krylov subspace methods (and applications to parabolic control problems) Daniel B. Szyld Temple University, Philadelphia Scientific and Statistical Computing Seminar University of Chicago 25 October 2012 1

688 views • 47 slides
Communication-avoiding Krylov subspace methods Mark Hoemmen mhoemmen@cs.berkeley.edu University

Communication-avoiding Krylov subspace methods Mark Hoemmen mhoemmen@cs.berkeley.edu University

Motivation Break the dependency Previous work Preconditioning Future work Summary Communication-avoiding Krylov subspace methods Mark Hoemmen mhoemmen@cs.berkeley.edu University of California Berkeley EECS SIAM Parallel Processing for

661 views • 52 slides
Stability of Krylov Subspace Spectral Methods James V. Lambers Department of Energy Resources

Stability of Krylov Subspace Spectral Methods James V. Lambers Department of Energy Resources

Stability of Krylov Subspace Spectral Methods James V. Lambers Department of Energy Resources Engineering Stanford University includes joint work with Patrick Guidotti and Knut Slna, UC Irvine Margot Gerritsen, Stanford University

577 views • 30 slides
Krylov subspace methods for eigenvalue problems David S. Watkins watkins@math.wsu.edu

Krylov subspace methods for eigenvalue problems David S. Watkins watkins@math.wsu.edu

Krylov subspace methods for eigenvalue problems David S. Watkins watkins@math.wsu.edu Department of Mathematics Washington State University October 16, 2008 p. Problem: Linear Elasticity October 16, 2008 p. Problem: Linear

1.79k views • 161 slides
Krylov subspace methods for Perron-Frobenius operators in RKHS Yuka Hashimoto Takashi Nodera

Krylov subspace methods for Perron-Frobenius operators in RKHS Yuka Hashimoto Takashi Nodera

Krylov subspace methods for Perron-Frobenius operators in RKHS Yuka Hashimoto Takashi Nodera NTT Network Technology Laboratories / Graduate School of Science and Technology, Keio University Faculty of Science and Technology, Keio

543 views • 33 slides
Structure-preserving numerical methods in relativity Douglas N. Arnold, University of Minnesota

Structure-preserving numerical methods in relativity Douglas N. Arnold, University of Minnesota

Structure-preserving numerical methods in relativity Douglas N. Arnold, University of Minnesota Advances and Challenges in Computational Relativity September 14, 2020 ICERM Structure-preserving discretization Structure-preserving

502 views • 49 slides
Whats so great about Krylov subspaces? David S. Watkins Department of Mathematics Washington

Whats so great about Krylov subspaces? David S. Watkins Department of Mathematics Washington

Krylov subspaces David S. Watkins Whats so great about Krylov subspaces? David S. Watkins Department of Mathematics Washington State University Guwahati, 2013 Krylov Subspace Methods are Great Krylov subspaces David S. Watkins

1.42k views • 119 slides
On optimal short recurrences for generating orthogonal Krylov subspace bases J org Liesen

On optimal short recurrences for generating orthogonal Krylov subspace bases J org Liesen

On optimal short recurrences for generating orthogonal Krylov subspace bases J org Liesen based on joint work with Zden ek Strako s and Petr Tich y (Czech Academy of Sciences), Vance Faber (BD Biosciences, Seattle), Beresford

1.02k views • 34 slides
iOptimizing Krylov Subspace Solvers on iiGraphics Processing Units Hartwig Anzt, W. Sawyer, S.

iOptimizing Krylov Subspace Solvers on iiGraphics Processing Units Hartwig Anzt, W. Sawyer, S.

iOptimizing Krylov Subspace Solvers on iiGraphics Processing Units Hartwig Anzt, W. Sawyer, S. Tomov, P . Luszczek, I. Yamazaki, J. Dongarra May 19, 2014 Innovative and Computing Laboratory ICL http://icl.cs.utk.edu/ University of

614 views • 18 slides
On short recurrences for generating orthogonal Krylov subspace bases Petr Tich joint work

On short recurrences for generating orthogonal Krylov subspace bases Petr Tich joint work

On short recurrences for generating orthogonal Krylov subspace bases Petr Tich joint work with Vance Faber, Jrg Liesen, Zdenk Strako Institute of Computer Science AS CR March 19, 2009, Podbansk, Slovakia Algoritmy 2009 1 Outline

1.1k views • 73 slides
Multilevel Krylov Methods Deflation Deflation, DD, MG Reinhard Nabben Multilevel Krylov

Multilevel Krylov Methods Deflation Deflation, DD, MG Reinhard Nabben Multilevel Krylov

Multilevel Krylov Methods Reinhard Nabben Yogi A. Erlangga Multilevel Krylov Methods Deflation Deflation, DD, MG Reinhard Nabben Multilevel Krylov methods Numerical Yogi A. Erlangga examples MK methods for Helmholtz equation AMK

462 views • 32 slides
The use of stopping criteria for iterative Krylov methods in designing adaptive methods for PDEs

The use of stopping criteria for iterative Krylov methods in designing adaptive methods for PDEs

The use of stopping criteria for iterative Krylov methods in designing adaptive methods for PDEs Mario Arioli Visiting Professor, Wuppertal University January 6, 2016 The use of stopping criteria for iterative Krylov methods in designing

766 views • 62 slides
Based on Extended Krylov Subspace for Transient Simulation of Large-Scale Linear Circuits Wenhui

Based on Extended Krylov Subspace for Transient Simulation of Large-Scale Linear Circuits Wenhui

Efficient Matrix Exponential Method Based on Extended Krylov Subspace for Transient Simulation of Large-Scale Linear Circuits Wenhui Zhao University of Hong Kong 1 Outline Introduction Circuit Simulation Matrix Exponential

540 views • 26 slides
Structure Preserving Numerical Methods for Hyperbolic Systems of Conservation and Balance Laws

Structure Preserving Numerical Methods for Hyperbolic Systems of Conservation and Balance Laws

Structure Preserving Numerical Methods for Hyperbolic Systems of Conservation and Balance Laws Alina Chertock North Carolina State University chertock@math.ncsu.edu joint work with S. Cui, M. Herty, A. Kurganov, X. Liu, S.N. Ozcan and E.

669 views • 48 slides
Krylov methods for fast frequency response computations Karl Meerbergen January 8, 2006 Karl

Krylov methods for fast frequency response computations Karl Meerbergen January 8, 2006 Karl

Outline Motivation Rayleigh damping Rational approximation Lanczos method Numerical example Conclusions Krylov methods for fast frequency response computations Karl Meerbergen January 8, 2006 Karl Meerbergen Krylov methods for fast

372 views • 24 slides

More recommend