Searcharxiv⌕ Search

arXiv · 2610.23163

Stability and Error Estimates for Convolution Quadrature under Radial Symbol Bounds

Abstract

We develop stability and error estimates for multistep convolution quadrature (CQ) under general radial bounds on the Laplace symbol. Instead of the classical single-power condition $|F(z)|\leq M|z|^{-μ}$, we assume $|F(z)|\leq CΦ(|z|)$ and consider two classes of radial functions: monotone bounds satisfying a scaling condition and regularly varying bounds with locally bounded above and away from zero. For strongly $A(α)$-stable multistep methods, we derive approximation and stability estimates for the CQ weights, as well as error bounds for power-type inputs $g_β(t)=t^{β-1}/Γ(β)$ with $β>0$. These estimates explicitly retain the dependence on the memory law through the factor $Φ(t_n^{-1})$. The framework accommodates symbols whose behavior cannot be described by a global single-power. It also preserves slowly varying and multiscale factors that would be lost under a coarser power majorant. The theory is applied to fractional viscoelastic models, distributed-order operators, and logarithmic-power memory operators. Numerical experiments with backward Euler and second-order backward differentiation CQ confirm the expected temporal convergence orders for direct responses. Complementary evolution examples demonstrate the corresponding temporal behavior for smooth and nonsmooth initial data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jingchuang Ren, Haibin Su. 2026-10-16. Stability and Error Estimates for Convolution Quadrature under Radial Symbol Bounds. https://arxiv.org/abs/2610.23163

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

KEEP EXPLORING

Related papers

Optimization of gridding algorithms for FFT by vector optimization

The Fast Fourier Transform (FFT) is widely used in applications such as MRI, CT, and interferometry; however, because of its dependence on uniformly sampled data, it requires the use of gridding techniques for practical implementation. The performance of these algorithms strongly depends on the choice of the gridding kernel, with the first prolate spheroidal wave function (PSWF) regarded as optimal. This work redefines kernel optimality through the lens of vector optimization (VO), introducing a rigorous framework that characterizes optimal kernels as Pareto-efficient solutions of an error shape operator. We establish the continuity of such operator, study the existence of solutions, and propose a novel methodology to construct kernels tailored to a desired target error function. The approach is implemented numerically via interior-point optimization. Comparative experiments demonstrate that the proposed kernels outperform both the PSWF and the state-of-the-art methods (MIRT-NUFFT) in specific regions of interest, achieving orders-of-magnitude improvements in mean absolute errors. These results confirm the potential of VO-based kernel design to provide customized accuracy profiles aligned with application-specific requirements. Future research will extend this framework to multidimensional cases and relative error minimization, with potential integration of machine learning for adaptive target error selection.

math.NA↗

On the convergence rates of generalized conditional gradient method for fully discretized Mean Field Games

We study convergence rates of the generalized conditional gradient (GCG) method applied to fully discretized Mean Field Games (MFG) systems. While explicit convergence rates of the GCG method have been established at the continuous PDE level, a rigorous analysis that simultaneously accounts for time-space discretization and iteration errors has been missing. In this work, we consider an MFG system with a quadratic Hamiltonian including an advection term. We employ the GCG method to construct an iterative algorithm in which the HJB and FP equations are solved separately. At each iteration, we apply the Cole--Hopf transformation to linearize these equations and discretize the resulting linear PDEs using a finite difference method. We then analyze the resulting fully discrete GCG scheme. Under suitable structural assumptions on coupling terms, we establish discrete maximum principles and derive explicit error estimates that quantify both discretization errors and iteration errors within a unified framework. Our estimates show how the convergence rates depend on the mesh sizes and the iteration number, and they reveal a non-uniform behavior with respect to the iteration. Moreover, we prove that higher convergence rates can be achieved under additional regularity assumptions on the solution. Numerical experiments are presented to illustrate the theoretical results and to confirm the predicted convergence behavior.

math.NA↗

Dynamic inverse problems: Online regularisation theory

We develop regularisation theory for dynamic inverse problems, solved using online methods with an infinite time horizon. Using concepts of subregularity to treat nonsmooth regularisers, we prove that time-averaged reconstruction errors converge to zero as noise, algorithmic errors, and regularisation vanish as the horizon grows. We illustrate the theory numerically with a dynamic electrical impedance tomography example.

math.NA↗