Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1304.0974

Efficient implementation of Gauss collocation and Hamiltonian Boundary Value Methods

Luigi Brugnano·Gianluca Frasca Caccia·Felice Iavernaro
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luigi Brugnano, Gianluca Frasca Caccia, Felice Iavernaro. 2013-12-31. Efficient implementation of Gauss collocation and Hamiltonian Boundary Value Methods. https://doi.org/10.1007/s11075-014-9825-0

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Sharp Sobolev Sandwich and Approximation Rates of Radon-Domain $L^p$ Ridge Integral Spaces for ReLU$^k$ Networks

We develop the $L^p$ space and approximation theory for shallow neural networks with $\mathrm{ReLU}^k$ activations. The central object is the Radon-domain $L^p$ space $\mathcal{R}L^p_k(Ω)$ containing all functions on a bounded domain $Ω$ that admit a ridge integral representation whose coefficient density belongs to $L^p$ in the Radon domain. In the Hilbert case $p=2$, we prove by elementary Fourier analysis that this space recovers the critical Sobolev space $H^{k+(d+1)/2}(Ω)$. For general $1<p<\infty$, the identity becomes a sandwich for Bessel-potential Sobolev spaces. The sharp gap of each side is exactly the Seeger--Sogge--Stein loss for the Radon transform as a Fourier integral operator. This also clarifies how the activation regularity and Radon back-projection jointly produce the regularity. As an application, we discretize the integral representation using a deterministic interpolation skeleton plus uniform sampling. This yields high-probability $L^p$ approximation rates and the optimal Hilbert rate $O\!\big(n^{-\frac12-\frac{2k+1}{2d}}\big)$ at $p=2$ for linearized neural networks.

math.NA↗
arXiv2026

A Matrix-free Augmented High Order Compact Solver for Variable-Coefficient Biharmonic Problems

We propose an augmented high-order compact finite difference method for biharmonic equations with clamped boundary conditions and variable coefficients. Standard mixed-type formulations introduce an auxiliary variable, but its boundary values are unavailable, leaving the resulting discrete systems globally coupled and difficult to solve at large scales. Our key contribution is the development of a new augmented formulation that treats these unavailable boundary values as additional unknowns, reduces the global coupling to a lower-dimensional Schur complement system, and yields decoupled second-order subproblems. The Schur complement is solved by matrix-free GMRES, while the subproblems are handled by FFT-based fast solvers. The method achieves fourth-order accuracy using compact stencils, and has $O(n\log n)$ computational complexity, enabling the solution of the biharmonic equation with $1024^3$ degrees of freedom within several minutes. To the best of our knowledge, this level of computational efficiency has not previously been achieved in either the literature or practice. Using energy estimates and Fourier analysis, we derive a new $L^2$-estimate for Poisson equations with inexact Dirichlet boundary and then prove the convergence of the proposed scheme. We provide ample numerical experiments to confirm the accuracy, efficiency, and further apply the fast and accurate solver to triharmonic equations, high-wavenumber problems, Stokes flow, and plate bending problems.

math.NA↗
arXiv2026

Structure-Informed Data-Driven Reduced-Order Modeling of Scalar Hyperbolic Conservation Laws via Kinetic Defect Measure

Reduced-order modeling of transport-dominated systems remains challenging because moving fronts and shocks are poorly represented by low-dimensional linear subspaces. We develop a structure-informed data-driven reduced-order model(ROM) for scalar hyperbolic conservation laws based on the kinetic defect formulation. This formulation separates the nonlinear dynamics into known characteristic transport and a kinetic entropy defect localized on the shock manifold. We exploit this structure by first removing the known transport from the solution snapshots. We then extract and register the remaining defect-driven dynamics in a shock-attached coordinate system. Separate ROMs are used to evolve the shock geometry and the registered defect-driven source. During prediction, the predicted shock geometry is used to inverse-register the learned defect-driven source, which advances the kinetic state and recovers the physical solution. Numerical examples in one and two spatial dimensions demonstrate accurate reconstruction and prediction of nonlinear transport with shocks, including evolution beyond the training interval, while accurately capturing the mass and entropy-dissipation behavior of the reference solution.

math.NA↗