One of the main features when dealing with Hamiltonian problems is the conservation of the energy. In this paper we review, at an elemental level, the main facts concerning the family of low-rank Runge-Kutta methods named Hamiltonian Boundary Value Methods (HBVMs) for the efficient numerical integration of these problems. Using these methods one can obtain, an at least “practical”, conservation of the Hamiltonian. We also discuss the efficient implementation of HBVMs by means of two different procedures: the blended implementation of the methods and an iterative procedure based on a particular triangular splitting of the corresponding Butcher’s matrix. We analyze the computational cost of these two procedures that result to be an excellent alternative to a classical fixed-point iteration when the problem at hand is a stiff one. A few numerical tests confirm all the theoretical findings.

HAMILTONIAN BOUNDARY VALUE METHODS (HBVMs) and their efficient implementation / L.Brugnano; G.Frasca Caccia; F.Iavernaro. - In: MATHEMATICS IN ENGINEERING, SCIENCE AND AEROSPACE. - ISSN 2041-3173. - ELETTRONICO. - 5:(2014), pp. 343-411.

HAMILTONIAN BOUNDARY VALUE METHODS (HBVMs) and their efficient implementation

BRUGNANO, LUIGI;FRASCA CACCIA, GIANLUCA;
2014

Abstract

One of the main features when dealing with Hamiltonian problems is the conservation of the energy. In this paper we review, at an elemental level, the main facts concerning the family of low-rank Runge-Kutta methods named Hamiltonian Boundary Value Methods (HBVMs) for the efficient numerical integration of these problems. Using these methods one can obtain, an at least “practical”, conservation of the Hamiltonian. We also discuss the efficient implementation of HBVMs by means of two different procedures: the blended implementation of the methods and an iterative procedure based on a particular triangular splitting of the corresponding Butcher’s matrix. We analyze the computational cost of these two procedures that result to be an excellent alternative to a classical fixed-point iteration when the problem at hand is a stiff one. A few numerical tests confirm all the theoretical findings.
2014
5
343
411
L.Brugnano; G.Frasca Caccia; F.Iavernaro
File in questo prodotto:
File Dimensione Formato  
mesa 5,4 (2014) 343-411.pdf

Accesso chiuso

Tipologia: Pdf editoriale (Version of record)
Licenza: Tutti i diritti riservati
Dimensione 668.51 kB
Formato Adobe PDF
668.51 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/841919
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact