kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Matrix-Free Algebraic hp-Multigrid Method for Computational Fluid Dynamics Applications
RIKEN Center for Computational Science, Kobe, Japan.ORCID iD: 0000-0002-4803-4416
Sandia National Laboratories, Albquerque, USA.ORCID iD: 0000-0001-5654-2384
KTH, School of Electrical Engineering and Computer Science (EECS), Centres, Centre for High Performance Computing, PDC.ORCID iD: 0000-0002-5020-1631
2026 (English)In: Proceedings of Supercomputing Asia and International Conference on High Performance Computing in Asia Pacific Region, SCA/HPCAsia 2026, Association for Computing Machinery (ACM) , 2026, p. 194-202Conference paper, Published paper (Refereed)
Abstract [en]

We present an algebraic hp-multigrid method for high-order matrix-free methods. Algebraic multigrid methods often require information about matrix entries, which are not available in a matrix-free setting; however, when rediscretization for geometric multigrid is not available for a matrix-free method, coarsening must be constructed using information from the mesh. Leveraging only mesh adjacency information, this algorithm constructs an algebraic multigrid hierarchy without requiring geometric coarsening or explicit matrix assembly, making it well-suited for GPUĝ€'accelerated architectures. This paper presents the implementation of the matrix-free method in the high-fidelity computational fluid dynamics framework Neko, which utilizes spectral element methods with an implicit-explicit scheme to solve the incompressible Navier-Stokes equations. We utilize an hp-multigrid approach, where the problem is first coarsened from high-order polynomials to low-order polynomials, and then the low-order system is further coarsened spatially in an matrix-free fashion using mesh adjacency information. Finally, we present numerical results from the Dardel and LUMI supercomputers that demonstrate the performance and scalability of our method as well as its applicability to real-world applications.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM) , 2026. p. 194-202
Keywords [en]
Algebraic multigrid, hp-multigrid, Matrix-free, p-multigrid, preconditioning
National Category
Computational Mathematics Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-378882DOI: 10.1145/3773656.3773686Scopus ID: 2-s2.0-105031770200OAI: oai:DiVA.org:kth-378882DiVA, id: diva2:2051779
Conference
Supercomputing Asia and International Conference on High Performance Computing in Asia Pacific Region, SCA/HPCAsia 2026, Osaka, Japan, January 26-29, 2026
Note

Part of ISBN 9798400720673

QC 20260415

Available from: 2026-04-09 Created: 2026-04-09 Last updated: 2026-04-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Jansson, Niclas

Search in DiVA

By author/editor
Ohm, PeterHarper, GrahamJansson, Niclas
By organisation
Centre for High Performance Computing, PDC
Computational MathematicsComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 44 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf