arXiv (All)
open access
Efficient and Fast Tensor-Product Multinode Shepard Collocation for Elliptic PDEs on Cartesian Grids
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 s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient and Fast Tensor-Product Multinode Shepard Collocation for Elliptic PDEs on Cartesian Grids#920946
- Higher order stray field computation on tensor product domains#924430
- Higher order stray field computation on tensor product domains#920199
- Level-Set Geometry and the Theoretical Performance of PDHG for Conic Linear Optimization#1013305
- TopoGS: Topology-Aware Anchor Feature Aggregation for Large-Scale 3D Gaussian Splatting#1064412
Record · ID 925181
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive