Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2602.01803 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Inhaltsangabe:
- We present a computational method for reconstructing a vector field on a convex polytope $\mathcal{P} \subset \mathbb{R}^d$ of arbitrary dimension from discrete samples. We specifically address the scenario where the vector field is subject to a no-penetration (slip) boundary condition, requiring it to be tangent to the boundary $\partial \mathcal{P}$. Given a degree bound $k$, our algorithm computes a polynomial vector field of degree at most $k$ that fits the observed data in the least-squares sense while exactly satisfying the tangency constraints. Central to our approach is an explicit characterization of the module of polynomial vector fields tangent to $\partial \mathcal{P}$, derived using algebraic concepts from the theory of hyperplane arrangements.