Efficient and Fast Tensor-Product Multinode Shepard Collocation for Elliptic PDEs on Cartesian Grids
Abstract
We introduce a Grid-Based Multinode Shepard Collocation Method (GBMSC) for two-dimensional elliptic boundary value problems on rectangular domains. The method combines Shepard-type partition functions with tensor-product Lagrange interpolation on overlapping local Cartesian subgrids. The Cartesian structure avoids the local unisolvency search required by multinode Shepard constructions on scattered data, while the local character of the approximation yields sparse collocation matrices and moderate conditioning. We establish the main structural properties of the method, including the cardinal property, tensor-product polynomial reproduction, and local interpolation estimates. Numerical experiments for Poisson problems with Dirichlet and mixed boundary conditions confirm the polynomial reproduction property up to round-off accuracy and show regular convergence for smooth non-polynomial solutions. Comparisons with Multinode Shepard Collocation Method (MSC) and Kansa's collocation methods indicate that the proposed discretization preserves high accuracy with significantly better conditioning than the RBF-based schemes considered.
Related
- Well-Conditioned Birkhoff-Collocation Methods for Elliptic-type Problems in Multiple Dimensions
- Compressed Multiscale Kernel Collocation and Physics-Informed Kernel Learning for Elliptic BVPs
- Residual-Based Adaptive Refinement in Hybrid Variational-Collocation PINNs for Singular Elliptic PDEs with Mixed Dirichlet-Neumann Boundary Conditions
- On the Turán Number of the Cartesian Product of Two Stars
- On the Turán number for the Cartesian product of an odd cycle and a tree
BibTeX
@misc{harrak2026efficient,
title = {{Efficient and Fast Tensor-Product Multinode Shepard Collocation for Elliptic PDEs on Cartesian Grids}},
author = {Anouar El Harrak and Hatim Tayeq and Benaissa Zerroudi},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2606.14503},
eprint = {2606.14503},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.14503},
}
RIS
TY - UNPB
TI - Efficient and Fast Tensor-Product Multinode Shepard Collocation for Elliptic PDEs on Cartesian Grids
AU - Anouar El Harrak
AU - Hatim Tayeq
AU - Benaissa Zerroudi
PY - 2026
DA - 2026/09/02
PB - arXiv
DO - 10.48550/arxiv.2606.14503
UR - https://arxiv.org/abs/2606.14503
AB - We introduce a Grid-Based Multinode Shepard Collocation Method (GBMSC) for two-dimensional elliptic boundary value problems on rectangular domains. The method combines Shepard-type partition functions with tensor-product Lagrange interpolation on overlapping local Cartesian subgrids. The Cartesian structure avoids the local unisolvency search required by multinode Shepard constructions on scattered data, while the local character of the approximation yields sparse collocation matrices and moderate conditioning. We establish the main structural properties of the method, including the cardinal property, tensor-product polynomial reproduction, and local interpolation estimates. Numerical experiments for Poisson problems with Dirichlet and mixed boundary conditions confirm the polynomial reproduction property up to round-off accuracy and show regular convergence for smooth non-polynomial solutions. Comparisons with Multinode Shepard Collocation Method (MSC) and Kansa's collocation methods indicate that the proposed discretization preserves high accuracy with significantly better conditioning than the RBF-based schemes considered.
ER -