Spectrally accurate energy‐preserving methods for the numerical solution of the “good” Boussinesq equation

In this paper we study the geometric numerical solution of the so called “good” Boussinesq equation. This goal is achieved by using a convenient space semi‐discretization, able to preserve the corresponding Hamiltonian structure, then using energy‐conserving Runge–Kutta methods in the Hamiltonian boundary value method class for the time integration. Numerical tests are reported, confirming the effectiveness of the proposed method.     

On the effectiveness of spectral methods for the numerical solution of multi-frequency highly oscillatory Hamiltonian problems

Numerical Algorithms - Multi-frequency, highly oscillatory Hamiltonian problems derive from the mathematical modelling of many real-life applications. We here propose a variant of Hamiltonian...     

Blended implicit methods for solving ODE and DAE problems,and their extension for second-order problems

The use of implicit numerical methods is mandatory when solving general stiff ODE/DAE problems. Their use, in turn, requires the solution of a corresponding discrete problem, which is one of the main concerns in the actual implementation of the methods. In this respect, blended implicit methods provide a general framework for the efficient solution of the discrete problems generated by block implicit methods. In this paper, we review the main facts concerning blended implicit methods for the numerical solution of ODE and DAE problems.     

Analysis of spectral Hamiltonian boundary value methods (SHBVMs) for the numerical solution of ODE problems

Numerical Algorithms - Recently, the numerical solution of stiffly/highly oscillatory Hamiltonian problems has been attacked by using Hamiltonian boundary value methods (HBVMs) as spectral methods...     

Spectrally accurate space-time solution of Hamiltonian PDEs

Numerical Algorithms - Recently, the numerical solution of multi-frequency, highly oscillatory Hamiltonian problems has been attacked by using Hamiltonian boundary value methods (HBVMs) as spectral...     

Parallel ODE solvers based on block BVMs

In this paper we deal with Boundary Value Methods (BVMs), which are methods recently introduced for the numerical approximation of initial value problems for ODEs. Such methods, based on linear multistep formulae (LMF), overcome the stability limitations due to the well-known Dahlquist barriers, and have been the subject of much research in the last years. This has led to the definition of a new stability framework, which generalizes the one stated by Dahlquist for LMF. Moreover, several aspects have been investigated, including the efficient stepsize control [17,25,26] and the application of the methods for approximating different kinds of problems such as BVPs, PDEs and DAEs [7,23,41]. Furthermore, a block version of such methods, recently proposed for approximating Hamiltonian problems [24], is able to provide an efficient parallel solver for ODE systems [3].     

Energy-preserving methods for Poisson systems

We present and analyze energy-conserving methods for the numerical integration of IVPs of Poisson type that are able to preserve some Casimirs. Their derivation and analysis is done following the ideas of Hamiltonian BVMs (HBVMs) (see Brugnano et al. [10] and references therein). It is seen that the proposed approach allows us to obtain the methods recently derived in Cohen and Hairer (2011) [17], giving an alternative derivation of such methods and a new proof of their order. Sufficient conditions that ensure the existence of a unique solution of the implicit equations defining the formulae are given. A study of the implementation of the methods is provided. In particular, order and preservation properties when the involved integrals are approximated by means of a quadrature formula, are derived.     

Efficient implementation of Gauss collocation and Hamiltonian boundary value methods

In this paper we define an efficient implementation for the family of low-rank energy-conserving Runge-Kutta methods named Hamiltonian Boundary Value Methods (HBVMs), recently defined in the last years. The proposed implementation relies on the particular structure of the Butcher matrix defining such methods, for which we can derive an efficient splitting procedure. The very same procedure turns out to be automatically suited for the efficient implementation of Gauss-Legendre collocation methods, since these methods are a special instance of HBVMs. The linear convergence analysis of the splitting procedure exhibits excellent properties, which are confirmed by a few numerical tests.