The core idea is deceptively simple. Instead of solving the partial differential equations that govern fluid flow, heat transfer, or atmospheric dynamics from scratch every time, a foundation model is trained on vast libraries of existing simulation data. Once trained, it can produce predictions in minutes that would otherwise demand days of number-crunching. The authors describe these systems as reusable base models: rather than starting over for each new application, scientists can adapt a pre-trained model to tasks such as inverse design—working backward from a desired outcome to find the parameters that produce it—or uncertainty quantification, without retraining from zero. The result is a workflow in which rapid, physics-informed optimization cycles become routine rather than exceptional.

The article is careful to position foundation models as complements rather than replacements for traditional simulation. The authors draw a direct line to older engineering practice: reduced-order and surrogate models, such as Reynolds-averaged approaches in fluid dynamics, have long been used to trade some physical fidelity for enormous gains in speed. Foundation models share that motivation but bring far greater expressive power, learning from large collections of simulation and experimental data using architectures like transformers and graph neural networks. The authors emphasize that these systems support high-throughput virtual experimentation and help researchers navigate design tradeoffs, while expert judgment and full-fidelity solvers remain essential anchors of the workflow.

The evidence for this approach spans multiple domains. In Earth system science, models such as DeepMind’s GraphCast and NVIDIA’s FourCastNet already use large spatiotemporal datasets to improve weather and climate prediction while providing actionable guidance to human forecasters. In materials science, models trained on crystal structure databases help researchers prioritize promising candidates for further study. Drug discovery efforts use similar techniques for protein structure prediction and molecular design. In fusion energy research, data-driven models assist physicists with plasma control and scenario planning in operational environments that are too complex for intuition alone. The common thread is that foundation models learn intricate physical and chemical relationships from diverse data, enabling rapid prediction across a broad range of physical domains.

One of the article’s most technically grounded sections concerns data management, an often-overlooked foundation of the entire enterprise. The authors argue that as foundation models scale to production on high-performance computing systems, the quality and organization of training data becomes the decisive factor in achieving both speed and generalization. Building high-quality datasets requires programmatic pipelines for collection, quality control, de-duplication, consistent labeling, and machine-readable provenance. They advocate moving beyond generic FAIR data principles toward a campaign-oriented governance model, in which simulation campaigns are recorded with standardized workflows and ontologies, and data curation is driven by impact metrics such as time-to-insight and downstream model quality rather than raw storage volume.

At exascale, the authors note, storing every high-order field produced by a simulation is simply infeasible, making compression a first-class design choice rather than an afterthought. Modern error-bounded lossy compression methods can dramatically reduce data footprints, but the authors insist that fidelity must be defined by physics-aware criteria—controlling errors in energy or gradients, for example—and by quantifying how compression perturbations affect downstream surrogates and emulators. Integrated in situ or in transit within the simulation pipeline, compression can even act as a learnable encoder, yielding compact features that minimize input-output and memory demands during pre-training and fine-tuning while maintaining strict error controls for diagnostics.

To make scientific data usable across domains, the authors propose a token-centric view of AI-readiness that mirrors how foundation models themselves process information. Descriptor tokens would capture meshes, coordinates, units, and provenance, while feature tokens represent compressed field content. Fusion mechanisms would bind these tokens across simulations, experiments, and modalities into coherent scientific narratives. Anchoring such tokens in community standards—netCDF-like schemas for Earth system modeling, for instance—would give model teams a stable, extensible interface to simulation data, creating a feedback loop from simulation to model training and back again.

On the architectural side, the article distinguishes between two main families of models suited to scientific simulation. For regular grids such as latitude-longitude climate meshes, Vision Transformer-style encoders use patch embeddings that align naturally with GPU tensor cores and batched input-output operations, facilitating large-scale spatial correlations with predictable memory layouts. For spherical or unstructured domains, graph neural networks encode locality and adjacency through message passing, preserving mesh topology without expensive remeshing. Temporal structure is typically handled by autoregressive or time-conditioned transformers, though the authors caution that long temporal windows significantly increase attention memory, communication overhead, and checkpoint sizes—all key bottlenecks on distributed supercomputing systems.

Two design principles run through the article’s architectural recommendations. First, physics-aware inductive biases—constraints that force models to respect invariants, conservation laws, and symmetries—improve data efficiency and reliability across different physical regimes. Second, token- and compute-adaptivity allows cost to scale with solution complexity rather than nominal grid size, using mechanisms such as windowed or hierarchical attention for long-range dependencies, sparsity and mixture-of-experts routing for conditional computation, and adaptive token pruning that focuses model capacity where dynamics are actually active. Linear or subquadratic attention variants further reduce the quadratic growth of standard self-attention, enabling extreme resolutions on modern accelerators.

The article also details concrete parallelization strategies drawn from ORBIT-class efforts at Oak Ridge, identifying four key levers for scaling Vision Transformer-based foundation models on supercomputers. Linear-complexity attention reduces self-attention cost from quadratic to linear, enabling multi-billion-token contexts at high resolution. Hybrid parallelization—combining tensor and model sharding with data parallelism—scales to models with over 100 billion parameters while controlling communication and memory overhead. Lightweight architectural efficiency improves hardware utilization without sacrificing accuracy, and domain specialization with robust uncertainty quantification maintains physical consistency in multi-variable predictions. The authors acknowledge that these techniques trade exact global attention for sparse routing and introduce modest auxiliary indices and buffers, and they stress that accuracy-cost impacts must be evaluated explicitly rather than assumed away.

Looking beyond transformers, the article highlights an emerging alternative: pairing diffusion-based generative models with state-space architectures such as Mamba to target linear-time complexity and lower GPU memory requirements. Mapping one-dimensional Mamba architectures to two- and three-dimensional scientific fields uses multi-directional and zigzag scanning patterns, while hybrid designs retain a small fraction of self-attention to preserve global coherence. These approaches reduce activation and key-value cache traffic, ease pressure on interconnects, and enable longer contexts on fixed high-bandwidth memory budgets—naturally improving the scalability of diffusion-based foundation models for probabilistic forecasting, ensemble generation, and uncertainty quantification in chaotic systems.

Performance on supercomputers, the authors observe, is often limited more by memory capacity, memory bandwidth, and collective communication than by raw floating-point throughput. Training costs for multi-channel two- and three-dimensional fields over long contexts are dominated by activation and key-value cache residency, optimizer state footprints, tensor layout conversions, and synchronization overhead. To address this, the article catalogs a battery of optimization techniques: fused attention kernels that reduce high-bandwidth memory movement, hybrid parallelism that shards parameters, gradients, and optimizer states across devices, key-value cache management strategies such as PagedAttention that improve batching efficiency during inference, and topology-aware placement combined with tensor fusion and overlapping collectives that convert theoretical peak performance into sustained throughput.

Cross-layer co-design emerges as a unifying theme. Sequence parallelism and tiling constrain activation footprints; activation checkpointing trades computation for memory; gradient accumulation increases effective batch size; and conditional computation through sparse activations and mixture-of-experts scales cost with solution complexity. Reliability receives particular attention: mixed and low-precision training requires careful gradient scaling and clipping for numerical stability, while deterministic kernels support fast recovery and reproducibility. HPC-native task-based runtimes such as PaRSEC orchestrate workflows as dependency graphs, overlapping collective communication with computation and prioritizing latency-critical inference alongside throughput-driven training.

The article closes with a discussion of trust, arguing that adoption ultimately depends on rigorous validation. The authors call for comparing foundation model outputs against traditional numerical solvers and observed data, quantifying uncertainty through ensembles or diffusion techniques, and enforcing physical constraints. They propose a standardized evaluation framework incorporating accuracy, efficiency, and trustworthiness metrics—mirroring the verification, physics consistency checks, and cross-solver benchmarking with confidence intervals already standard in numerical simulation—alongside a hardware-aware simulation platform for evaluating pipelines across computational architectures with pre-registered acceptance thresholds. Understanding the tradeoff between accuracy and computational time, they conclude, will let practitioners allocate resources effectively and make informed decisions about when foundation models can deliver swift, credible scientific insight on production supercomputers.

Subject of Research: Scalable foundation models for accelerating numerical simulations on high-performance computing platforms

Article Title: Scalable foundation models for numerical simulations on HPC platforms

Article References: Wang, D., Gong, Q., Liu, Z., Wang, X., Cao, Q., & Klasky, S. (2026). Scalable foundation models for numerical simulations on HPC platforms. Frontiers in High Performance Computing, 4, Article 1778471. https://doi.org/10.3389/fhpcp.2026.1778471

Image Credits: AI Generated

DOI: 10.3389/fhpcp.2026.1778471

Keywords: foundation models, high-performance computing, numerical simulation, exascale computing, Vision Transformer, graph neural networks, diffusion models, lossy compression, AI-ready data, uncertainty quantification, parallelization, scientific machine learning

The filter at the heart of the study is an extended Kalman filter, or EKF, the workhorse algorithm engineers use to estimate the state of a dynamic system from noisy measurements. The EKF works by linearizing the system’s motion model around the current estimate, predicting where the target should be, and then correcting that prediction with each new seeker measurement. For tracking problems with mild, well-behaved Gaussian noise, this recipe is remarkably effective. But real seeker data is rarely so cooperative. Glint effects, countermeasures, clutter, and abrupt target maneuvers all inject outliers—measurements that are wildly inconsistent with the statistical assumptions the filter relies on. A standard EKF treats every measurement as trustworthy, so a handful of bad readings can drag the state estimate far off course at precisely the moment accuracy matters most.

The researchers’ answer is to replace the filter’s least-squares cost function with the Huber cost function, a classic tool from robust statistics. The Huber function behaves like a quadratic for small residuals, where ordinary least squares is optimal, but switches to a linear penalty for large residuals. The practical consequence is that outlier measurements still influence the estimate, but their influence is capped rather than allowed to dominate. The resulting Huber-based extended Kalman filter, or HEKF, has been studied before in applications ranging from GPS navigation to spacecraft attitude estimation, and it consistently delivers more reliable estimates under non-Gaussian noise. The catch is computational: instead of a single closed-form update, the Huber formulation requires an iterative optimization loop that must converge on every filter cycle, multiplying the arithmetic workload by an order that embedded flight computers cannot easily absorb.

That bottleneck is what drove the team—Nayeon Kim, SeongJin Yoon, Heoncheol Lee of Kumoh National Institute of Technology, and Ikchan Lim, Changyeol Lee, and Jangseong Park of defense contractor LIGNEX1—toward hardware acceleration. Their target platform was an FPGA, a reconfigurable silicon chip whose logic fabric can be wired into custom digital circuits. Unlike a CPU, which executes instructions sequentially on a handful of cores, an FPGA can instantiate hundreds of arithmetic units that all operate in parallel, each one dedicated to a specific piece of the algorithm. For an iterative filter that must complete its entire predict-and-correct cycle within the tight timing budget of a seeker’s sampling rate, that architectural difference is decisive.

The centerpiece of the implementation is a custom intellectual property block, or IP core, built specifically to evaluate the Huber function and the iterative minimization it drives. Rather than letting a general-purpose processor grind through the optimization in software, the designers encoded the Huber computation directly into hardware datapaths, pipelined so that successive iterations and matrix operations overlap in time. The result is high-throughput, low-latency execution of the very step that makes the HEKF so expensive. In their evaluation, the Huber IP alone ran 6.79 times faster than the same computation on the processing system—the ARM-class CPU portion of the system-on-chip—while the complete HEKF, with the Huber core integrated into the filter pipeline, achieved an overall 3.71-fold acceleration.

Speed means little if accuracy collapses, so the team benchmarked the hardware implementation against the software version on denoising performance and estimation accuracy. The two proved comparable: the FPGA version preserved the robust filter’s ability to suppress measurement noise and track the line-of-sight rate through the nonlinear, outlier-ridden conditions that motivated the design in the first place. In other words, the researchers did not trade estimation quality for throughput; they simply removed the computational excuse for not using the more robust algorithm in real time. For guidance engineers, that is the crucial result, because it means the theoretically superior filter can finally be flown, not just simulated.

The work fits into a broader and rapidly accelerating trend of moving onboard aerospace algorithms from processors into reconfigurable hardware. Previous studies from overlapping research groups have parallelized particle filters and particle swarm optimization on FPGAs for ballistic target tracking, and accelerated convolutional neural network inference for routing in low-Earth-orbit satellite networks. GPU acceleration has been explored for related problems, including model predictive control in integrated missile guidance systems, but FPGAs hold particular appeal for flight hardware because they combine deterministic timing with low power consumption and resistance to the software overheads that plague general-purpose platforms. Comparisons of FPGA, CPU, GPU, and ASIC acceleration for neural network workloads have repeatedly highlighted the FPGA’s sweet spot: customizable parallelism without the fabrication cost of a fixed application-specific chip.

What makes the new study technically interesting is the marriage of robust estimation theory with register-transfer-level design. Kalman filtering on FPGAs is not new in itself—researchers have built hardware accelerators for EKF-based simultaneous localization and mapping, battery state estimation, and other applications—but the Huber variant introduces an iterative inner loop that resists naive parallelization. Each iteration depends on the previous one, so the designers must pipeline carefully, reusing hardware for matrix operations while keeping the convergence loop tight. The custom Huber IP solves this by treating the optimization as a dedicated hardware subroutine, effectively giving the filter a silicon-fast engine for the one part of the algorithm that software cannot execute quickly enough. The approach builds on the team’s earlier 2025 work on parallelized Huber-based EKF implementations, refining it into the present system-level evaluation.

The practical implications extend beyond missiles. Any platform that must estimate the state of a fast, maneuvering, poorly characterized target from noisy sensors faces the same trade-off between robustness and compute budget: drones tracking ground vehicles, radar systems following debris, autonomous vehicles fusing lidar returns, and spacecraft determining attitude in the presence of faulty star tracker readings. A hardware recipe that makes robust filtering affordable in real time is a template that transfers across those domains. The Korean work was funded by the Defense Acquisition Program Administration through the Korea Research Institute for Defense Technology Planning and Advancement, under a program developing design technology for an integrated guidance and control simulator incorporating weapon datalink and seeker systems—signaling that the intended path from laboratory FPGA board to operational guidance hardware is already mapped.

There remain, of course, the usual caveats of early hardware research. The reported speedups were measured against the processing system of the development platform, and further gains will depend on floating-point precision choices, clock rates, and how much of the remaining filter arithmetic migrates into custom logic. Certification of reconfigurable hardware for safety-critical flight systems carries its own regulatory burden. But the direction of travel is unmistakable. As seekers grow more capable and targets grow faster, the algorithms that keep interceptors on course are becoming too computationally demanding for conventional processors alone. By proving that a robust, outlier-resistant Kalman filter can run in hardware at full seeker speed—3.71 times faster than before, with accuracy intact—this study offers a concrete glimpse of where real-time guidance computing is headed: away from software loops and into the fabric of the chip itself.

Subject of Research: FPGA hardware acceleration of a Huber-based extended Kalman filter for robust real-time line-of-sight target tracking

Article Title: FPGA Implementation of Huber-Based Extended Kalman Filter for Real-Time High-Speed Target Tracking

Article References: Kim, N., Yoon, S., Lee, H., Lim, I., Lee, C., & Park, J. (2026). FPGA Implementation of Huber-Based Extended Kalman Filter for Real-Time High-Speed Target Tracking. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01216-5

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01216-5

Keywords: FPGA, extended Kalman filter, Huber function, target tracking, missile guidance, line-of-sight rate, hardware acceleration, robust estimation, embedded systems, parallelization, seeker, real-time computing