A convergent MUSCL–Hancock scheme for non-local conservation laws

A MUSCL–Hancock (MH) second-order scheme for the discretization of a general class of non-local conservation laws is developed, and its convergence analysis is presented. The MH scheme is a single-stage fully discrete second-order method, which is well-known for its simplicity and computational efficiency in the context of conservation laws. The core difficulty in designing such a scheme for non-local problems originates from the convolution operator embedded in the flux functions. This is handled through a novel strategy that ensures second-order accuracy and facilitates a rigorous theoretical analysis. Several essential estimates including L∞, bounded variation (BV) and L1-Lipschitz continuity in time are derived. Applying these results within the framework of Kolmogorov’s compactness theorem, we prove the convergence of a subsequence of approximate solutions to a weak solution. In general, establishing a discrete entropy inequality for second-order schemes remains elusive, making the proof of entropy convergence difficult. To overcome this, we resort to an approach in which a mesh-dependent modification to the classical slope limiter is utilized to establish convergence to the entropy solution. Numerical experiments are provided to validate the theoretical results and to demonstrate the improved accuracy of the proposed scheme over its first-order counterpart.

Authors

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2026-09-28
DOI
https://doi.org/10.1051/m2an/2026060/pdf
Primary Topic
Computational Fluid Dynamics and Aerodynamics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

A convergent MUSCL–Hancock scheme for non-local conservation laws

Nikhil Manoj, K. Sudarshan Kumar, G. D. Veerappa Gowda
Springer Link (Chiba Institute of Technology)
Computational Fluid Dynamics and Aerodynamics
article

A convergent MUSCL–Hancock scheme for non-local conservation laws

Nikhil Manoj, K. Sudarshan Kumar, G. D. Veerappa Gowda
article en

Abstract

A MUSCL–Hancock (MH) second-order scheme for the discretization of a general class of non-local conservation laws is developed, and its convergence analysis is presented. The MH scheme is a single-stage fully discrete second-order method, which is well-known for its simplicity and computational efficiency in the context of conservation laws. The core difficulty in designing such a scheme for non-local problems originates from the convolution operator embedded in the flux functions. This is handled through a novel strategy that ensures second-order accuracy and facilitates a rigorous theoretical analysis. Several essential estimates including L∞, bounded variation (BV) and L1-Lipschitz continuity in time are derived. Applying these results within the framework of Kolmogorov’s compactness theorem, we prove the convergence of a subsequence of approximate solutions to a weak solution. In general, establishing a discrete entropy inequality for second-order schemes remains elusive, making the proof of entropy convergence difficult. To overcome this, we resort to an approach in which a mesh-dependent modification to the classical slope limiter is utilized to establish convergence to the entropy solution. Numerical experiments are provided to validate the theoretical results and to demonstrate the improved accuracy of the proposed scheme over its first-order counterpart.

Springer Link (Chiba Institute of Technology)
Life in Land
Openalex Percentile: Top 40%
Computational Fluid Dynamics and Aerodynamics
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.