A sparse hp-finite element method for piecewise-smooth differential equations with periodic boundary conditions

Abstract We develop an efficient hp -finite element method for piecewise-smooth differential equations with periodic boundary conditions, using orthogonal polynomials defined on circular arcs. The operators derived from this basis are banded and achieve optimal complexity regardless of h or p , both for building the discretisation and solving the resulting linear system in the case where the operator is symmetric positive definite. The basis serves as a useful alternative to other bases such as the Fourier or integrated Legendre bases, especially for problems with discontinuities. We relate the convergence properties of these bases to regions of analyticity in the complex plane, and further use several differential equation examples to demonstrate these properties. The basis spans the low order eigenfunctions of constant coefficient differential operators, thereby achieving better smoothness properties for time-evolution partial differential equations.

Authors

Institutions

Publication Details

Journal
Numerical Algorithms
Published
2026-02-09
DOI
https://doi.org/10.1007/s11075-026-02313-y
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A sparse hp-finite element method for piecewise-smooth differential equations with periodic boundary conditions

Sheehan Olver, Daniel J. VandenHeuvel
Numerical Algorithms
Advanced Numerical Methods in Computational Mathematics
article

A sparse hp-finite element method for piecewise-smooth differential equations with periodic boundary conditions

Sheehan Olver, Daniel J. VandenHeuvel
article en

Abstract

Abstract We develop an efficient hp -finite element method for piecewise-smooth differential equations with periodic boundary conditions, using orthogonal polynomials defined on circular arcs. The operators derived from this basis are banded and achieve optimal complexity regardless of h or p , both for building the discretisation and solving the resulting linear system in the case where the operator is symmetric positive definite. The basis serves as a useful alternative to other bases such as the Fourier or integrated Legendre bases, especially for problems with discontinuities. We relate the convergence properties of these bases to regions of analyticity in the complex plane, and further use several differential equation examples to demonstrate these properties. The basis spans the low order eigenfunctions of constant coefficient differential operators, thereby achieving better smoothness properties for time-evolution partial differential equations.

Numerical Algorithms
Imperial College London (GB)
Openalex Percentile: Top 60%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.