arXiv subjects

Joseph D. Ward

Publications and source records attributed to Joseph D. Ward.

7 recordsLinked to original sources

arXiv2025

Extending Data to Improve Stability and Error Estimates Using Asymmetric Kansa-like Methods to Solve PDEs

In this paper, a theoretical framework is presented for the use of a Kansa-like method to numerically solve elliptic partial differential equations on spheres and other manifolds. The theory addresses both the stability of the method and provides error estimates for two different approximation methods. A Kansa-like matrix is obtained by replacing the test point set $X$, used in the traditional Kansa method, by a larger set $Y$, which is a norming set for the underlying trial space. This gives rise to a rectangular matrix. In addition, if a basis of Lagrange (or local Lagrange) functions is used for the trial space, then it is shown that the stability of the matrix is comparable to the stability of the elliptic operator acting on the trial space. Finally, two different types of error estimates are given. Discrete least squares estimates of very high accuracy are obtained for solutions that are sufficiently smooth. The second method, giving similar error estimates, uses a rank revealing factorization to create a ``thinning algorithm'' that reduces $\#Y$ to $\#X$. In practice, this algorithm doesn't need $Y$ to be a norming set.

math.NA↗

arXiv2023

Highly Localized RBF Lagrange Functions for Finite Difference Methods on Spheres

The aim of this paper is to show how rapidly decaying RBF Lagrange functions on the spheres can be used to create effective, stable finite difference methods based on radial basis functions (RBF-FD). For certain classes of PDEs this approach leads to precise convergence estimates for stencils which grow moderately with increasing discretization fineness.

math.NA↗

arXiv2020

Interpolating splines on graphs for data science applications

We introduce intrinsic interpolatory bases for data structured on graphs and derive properties of those bases. Polyharmonic Lagrange functions are shown to satisfy exponential decay away from their centers. The decay depends on the density of the zeros of the Lagrange function, showing that they scale with the density of the data. These results indicate that Lagrange-type bases are ideal building blocks for analyzing data on graphs, and we illustrate their use in kernel-based machine learning applications.

math.NA↗

arXiv2017

Direct and Inverse Results on Bounded Domains for Meshless Methods via Localized Bases on Manifolds

This article develops direct and inverse estimates for certain finite dimensional spaces arising in kernel approximation. Both the direct and inverse estimates are based on approximation spaces spanned by local Lagrange functions which are spatially highly localized. The construction of such functions is computationally efficient and generalizes the construction given by the authors for restricted surface splines on $\mathbb{R}^d$. The kernels for which the theory applies includes the Sobolev-Matérn kernels for closed, compact, connected, $C^\infty$ Riemannian manifolds.

math.NA↗

arXiv2016

An inverse theorem for compact Lipschitz regions in $R^d$ using localized kernel bases

While inverse estimates in the context of radial basis function approximation on boundary-free domains have been known for at least ten years, such theorems for the more important and difficult setting of bounded domains have been notably absent. This article develops inverse estimates for finite dimensional spaces arising in radial basis function approximation and meshless methods. The inverse estimates we consider control Sobolev norms of linear combinations of a localized basis by the $L_p$ norm over a bounded domain. The localized basis is generated by forming local Lagrange functions for certain types of RBFs (namely Matérn and surface spline RBFs). In this way it extends the boundary-free construction of Fuselier, Hangelbroek, Narcowich, Ward and Wright.

math.NA↗

arXiv2016

A Meshless Galerkin Method For Non-Local Diffusion Using Localized Kernel Bases

We introduce a meshless method for solving both continuous and discrete variational formulations of a volume constrained, nonlocal diffusion problem. We use the discrete solution to approximate the continuous solution. Our method is nonconforming and uses a localized Lagrange basis that is constructed out of radial basis functions. By verifying that certain inf-sup conditions hold, we demonstrate that both the continuous and discrete problems are well-posed, and also present numerical and theoretical results for the convergence behavior of the method. The stiffness matrix is assembled by a special quadrature routine unique to the localized basis. Combining the quadrature method with the localized basis produces a well-conditioned, symmetric matrix. This then is used to find the discretized solution.

math.NA↗

arXiv2015

A Novel Galerkin Method for Solving PDEs on the Sphere Using Highly Localized Kernel Bases

We present a novel Galerkin method for solving partial differential equations on the sphere. The problem is discretized by a highly localized basis which is easily constructed. The stiffness matrix entries are computed by a recently developed quadrature formula unique to the localized bases we consider. We present error estimates and investigate the stability of the discrete stiffness matrix. Implementation and numerical experiments are discussed.

math.NA↗