{
  "annotation_id": "8c93c08c-4eca-45d9-80b2-def4e33f8f4f",
  "date_created": "2026-02-17T05:53:24.173000Z",
  "date_modified": "2026-02-17T05:53:24.173000Z",
  "file_hash": "49ede300e2c4d1fac0d2b2ca75db5db291c9418724da21ebf205acb73d3e30e8",
  "private": false,
  "record": {
    "abstract": "The Shifted Boundary Method (SBM) trades some part of the burden of body-fitted meshing for increased algebraic complexity. While the resulting linear systems retain the standard $\\mathcal{O}(h^{-2})$ conditioning of second-order operators, the non-symmetry and non-local boundary coupling render them resistant to standard Algebraic Multigrid (AMG) and simple smoothers for high-order discretisations. We present a geometric multigrid preconditioner that effectively tames these systems. At its core lies the \\emph{Full-Residual Shy Patch} smoother: a subspace correction strategy that filters out some patches while capturing the full physics of the shifted boundary. Unlike previous cell-wise approaches that falter at high polynomial degrees, our method delivers convergence with low mesh dependence. We demonstrate performance for Continuous Galerkin approximations, maintaining low and stable iteration counts up to polynomial degree $p=3$ in 3D, proving that SBM can be both geometrically flexible and algebraically efficient.",
    "arxiv_id": "2601.10399",
    "authors": [
      "Micha\u0142 Wichrowski",
      "Ajay Ajith"
    ],
    "categories": [
      "math.NA",
      "cs.NA"
    ],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "title": "A Geometric Multigrid Preconditioner for Shifted Boundary Method",
    "url": "https://arxiv.org/abs/2601.10399",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f32fbd03-959f-43cf-b1dc-7b51517fc8ae",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}