Engineering Papers⌕ Search
Home/Archive/DOE OSTI

DOE OSTI · 1845639

High-order algorithmic developments and optimizations for large-scale GPU-accelerated simulations (Milestone CEED-MS36)

Kolev, Tzanio·Fischer, Paul·Austin, Anthony P.·Barker, Andrew T.·Beams, Natalie·Brown, Jed·Camier, Jean-Sylvain·Chalmers, Noel·Dobrev, Veselin·Dudouit, Yohann·Ghaffari, Leila·Kerkemeir, Stefan·Lan, Yu-Hsiang·Merzari, Elia·Min, Misun·Pazner, Will·Rathnayake, Thilina·Shephard, Mark S.·Siboni, Morteza H.·Smith, Cameron W.·Thompson, Jeremy L.·Tomov, Stanimire·Warburton, Tim
View original source ↗Read source document ↗Export metadata ↓

Abstract

The goal of this milestone was to improve the high-order software ecosystem for CEED-enabled ECP applications by making progress on efficient matrix-free kernels targeting forthcoming ECP architectures. These kernels included matrix-free preconditioning and the development of new set of CEED solver bake-off problems. As part of this milestone, we also released the next version of the CEED software stack, CEED-4.0, reported on results from several application collaborations, and documented the efforts of porting to AMD GPUs for Frontier and other modern architectures, such as Fugaku. The specific tasks addressed in this milestone were: (1) Port and run CEED benchmarks/miniapps on Frontier EA systems; (2) Demonstrate performant libCEED integration in MFEM, Nek and applications; (3) Matrix-free preconditioning of high-order operators; (4) Benchmark problems for fast high-order solvers on GPU platforms; and (5) Public release of CEED-4.0. The artifacts delivered include the next version of the CEED software stack, CEED-4.0, the next libCEED release, libCEED-0.8, and a number of developments integrated within applications to improve their GPU and CPU performance and capabilities. See the CEED website, https://ceed.exascaleproject.org and the CEED GitHub organization, https://github.com/ceed for more details.

Explore related subjects

97 MATHEMATICS AND COMPUTING

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kolev, Tzanio, Fischer, Paul, Austin, Anthony P., Barker, Andrew T., Beams, Natalie, Brown, Jed, Camier, Jean-Sylvain, Chalmers, Noel, Dobrev, Veselin, Dudouit, Yohann, Ghaffari, Leila, Kerkemeir, Stefan, Lan, Yu-Hsiang, Merzari, Elia, Min, Misun, Pazner, Will, Rathnayake, Thilina, Shephard, Mark S., Siboni, Morteza H., Smith, Cameron W., Thompson, Jeremy L., Tomov, Stanimire, Warburton, Tim. 2021-03-31. High-order algorithmic developments and optimizations for large-scale GPU-accelerated simulations (Milestone CEED-MS36). https://doi.org/10.2172/1845639

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

DOE OSTI2026

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗