Efficient implementation of Gauss collocation and Hamiltonian boundary value methods
Publication:2454395
DOI10.1007/s11075-014-9825-0zbMath1291.65357arXiv1304.0974OpenAlexW3098234845MaRDI QIDQ2454395
Luigi Brugnano, Felice Iavernaro, Gianluca Frasca-Caccia
Publication date: 13 June 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.0974
convergencesplittingimplicit Runge-Kutta methodsnumerical testHamiltonian boundary value methodsenergy-conserving methodsW-transformationButcher matrixGauss-Legendre collocation methods
Nonlinear ordinary differential equations and systems (34A34) Stability and convergence of numerical methods for ordinary differential equations (65L20) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Numerical methods for Hamiltonian systems including symplectic integrators (65P10) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15)
Related Items (30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Line integral methods which preserve all invariants of conservative problems
- Low rank Runge-Kutta methods, symplecticity and stochastic Hamiltonian problems with additive noise
- The lack of continuity and the role of infinite and infinitesimal in numerical methods for ODEs: the case of symplecticity
- A simple framework for the derivation and analysis of effective one-step methods for ODEs
- Efficient implementation of Radau collocation methods
- A note on the efficient implementation of Hamiltonian BVMs
- Some schemes for the implementation of implicit Runge-Kutta methods
- Recent advances in linear analysis of convergence for splittings for solving ODE problems
- Splitting methods for second-order initial value problems
- The use of approximate factorization in stiff ODE solvers
- Iterative schemes for Gauss methods
- Parallel linear system solvers for Runge-Kutta methods
- A note on the efficient implementation of implicit methods for ODEs
- The BiM code for the numerical solution of ODEs.
- Blended implementation of block implicit methods for ODEs
- Hamiltonian Boundary Value Methods (Energy Conserving Discrete Line Integral Methods)
- An Iteration Scheme for Implicit Runge—Kutta Methods
- Triangularly Implicit Iteration Methods for ODE-IVP Solvers
- Some linear algebra issues concerning the implementation of blended implicit methods
- A Transformed implicit Runge-Kutta Method
- On the implementation of implicit Runge-Kutta methods
- An Efficient Solution Process for Implicit Runge–Kutta Methods
- Energy- and Quadratic Invariants--Preserving Integrators Based upon Gauss Collocation Formulae
- Geometric Numerical Integration
- s-stage Trapezoidal Methods for the Conservation of Hamiltonian Functions of Polynomial Type
This page was built for publication: Efficient implementation of Gauss collocation and Hamiltonian boundary value methods