Metraipolis › archive › dc_4f8d452f5dec
Low-Order Refined Preconditioning for Spectral/hp Element Method for Complex, 3D Geometries — arXiv:2609.31443
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.31443
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:58:06.771Z
- SHA-256 of the archived text
7f07f678251a879ddecaa9860addd6958dd3f9c71259e00da6d43eb28edfe1c4- Stable URL of this page
https://metraipolis.com/documento/dc_4f8d452f5dec
How to cite
Low-Order Refined Preconditioning for Spectral/hp Element Method for Complex, 3D Geometries — arXiv:2609.31443 — arXiv (en), https://arxiv.org/abs/2609.31443 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4f8d452f5dec (Metraipolis archive dc_4f8d452f5dec, sha256 7f07f678251a879ddecaa9860addd6958dd3f9c71259e00da6d43eb28edfe1c4)
BibTeX
@misc{dc4f8d452f5dec,
title = {Low-Order Refined Preconditioning for Spectral/hp Element Method for Complex, 3D Geometries — arXiv:2609.31443},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.31443},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4f8d452f5dec; sha256 7f07f678251a879ddecaa9860addd6958dd3f9c71259e00da6d43eb28edfe1c4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31443. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Low-order refined (LOR) preconditioning replaces a high-order operator with a low-order discretisation on a refined nodal mesh. For tensor-product elements, the two operators are spectrally equivalent with bounds independent of the polynomial order $P$, but the construction does not extend directly to simplex and mixed-element discretisations. This work makes two contributions: it extends LOR preconditioning to simplex and mixed-element discretisations, including triangular, tetrahedral, and prismatic elements, and establishes a generalised Vandermonde transformation linking the modal and nodal LOR formulations, showing that the resulting preconditioned spectra and Krylov convergence are independent of the high-order basis. Numerical experiments show controlled iteration growth on triangular meshes despite increasing condition number, and controlled iteration counts up to $P=5$ on tetrahedral, prismatic, and mixed-element meshes. A single algebraic multigrid V-cycle per outer iteration gives the best balance of iteration count and cost. The method is applied to a production incompressible Navier-Stokes simulation of a race-car front-wing and wheel configuration, discretised on a mesh of $2.87\times10^6$ mixed prismatic and tetrahedral elements giving $32.2\times10^6$ pressure degrees of freedom at $P=3$. LOR reduces the mean pressure conjugate gradient (CG) iteration count from $235.3$ to $5.5$, and the pressure-solve time over 1000 timesteps by 16.1%, relative to the default production static-condensation diagonal preconditioner in Nektar++. The one-time cost of constructing the LOR preconditioner is amortised over the production simulation. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.31443 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T02:27:28.567Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).