SEARCH · Engineering Papers

Results for “fast Fourier transform (FFT)”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Enhancing photoionization rate calculations in low-temperature plasmas using spectral methods

Photoionization plays a central role in the development of streamer discharges and other non-equilibrium plasma phenomena. It creates seed electrons, which are essential for positive streamer propagation, allowing the ionization front to move forward. Because of this, accurate modeling of photoionization is very important for predicting streamer behavior and plasma evolution. The photoionization process in air (N 2 – O 2 mixture) is often described by the Zheleznyak model (1982). This model is usually solved through Helmholtz-type equations that approximate the Zheleznyak photoionization model (Zheleznyak et al. 1982) as Partial Differential Equations (PDEs). Conventional numerical methods, such as the Finite Difference Method (FDM) or Finite Volume Method (FVM), are widely used to solve these equations. Although they are prevalent, the computational cost of these methods due to their need for matrix operations and iterative solver is demanding. To address this challenge, this work develops a spectral solver based on the Fast Fourier Transform (FFT) combined with Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) to calculate the photoionization rate efficiently in an axisymmetric cylindrical domain. This method naturally satisfies the boundary conditions used in the model and converts the PDE into algebraic ones in spectral space. Thus, avoids the need for iterative matrix solvers. When compared with FDM results, it is demonstrated that the new solver not only maintains accuracy, but also reduces the computational cost, showing a performance increase of approximately 100 compared to FDM over a wide range of problem sizes. The method is parallelized using Message Passing Interface (MPI) and has been integrated into a fluid plasma model for streamer simulation. Here, this FFT-based approach provides a fast and reliable alternative for calculating photoionization in fluid models, helping large-scale plasma simulations run faster and efficiently, and allows higher-resolution simulation without extra computational cost.

Axisymmetric system↗

DOE OSTI2025

Weighted FFT estimators for 1D and 3D correlations of the Lyman- α forest

Correlations in the Lyman-α (Lyα) forest, both as a function of line of sight separation (1D) and 3D separation, provide a unique window to the distribution of matter at redshifts not accessible by current galaxy surveys. While optimal quadratic estimators have been used to measure 1D correlations, they are computationally expensive and difficult to extend to 3D analyses. On the other hand, estimators based on the Fast Fourier Transform (FFT) are significantly faster, but are affected by missing data in the spectra (masked pixels) and so far have not used pixel weights to reduce the uncertainties in the measurement. In this publication we describe how to compute the window matrix that enables forward-modelling the impact of masked pixels and weights on the FFT-based estimators. Here, we use Gaussian and hydrodynamical simulations with artificially masked pixels to validate the method on the measurement of 1D correlations. Finally, we show that the formalism can be extended to model the impact on 3D correlations, in particular on the cross-spectrum, the correlation of 1D Fourier modes as a function of transverse separation. This work will enable more precise clustering measurements with the Lyα forest dataset recently collected by the Dark Energy Spectroscopic Instrument (DESI).

Lokken, Martine [Univ. Autonoma de Barcelona (Spai↗

DOE OSTI2024

A FFT-based mesoscale continuum dislocation mechanics with defect energy: Applications to composites and polycrystals

A crystal plasticity elastoviscoplastic FFT (fast Fourier transform) formulation with a mesoscale continuum field dislocation mechanics model is presented, which incorporates a defect energy density that depends on GND densities and an associated material length scale. This allows to thermodynamically derive internal length scale dependent intra-crystalline backstress and Peach–Koehler force acting on GND densities. The model considers GND density evolution through a filtered numerical spectral approach, which is coupled with stress equilibrium through the elastoviscoplastic FFT algorithm. The discrete Fourier transform (DFT) method together with finite difference (FD) schemes is applied to solve both the backstress tensor and the Fourier–Green operator. Numerical results are first reported for two-phase laminate composites with plastic single crystal channels and elastic precipitates for shear loadings. Channel size effects are simulated and analyzed on the overall and local hardening behaviors during monotonous loadings. In addition, the evolutions of GND densities and the role of their associated backstress on size effects are examined during reversible shear loading. In a second part, the role of the defect energy internal length scale on polycrystal’s hardening during tension–compression is discussed. The results are compared to those obtained using FFT-based continuum field dislocation mechanics without defect energy.

36 MATERIALS SCIENCE↗

NASA NTRS1994

The Block V Receiver fast acquisition algorithm for the Galileo S-band mission

A fast acquisition algorithm for the Galileo suppressed carrier, subcarrier, and data symbol signals under low data rate, signal-to-noise ratio (SNR) and high carrier phase-noise conditions has been developed. The algorithm employs a two-arm fast Fourier transform (FFT) method utilizing both the in-phase and quadrature-phase channels of the carrier. The use of both channels results in an improved SNR in the FFT acquisition, enabling the use of a shorter FFT period over which the carrier instability is expected to be less significant. The use of a two-arm FFT also enables subcarrier and symbol acquisition before carrier acquisition. With the subcarrier and symbol loops locked first, the carrier can be acquired from an even shorter FFT period. Two-arm tracking loops are employed to lock the subcarrier and symbol loops parameter modification to achieve the final (high) loop SNR in the shortest time possible. The fast acquisition algorithm is implemented in the Block V Receiver (BVR). This article describes the complete algorithm design, the extensive computer simulation work done for verification of the design and the analysis, implementation issues in the BVR, and the acquisition times of the algorithm. In the expected case of the Galileo spacecraft at Jupiter orbit insertion PD/No equals 14.6 dB-Hz, R(sym) equals 16 symbols per sec, and the predicted acquisition time of the algorithm (to attain a 0.2-dB degradation from each loop to the output symbol SNR) is 38 sec.

Aung, M.↗

DOE OSTI2023

Ameliorating the Courant-Friedrichs-Lewy condition in spherical coordinates: A double FFT filter method for general relativistic MHD in dynamical spacetimes

Numerical simulations of merging compact objects and their remnants form the theoretical foundation for gravitational wave and multimessenger astronomy. While Cartesian-coordinate-based adaptive mesh refinement is commonly used for simulations, spherical-like coordinates are more suitable for nearly spherical remnants and azimuthal flows due to lower numerical dissipation in the evolution of fluid angular momentum, as well as requiring fewer numbers of computational cells. However, the use of spherical coordinates to numerically solve hyperbolic partial differential equations can result in severe Courant-Friedrichs-Lewy (CFL) stability condition time step limitations, which can make simulations prohibitively expensive. This paper addresses this issue for the numerical solution of coupled spacetime and general relativistic magnetohydrodynamics evolutions by introducing a double fast Fourier transform (FFT) filter and implementing it within the fully message passing interface (mpi)-parallelized sphericalnr framework in the einstein toolkit. In conclusion, we demonstrate the effectiveness and robustness of the filtering algorithm by applying it to a number of challenging code tests, and show that it passes these tests effectively, demonstrating convergence while also increasing the time step significantly compared to unfiltered simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Welch Method and Bootstrapping Applied to Subcritical Gamma Noise

We measured the prompt neutron decay constant 𝛼 of the CROCUS zero-power reactor at the Swiss Federal Institute of Technology Lausanne using cross-power spectral density (CPSD) analysis of gamma-gamma correlations from two trans-stilbene organic scintillators positioned near the reactor core. We measured critical and subcritical states, with water levels ranging from 960 mm (critical) to 800 mm (𝜌=−1.4 $ subcritical). Our analysis used the Welch method, dividing signal segments for fast Fourier transform (FFT) frequency analysis and applying bootstrapping uncertainty quantification that uses Welch-defined segments. Results demonstrated a clear increase in the measured 𝛼 as reactor reactivity decreased, distinguishing critical from subcritical conditions. At the 960-mm critical level, 𝛼 was estimated at 155.9 ± 0.7 s −1 , and for the 800-mm subcritical level, 𝛼 increased significantly to 367.3 ± 6.9 s –1 . A linear regression of subcritical states yielded a critical estimate of 154.0 ± 3.1 s –1 , aligning with the static 𝛼 estimate at critical. The bootstrapping method produced normally distributed 𝛼 estimates, confirming data consistency. The gamma CPSD 𝛼 estimates clearly distinguish reactor states and improve monitoring of zero-power reactors. The future deployment of modular and microreactors as potential candidates for noise analysis is demonstrated in CROCUS, particularly zero-power mock-ups of new designs. The improvement of noise analysis in the subcritical domain from this work will support experimental data for reactor deployment and procedure.

CROCUS↗

DOE OSTI2024

GPU-enabled extreme-scale turbulence simulations: Fourier pseudo-spectral algorithms at the exascale using OpenMP offloading

Fourier pseudo-spectral methods for nonlinear partial differential equations are of wide interest in many areas of advanced computational science, including direct numerical simulation of three-dimensional (3-D) turbulence governed by the Navier-Stokes equations in fluid dynamics. This paper presents a new capability for simulating turbulence at a new record resolution up to 35 trillion grid points, on the world's first exascale computer, Frontier, comprising AMD MI250x GPUs with HPE's Slingshot interconnect and operated by the US Department of Energy's Oak Ridge Leadership Computing Facility (OLCF). Key programming strategies designed to take maximum advantage of the machine architecture involve performing almost all computations on the GPU which has the same memory capacity as the CPU, performing all-to-all communication among sets of parallel processes directly on the GPU, and targeting GPUs efficiently using OpenMP offloading for intensive number-crunching including 1-D Fast Fourier Transforms (FFT) performed using AMD ROCm library calls. With 99% of computing power on Frontier being on the GPU, leaving the CPU idle leads to a net performance gain via avoiding the overhead of data movement between host and device except when needed for some I/O purposes. Memory footprint including the size of communication buffers for MPI_ALLTOALL is managed carefully to maximize the largest problem size possible for a given node count. Detailed performance data including separate contributions from different categories of operations to the elapsed wall time per step are reported for five grid resolutions, from 2048 3 on a single node to 32768 3 on 4096 or 8192 nodes out of 9408 on the system. Both 1D and 2D domain decompositions which divide a 3D periodic domain into slabs and pencils respectively are implemented. The present code suite (labeled by the acronym GESTS, GPUs for Extreme Scale Turbulence Simulations) achieves a figure of merit (in grid points per second) exceeding goals set in the Center for Accelerated Application Readiness (CAAR) program for Frontier. The performance attained is highly favorable in both weak scaling and strong scaling, with notable departures only for 2048 3 where communication is entirely intra-node, and for 32768 3 , where a challenge due to small message sizes does arise. Communication performance is addressed further using a lightweight test code that performs all-to-all communication in a manner matching the full turbulence simulation code. Performance at large problem sizes is affected by both small message size due to high node counts as well as dragonfly network topology features on the machine, but is consistent with official expectations of sustained performance on Frontier. Overall, although not perfect, the scalability achieved at the extreme problem size of 32768 3 (and up to 8192 nodes — which corresponds to hardware rated at just under 1 exaflop/sec of theoretical peak computational performance) is arguably better than the scalability observed using prior state-of-the-art algorithms on Frontier's predecessor machine (Summit) at OLCF. New science results for the study of intermittency in turbulence enabled by this code and its extensions are to be reported separately in the near future.

3D fast Fourier transform↗

DOE OSTI2023

Studying performance portability of LAMMPS across diverse GPU-based platforms

The molecular dynamics simulation software, LAMMPS, utilizes the Kokkos acceleration library to port computation to a diverse set of architectures including those based on GPU accelerators. In addition to Kokkos, LAMMPS contains a vast code base that leverages the CUDA application programming interface using library functions such as cuFFT, CUDA's fast-fourier transform (FFT) library, and, more recently, also support for AMD's Heterogeneous Interface for Portability (HIP) that is rapidly growing. While preparing LAMMPS tests for the AMD GPU-based test system precursors to Frontier, we investigated several strategies for accelerating LAMMPS on AMD GPUs, using the AMD Instinct MI100 and MI250X. In this work, we integrated the HIP FFT library, hipFFT, into the particle-particle particle-mesh (PPPM) long-range solver, which allowed the porting of PPPM calculations to the GPUs. Kokkos behavior on the MI100 and MI250X was also investigated through the package kokkos command of LAMMPS, targeting communication, memory usage, and particle grid decomposition. The Tersoff, Reax, Lennard-Jones (LJ), EAM, Granular, and PPPM potentials were investigated in this effort, and results from these experiments are provided. In conclusion, the selected potentials were run on Spock (AMD Instinct MI100), Crusher (AMD Instinct MI250X), AFW HPC11 (NVIDIA A100) and Summit (NVIDIA V100), for comparison. Operational roofline models were constructed and analyzed for the Tersoff, Reax, and Lennard–Jones potentials on Crusher and Summit.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗

DOE OSTI2024

Chatter detection in simulated machining data: a simple refined approach to vibration data

Vibration monitoring is a critical aspect of assessing the health and performance of machinery and industrial processes. This study explores the application of machine learning techniques, specifically the Random Forest (RF) classification model, to predict and classify chatter—a detrimental self-excited vibration phenomenon—during machining operations. While sophisticated methods have been employed to address chatter, this research investigates the efficacy of a novel approach to an RF model. The study leverages simulated vibration data, bypassing resource-intensive real-world data collection, to develop a versatile chatter detection model applicable across diverse machining configurations. The feature extraction process combines time-series features and Fast Fourier Transform (FFT) data features, streamlining the model while addressing challenges posed by feature selection. By focusing on the RF model’s simplicity and efficiency, this research advances chatter detection techniques, offering a practical tool with improved generalizability, computational efficiency, and ease of interpretation. The study demonstrates that innovation can reside in simplicity, opening avenues for wider applicability and accelerated progress in the machining industry.

42 ENGINEERING↗

DOE OSTI2025

Multi-modal characterization of the B2 phase in the Ta-Re binary system

The energy and transportation industries demand materials that retain their mechanical property at high temperatures. Refractory complex concentrated alloys (RCCAs) with a BCC + B2 microstructure offer a potential solution, where maintaining the high temperature mechanical properties can be achieved by precipitation strengthening. This depends on the B2 phase in RCCAs being thermodynamically stable with a high solvus temperature. Recently, we predicted the high temperature stability of the B2 structure in the Ta-Re binary system, using density functional theory. Here, in this study, we provide experimental evidence for the existence of this phase for the first time, using a Ta 65 Re 35 alloy. Despite Ta-Re binary phase diagrams predicting a single-phase BCC microstructure for Ta 65 Re 35 , we show that a high Z nanoscale secondary phase appears after heat treatment at 1550 °C and 1100 °C. Scanning transmission electron microscopy (STEM) revealed that this phase has a cubic structure and is equiatomic TaRe though B2 superlattice reflections were absent in fast Fourier transforms (FFT) and diffraction patterns (DPs). DP simulations indicate that the B2 TaRe superlattice reflections are up to two orders of magnitude weaker than their fundamental reflections, making their detection challenging via electron microscopy. Neutron diffraction confirmed the second phase had a B2 structure. This study identified a previously unobserved high temperature stable B2 phase in the Ta-Re system, enabling the development of new high temperature BCC + B2 RCCAs.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Online data-enabled predictive control

We develop an online data-enabled predictive (ODeePC) control method for optimal control of unknown systems, building on the recently proposed DeePC (Coulson et al., 2019). Our proposed ODeePC method leverages a primal-dual algorithm with real-time measurement feedback to iteratively compute the corresponding real-time optimal control policy as system conditions change. The proposed ODeePC conceptual-wise resembles standard adaptive system identification and model predictive control (MPC), but it provides a new alternative for the standard methods. ODeePC is enabled by computationally efficient methods that exploit the special structure of the Hankel matrices in the context of DeePC with Fast Fourier Transform (FFT) and primal-dual algorithm We provide theoretical guarantees regarding the asymptotic behavior of ODeePC, and we demonstrate its performance through numerical examples.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Evaluation of nature and intensity of fire concrete spalling by frequency analysis of sound records

Highlights: • Original sound-based NDT method to assess the spalling form and intensity within the time of the test is proposed. • Frequency analysis of recorded sound provides a quantitative and qualitative assessment of concrete propensity to spalling. • Nature of fire concrete spalling can be categorized by a well-defined frequency value. • Waveform and spectrogram analysis delivers information on the exact number of spalling events within the performed test. The paper presents a new method for identifying the form and intensity of spalling using an analysis of the acoustic signal emitted by concrete. To assess the intensity and monitor the course of concrete spalling during fire exposure, the analysis of the recorded sound from the furnace chamber is used. The spalling intensity was determined based on signal amplitude analysis. Investigation of sound records showed that the character of spalling can be categorized by a well-defined frequency value. Based on the analysis of the Fast Fourier Transform (FFT) spectrum, the authors have distinguished the following phenomena that are the source of the signal by assigning the corresponding frequency of the sound wave vibration: explosive spalling, aggregate spalling and destructive spalling.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Effect of non-uniform void distributions on the yielding of metals

High-throughput (several thousand) calculations have been carried out to investigate the yield behavior of porous materials with randomly distributed pores, porosity levels over four orders of magnitude and up to a hundred pores per simulation box. To this end, a Galerkin based fast Fourier transform (FFT) formulation was enhanced to deal with high phase contrast materials. In addition, GPU parallelization was employed in solving the governing equation for strain fluctuations using a Krylov iterative solver. Emphasis is laid on the conditions under which percolation of plastically non-deforming zones through the porous network emerge, a regime termed unhomogeneous yielding. By way of contrast, the regime where the plastic strain fluctuations (associated with the heterogeneous void-matrix aggregate) fall below the percolation threshold is defined as homogeneous yielding. Here, we find that nonuniform pore distributions only affect unhomogeneous yielding and have a universal softening effect. The extent of this distribution softening is analyzed as a function of porosity, cell size and number of realizations. Whether the uncovered universal distribution softening has direct implications on failure resistance of porous materials is discussed.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

DOE OSTI2021

Effect of neighboring grain orientation on strain localization in slip bands in HCP materials

Particularly in plastically anisotropic crystals, such as hexagonal close packed (HCP) materials, plastic deformation is realized by slip acting in the small volumes within individual crystals. Here we extend a full field fast Fourier transform (FFT)-based elasto-viscoplastic formulation to simulate the development of a single slip band on either prismatic or basal planes spanning a crystal. Calculations of the strain and stress fields induced locally within the band and parent crystal, and ahead of the band/grain boundary junction in the neighboring crystal are analyzed as the slip band intensifies under increasing applied strain. We report a substantial influence of the crystallographic orientation of the nearest neighboring grain on the rate of slip band localization. Performing the analysis on two materials, CP-Ti and Mg, indicates that the strength of the material affects the rate of localization, with stronger materials tending to localize more easily. A slip band tip stress-based criterion is proposed for identifying the nearest neighbor orientations in which slip band transmission is possible and the likely slip system for which it occurs. This indicator is validated against experimental studies on commercially pure Ti, an Mg–Y alloy, and Ti–6Al–4V. Finally, we show that for low GB misorientations, the slip band is likely to transmit into another slip band of the same type in the neighbor grain, while for high GB misorientations, it is likely to transmit into one of a different type or to not transmit at all.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Implementation of a Mesh refinement algorithm into the quasi-static PIC code QuickPIC

Plasma-based acceleration (PBA) has emerged as a promising candidate for the accelerator technology used to build a future linear collider and/or an advanced light source. In PBA, a trailing or witness particle beam is accelerated in the plasma wave wakefield (WF) created by a laser or particle beam driver. The WF is often nonlinear and involves the crossing of plasma particle trajectories in real space and thus particle-in-cell methods are used. The distance over which the drive beam evolves is several orders of magnitude larger than the wake wavelength. This large disparity in length scales is amenable to the quasi-static approach. Three-dimensional (3D), quasi-static (QS), particle-in-cell (PIC) codes, e.g., QuickPIC, have been shown to provide high fidelity simulation capability with 2-4 orders of magnitude speedup over 3D fully explicit PIC codes. In PBA, the witness beam needs to be matched to the focusing forces of the WF to reduce the emittance growth. In some linear collider designs, the matched spot size of the witness beam can be 2 to 3 orders of magnitude smaller than the spot size (and wavelength) of the wakefield. Such an additional disparity in length scales is ideal for mesh refinement where the WF within the witness beam is described on a finer mesh than the rest of the WF. A mesh refinement scheme is described that has been implemented into the 3D QS PIC code, QuickPIC. Very fine (high) resolution is used in a small spatial region that includes the witness beam and progressively coarser resolutions in the rest of the simulation domain. A fast multigrid Poisson solver has been implemented for the field solve on the refined meshes and a Fast Fourier Transform (FFT) based Poisson solver is used for the coarse mesh. The code has been parallelized with both MPI and OpenMP, and the parallel scalability has also been improved by using pipelining. A preliminary adaptive mesh refinement technique is described to optimize the computational time for simulations with an evolving witness beam size. Several test problems are used to verify that the mesh refinement algorithm provides accurate results. Additionally, the results are benchmarked against highly resolved simulations exhibiting near-azimuthal symmetry, performed using QPAD—a novel hybrid QS PIC code that uses a PIC description in the coordinates (r, ct – z) and a gridless description in the azimuthal angle, Φ.

Linear collider↗

DOE OSTI2022

Study of the interplay between lower-order and higher-order energetic strain-gradient effects in polycrystal plasticity

in this report strain-gradient (SG) plasticity refers to a class of non-local theories in which gradients of plastic slip determine the storage of geometrically necessary dislocations, introducing a length-scale dependence in the mechanical behavior of crystalline materials, which is otherwise lacking in local theories. In this work, we incorporate lower-order (LO) and higher-order energetic (HOE) strain-gradient effects into a crystal plasticity fast Fourier transform (FFT)-based formulation to investigate the interplay of the length scale that each strain-gradient term introduces at the microscale, and the mechanical properties that result at the macroscale. For an applicable range of length scales, we consider two systems: a 1-D two-phase face centered cubic (FCC) laminate and a 3-D FCC polycrystal, and two uniaxial deformation modes: monotonic tension and cyclic tension–compression. We show that increases in the individual LO and HOE length scales increase the hardening rate and strength of the material, respectively. When combined, the strong LO hardening is less pronounced than the effect alone due to the lowering of the gradients due to the HOE microstress. We demonstrate that the LO and HOE hardening manifest as “isotropic” (yield surface expansion) and “kinematic” (yield surface shift) effects, respectively, consistent with their theoretical origins. We show that in cyclic loading, the Bauschinger effect emerges in both local and non-local calculations and link its origins and severity to the behavior in the strain field, slip-system rates, and the HOE microforce.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Fast GPU 3D diffeomorphic image registration

3D image registration is one of the most fundamental and computationally expensive operations in medical image analysis. Here, we present a mixed-precision, Gauss–Newton–Krylov solver for diffeomorphic registration of two images. Our work extends the publicly available CLAIRE library to GPU architectures. Despite the importance of image registration, only a few implementations of large deformation diffeomorphic registration packages support GPUs. Our contributions are new algorithms to significantly reduce the run time of the two main computational kernels in CLAIRE: calculation of derivatives and scattered-data interpolation. Additionally, we deploy (i) highly-optimized, mixed-precision GPU-kernels for the evaluation of scattered-data interpolation, (ii) replace Fast-Fourier-Transform (FFT)-based first-order derivatives with optimized 8th-order finite differences, and (iii) compare with state-of-the-art CPU and GPU implementations. As a highlight, we demonstrate that we can register clinical images in less than 6 s on a single NVIDIA Tesla V100. This amounts to over 20 speed-up over the current version of CLAIRE and over 30 speed-up over existing GPU implementations.

97 MATHEMATICS AND COMPUTING↗