TY - JOUR
T1 - Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
AU - Fuselier, E.
AU - Ward, John P
PY - 2024/12/15
Y1 - 2024/12/15
N2 - Graph-based approximation methods are of growing interest in many areas, including transportation, biological and chemical networks, financial models, image processing, network flows, and more. In these applications, often a basis for the approximation space is not available analytically and must be computed. We propose perturbations of Lagrange bases on graphs, where the Lagrange functions come from a class of functions analogous to classical splines. The basis functions we consider have local support, with each basis function obtained by solving a small energy minimization problem related to a differential operator on the graph. We present ℓ∞ error estimates between the local basis and the corresponding interpolatory Lagrange basis functions in cases where the underlying graph satisfies an assumption on the connections of vertices where the function is not known, and the theoretical bounds are examined further in numerical experiments. Included in our analysis is a mixed-norm inequality for positive definite matrices that is tighter than the general estimate ‖A‖∞≤n‖A‖2.
AB - Graph-based approximation methods are of growing interest in many areas, including transportation, biological and chemical networks, financial models, image processing, network flows, and more. In these applications, often a basis for the approximation space is not available analytically and must be computed. We propose perturbations of Lagrange bases on graphs, where the Lagrange functions come from a class of functions analogous to classical splines. The basis functions we consider have local support, with each basis function obtained by solving a small energy minimization problem related to a differential operator on the graph. We present ℓ∞ error estimates between the local basis and the corresponding interpolatory Lagrange basis functions in cases where the underlying graph satisfies an assumption on the connections of vertices where the function is not known, and the theoretical bounds are examined further in numerical experiments. Included in our analysis is a mixed-norm inequality for positive definite matrices that is tighter than the general estimate ‖A‖∞≤n‖A‖2.
KW - Approximation on graphs
KW - Graph basis functions
KW - Graph Laplacian
KW - Lagrange functions
KW - Variational splines on graphs
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85204742924&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85204742924&origin=inward
U2 - 10.1016/j.laa.2024.09.011
DO - 10.1016/j.laa.2024.09.011
M3 - Article
SN - 0024-3795
VL - 703
SP - 369
EP - 394
JO - Linear Algebra and Its Applications
JF - Linear Algebra and Its Applications
ER -