Solution of a system of Hamilton-Jacobi equations on a network
Abstract
We extend the study of Hamilton-Jacobi equations on networks from a single equation to a weakly coupled system of two equations on a star graph, and we develop a numerical scheme for it. Instead of prescribing the boundary values and imposing a junction condition, we compute the solution on each branch from its outer vertex toward the junction and determine the boundary values for which these branchwise solutions agree at the junction. On each branch, we replace the right-hand sides by their cell averages and solve the resulting problems exactly on every cell. This gives an iteration whose limits we compute in closed form. From these limits, the values of the discrete solution at the junction are affine functions of the boundary values on the branch, with a 2 × 2 matrix whose rows sum to one and whose determinant factors into explicit contributions of the cells. We use these formulas to characterize the boundary values that give solutions continuous at the junction and monotone on every branch: when the matrices are nonsingular, the admissible boundary values of one branch form a convex polygon, bounded by conditions on the difference of the two components and by positivity conditions, and the boundary values on the other branches follow from them. We also treat the singular case, and we illustrate the results with numerical experiments.
Related
- Low Residuals, Wrong Value: Learning the Viscosity Solution of Hamilton-Jacobi-Isaacs Equations with PINNs
- Convergence of kernel and neural-network methods for Hamilton--Jacobi--Bellman equations on unbounded domains
- Convex C^1 Representation for Critical Hamilton-Jacobi Equations
- Policy iteration for Hamilton-Jacobi-Isaacs equations with control constraints and comparison with Hamilton-Jacobi-Bellman equations
- Pathological viscosity solutions of Hamilton--Jacobi equations
BibTeX
@misc{hammett2026solution,
title = {{Solution of a system of Hamilton-Jacobi equations on a network}},
author = {Emily R. Hammett and Maria Teresa Chiri and Kenneth D. Czuprynski and Ludmil T. Zikatanov},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.14271},
eprint = {2610.14271},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.14271},
}
RIS
TY - UNPB
TI - Solution of a system of Hamilton-Jacobi equations on a network
AU - Emily R. Hammett
AU - Maria Teresa Chiri
AU - Kenneth D. Czuprynski
AU - Ludmil T. Zikatanov
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.14271
UR - https://arxiv.org/abs/2610.14271
AB - We extend the study of Hamilton-Jacobi equations on networks from a single equation to a weakly coupled system of two equations on a star graph, and we develop a numerical scheme for it. Instead of prescribing the boundary values and imposing a junction condition, we compute the solution on each branch from its outer vertex toward the junction and determine the boundary values for which these branchwise solutions agree at the junction. On each branch, we replace the right-hand sides by their cell averages and solve the resulting problems exactly on every cell. This gives an iteration whose limits we compute in closed form. From these limits, the values of the discrete solution at the junction are affine functions of the boundary values on the branch, with a 2 × 2 matrix whose rows sum to one and whose determinant factors into explicit contributions of the cells. We use these formulas to characterize the boundary values that give solutions continuous at the junction and monotone on every branch: when the matrices are nonsingular, the admissible boundary values of one branch form a convex polygon, bounded by conditions on the difference of the two components and by positivity conditions, and the boundary values on the other branches follow from them. We also treat the singular case, and we illustrate the results with numerical experiments.
ER -