Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.05851

High-order smoothness and high-order collocation approximation for Volterra integral equation with multiscale and nonlinear exponent kernel

Wenlin Qiu·Chuanwei Su·Xiangcheng Zheng
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a Volterra integral equation with multiscale and nonlinear exponent kernel. We propose the high-order smoothing conditions, under which the initial singularity of the solutions can be eliminated up to any prescribed order. This indicates the application of the multiscale nature of the kernel on local modification of the solutions. Then a discontinuous high-order collocation method with arbitrary polynomial degree is developed and analyzed on uniform or graded meshes based on the solution regularity. This work serves as a comprehensive extension and complement to [Zheng, Qiu and Stynes, SIAM J. Numer. Anal., to appear] in both mathematical and numerical aspects.

Explore related subjects

math.NAcs.NA

Keep this discovery

BibTeXRIS

Wenlin Qiu, Chuanwei Su, Xiangcheng Zheng. 2026-09-05. High-order smoothness and high-order collocation approximation for Volterra integral equation with multiscale and nonlinear exponent kernel. https://arxiv.org/abs/2609.05851

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

Discover connections

cs.NA subjectmath.NA subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT↗
arXiv2026

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA↗
arXiv2021

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA↗