Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “scalable performance”

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.

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

At least 1,459 records · Page 81

Benchmarking quantum trial wavefunctions for phaseless auxiliary-field quantum Monte Carlo

The phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) method is a stochastic imaginary-time projection technique for computing ground-state properties of strongly correlated quantum systems, with accuracy that depends critically on the choice of trial wavefunction. Here, we investigate ph-AFQMC with trial states prepared using parameterized quantum circuits. In this work, we present a comprehensive benchmarking study of quantum trial wavefunctions spanning unitary coupled-cluster, Hamiltonian-informed, Jastrow-inspired, and adaptively constructed ansatze. The benchmarking evaluates accuracy, expressibility, and scalability of these ansatze within the QC-AFQMC framework. We test these ansatze on linear hydrogen chains under bond stretching and find that several ansatz families produce chemically accurate ph-AFQMC energies across the dissociation curve. We have performed simulations using the CUDA-Q quantum development platform on the GPU partition of the Perlmutter supercomputer. When comparing ansatze at similar numbers of variational parameters, we find that different ansatz families yield comparable ph-AFQMC results despite exhibiting substantially different variational energies, optimization costs, and circuit depths. Our results indicate that the variational energy of an ansatz is not always a reliable indicator of its quality for ph-AFQMC and reveal instances of over-parameterization. In the strongly correlated regime, trial wavefunctions obtained from adaptive ansatze, exemplified here by ADAPT-VQE with the UCCSD operator pool, can outperform their fixed-ansatz counterparts (UCCSD) in terms of projected energies while using substantially more compact circuits, providing a flexible route to optimize quantum resources within the ph-AFQMC framework.

Rofougaran, Rod [LBNL, Berkeley; Columbia U.; PNL,↗

Scalable Deep Learning-Based Microarchitecture Simulation on GPUs

Cycle-accurate microarchitecture simulators are essential tools for designers to architect, estimate, optimize, and manufacture new processors that meet specific design expectations. However, conventional simulators based on discrete-event methods often require an exceedingly long time-to-solution for the simulation of applications and architectures at full complexity and scale. Given the excitement around wielding the machine learning (ML) hammer to tackle various architecture problems, there have been attempts to employ ML to perform architecture simulations, such as Ithemal and SimNet. However, the direct application of existing ML approaches to architecture simulation may be even slower due to overwhelming memory traffic and stringent sequential computation logic. This work proposes the first graphics processing unit (GPU)-based microarchitecture simulator that fully unleashes the potential of GPUs to accelerate state-of-the-art ML-based simulators. First, considering the application traces are loaded from central processing unit (CPU) to GPU for simulation, we introduce various designs to reduce the data movement cost between CPUs and GPUs. Second, we propose a parallel simulation paradigm that partitions the application trace into sub-traces to simulate them in parallel with rigorous error analysis and effective error correction mechanisms. Combined, this scalable GPU-based simulator outperforms by orders of magnitude the traditional CPU-based simulators and the state-of-the-art ML-based simulators, i.e., SimNet and Ithemal.

97 MATHEMATICS AND COMPUTING↗

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗

Surface reaction for efficient and stable inverted perovskite solar cells

We report perovskite solar cells (PSCs) with an inverted structure (often referred to as the p-i-n architecture) are attractive for future commercialization due to their easily scalable fabrication, reliable operation, and compatibility with a wide range of perovskite-based tandem device architectures. However, the power conversion efficiency (PCE) of p-i-n PSCs falls behind n-i-p (or normal) structure counterparts. This large performance gap could undermine efforts to adopt p-i-n architectures, despite their other advantages. Given the remarkable advances in perovskite bulk materials optimization over the past decade, interface engineering has become the most important strategy to push PSC performance to its limit. Here, we report a reactive surface engineering approach based on a simple post-growth treatment of 3-(Aminomethyl)pyridine (3-APy) on top of a perovskite thin film. First, the 3-APy molecule selectively reacts with surface FA+, reducing perovskite surface roughness and surface potential fluctuations associated with surface steps/terraces. Second, the reaction product on the perovskite surface decreases the formation energy of charged iodine-vacancies, leading to effective n-type doping with a reduced work function in the surface region. With this reactive surface engineering, the resulting p-i-n PSCs obtained a PCE over 25%, along with retaining 87% of the initial PCE after over 2400 h of one-sun operation at about 55 degrees C in air.

14 SOLAR ENERGY↗

Distributed Control and Optimization of Virtual Inertia in Power Systems

The integration of renewable energy sources into power grids through inverter-based resources (IBRs) reduces system inertia, leading to faster frequency dynamics and potential grid instability. This paper proposes a distributed, consensus-based approach for the real-time control and optimization of inertia sources during system disturbances, enhancing both system stability and economic performance. Furthermore, we integrate this approach with the traditional inertia placement problem, demonstrating its suitability for existing frameworks. We validate its effectiveness in a 4-bus test system and a two-area 8-bus test system, showcasing its potential for scalable, dynamic inertia management in low-inertia grids.

Yadav, Ajay [ORNL] (ORCID:000000016111881X)↗

Versatile & Intelligent Biodetection via Environmental Sensing (VIBES)

Reactive health monitoring strategies during events like the COVID-19 pandemic highlighted the need for predictive, threat-agnostic diagnostics that can detect both known diseases and novel chemical or biological threats. To address this, we investigated an optical biosensor as a breath volatile organic compound (VOC) analyzer, aiming to emulate biological olfaction. We assembled and validated the device with thin film metal coated substrate-based sensors. We immobilized small biological recognition elements on the substrates and delivered controlled concentrations of target VOCs. The sensor was irradiated with a visible laser and the sensor signal was recorded. We characterized the laser performance and tested 3 recognition elements for 2 VOCs with varying concentrations (1-100 ppm). We also evaluated enhancement of the signal using nanostructures on the metal film in comparison with planar film substrate. We demonstrated detecting ethanol reliably at concentrations as low as ~2 ppm along with preliminary detection of acetone (<100 ppm). We also found several unexpected factors that influence the sensor behavior that should be addressed to further refine the device’s performance. The nanostructures were, as expected, found to amplify the sensor signals. These findings demonstrate the feasibility of the optical bio-sensing modality for breath VOC monitoring at physiologically relevant levels. This positions LLNL to develop a low-cost, scalable, broad-spectrum health monitoring capability aligned with the Early Detection thrust of the Bioresilience Mission Focus Area and attract external funding.

47 OTHER INSTRUMENTATION↗

Validation of a Scalable Solar Sailcraft

The NASA In-Space Propulsion (ISP) program sponsored intensive solar sail technology and systems design, development, and hardware demonstration activities over the past 3 years. Efforts to validate a scalable solar sail system by functional demonstration in relevant environments, together with test-analysis correlation activities on a scalable solar sail system have recently been successfully completed. A review of the program, with descriptions of the design, results of testing, and analytical model validations of component and assembly functional, strength, stiffness, shape, and dynamic behavior are discussed. The scaled performance of the validated system is projected to demonstrate the applicability to flight demonstration and important NASA road-map missions.

Murphy, D. M.↗

Development and Application of Schema Based Occupant-Centric Building Performance Metrics

Occupant behavior can significantly influence the operation and performance of buildings. Many occupant-centric key performance indicators (KPIs) rely on having accurate counts of the number of occupants in a building, which is very different to how occupancy information is currently collected in the majority of buildings today. To address this gap, the authors develop a standardized methodology for the calculation of percent space utilization for buildings, which is formulated with respect to two prevalent operational data schemas: the Brick Schema and Project Haystack. The methodology is scalable across different levels of spatial granularity and irrespective of sensor placement. Moreover, the methods are intended to make use of typical occupancy sensors that capture presence level occupancy and not counts of people. Since occupant-hours is a preferable metric to use in KPI calculations, a method to convert between percent space utilization and occupant-hours using the design occupancy for a space is also developed. The methodology is demonstrated on a small commercial office space in Boulder, Colorado using data collected between June 2018 and February 2019. A multiple linear regression is performed that shows strong evidence for a relationship between building energy consumption and percent space utilization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Traffic Signal Optimization by Integrating Reinforcement Learning and Digital Twins

Machine learning (ML) methods, especially reinforcement learning (RL), have been widely considered for traffic signal optimization in intelligent transportation systems. Most of these ML methods are centralized, lacking in scalability and adaptability in large traffic networks. Further, it is challenging to train such ML models due to the lack of training platforms and/or the cost of deploying and training in a real traffic networks. This paper presents an approach for the integration of decentralized graph-based multi-agent reinforcement learning (DGMARL) with a Digital Twin (DT) to optimize traffic signals for the reduction of traffic congestion and network-wide fuel consumption related to stopping. Specifically, the DGMARL agents learn traffic state patterns and make decisions regarding traffic signal control with assistance from a Digital Twin module, which simulates and replicates the traffic behaviors of a real traffic network. The proposed approach was evaluated using PTV-Vissim [1], a microscopic traffic simulation platform. PTV-Vissim is also the simulation engine of the DT, enabling emulation and optimization of the traffic signals on the MLK Smart Corridor in Chattanooga, Tennessee. Compared to an actuated signal control baseline approach, experiment results show that Eco_PI, a developed performance measure capturing the impact of stops on fuel consumption, was reduced by 44.27% in a 24-hour and an average of 29.88% in a PM-peak-hour scenario.

Multi-Agent Reinforcement Learning, Digital Twin, ↗

Precision Tomography of a Three-Qubit Donor Quantum Processor in Silicon

Nuclear spins were among the first physical platforms to be considered for quantum information processing, because of their exceptional quantum coherence and atomic-scale footprint. However, their full potential for quantum computing has not yet been realized, owing to the lack of methods with which to link nuclear qubits within a scalable device combined with multi-qubit operations with sufficient fidelity to sustain fault-tolerant quantum computation. Here we demonstrate universal quantum logic operations using a pair of ion-implanted 31 P donor nuclei in a silicon nanoelectronic device. A nuclear two-qubit controlled-Z gate is obtained by imparting a geometric phase to a shared electron spin, and used to prepare entangled Bell states with fidelities up to 94.2(2.7)%. The quantum operations are precisely characterized using gate set tomography (GST), yielding one-qubit average gate fidelities up to 99.95(2)%, two-qubit average gate fidelity of 99.37(11)% and two-qubit preparation/measurement fidelities of 98.95(4)%. These three metrics indicate that nuclear spins in silicon are approaching the performance demanded in fault-tolerant quantum processors. We then demonstrate entanglement between the two nuclei and the shared electron by producing a Greenberger-Horne-Zeilinger three-qubit state with 92.5(1.0)% fidelity. Because electron spin qubits in semiconductors can be further coupled to other electrons or physically shuttled across different locations, these results establish a viable route for scalable quantum information processing using donor nuclear and electron spins.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scalable Hyperpolarized MRI Enabled by Ace‐SABRE of [1‐ 13 C]Pyruvate

Abstract Hyperpolarized (HP) MRI using [1– 13 C]pyruvate is emerging as a promising molecular imaging approach. Among hyperpolarization methods, Signal Amplification By Reversible Exchange (SABRE) is attractive because SABRE polarizes the substrates directly in room‐temperature solutions avoiding complex hardware. Most SABRE experiments have historically been performed in methanol, a relatively toxic and difficult‐to‐remove solvent. Here we demonstrate the use of a 80/20 acetone/water (A/W) solvent system (Ace‐SABRE) to provide hyperpolarized [1– 13 C]pyruvate with up to 17% polarization, then implement a solvent processing protocol to achieve injectable solutions retaining 74% of the initial polarization, and lastly we demonstrate HP in vivo spectroscopy and imaging using the Ace‐SABRE platform to showcase metabolic tracking in a hepatocellular carcinoma (HCC) tumor as well as HP‐MRI, both in direct comparison to dissolution dynamic nuclear polarization (d‐DNP) experiments. The Ace‐SABRE technique promises faster adoption of SABRE hyperpolarization in biological experiments, overall lowering the barriers to entry for HP‐NMR and HP‐MRI.

Chemistry↗

Explainable AI for Multivariate Time Series Pattern Exploration: Latent Space Visual Analytics With Temporal Fusion Transformer and Variational Autoencoders in Power Grid Event Diagnosis

Detecting and analyzing complex patterns in multivariate time-series data is crucial for decision-making in urban and environmental system operations. However, challenges arise from the high dimensionality, intricate complexity, and interconnected nature of complex patterns, which hinder the understanding of their underlying physical processes. Existing AI methods often face limitations in interpretability, computational efficiency, and scalability, reducing their applicability in real-world scenarios. This paper proposes a novel visual analytics framework that integrates two generative AI models, Temporal Fusion Transformer (TFT) and Variational Autoencoders (VAEs), to reduce complex patterns into lower-dimensional latent spaces and visualize them in 2D using dimensionality reduction techniques such as PCA, t-SNE, and UMAP with DBSCAN. These visualizations, presented through coordinated and interactive views and tailored glyphs, enable intuitive exploration of complex multivariate temporal patterns, identifying patterns’ similarities and uncover their potential correlations for a better interpretability of the AI outputs. The framework is demonstrated through a case study on power grid signal data, where it identifies multi-label grid event signatures, including faults and anomalies with diverse root causes. Additionally, novel metrics and visualizations are introduced to validate the models and assess the performance, efficiency, and consistency of latent maps generated by VAE, which have been utilized in prior studies for latent space cartography and used as a benchmark in this study, and the emerging TFT architecture under various configurations. These analyses provide actionable insights for model parameter tuning and reliability improvements. Comparative results highlight that TFT achieves shorter run times and superior scalability to diverse time-series data shapes compared to VAE. This work advances fault diagnosis in multivariate time series, fostering explainable AI to support critical system operations.

Explainable AI↗

A Sparse Distributed Gigascale Resolution Material Point Method

In this paper, we present a four-layer distributed simulation system and its adaptation to the Material Point Method (MPM). The system is built upon a performance portable C++ programming model targeting major High-Performance-Computing (HPC) platforms. A key ingredient of our system is a hierarchical block-tile-cell sparse grid data structure that is distributable to an arbitrary number of Message Passing Interface (MPI) ranks. We additionally propose strategies for efficient dynamic load balance optimization to maximize the efficiency of MPI tasks. Our simulation pipeline can easily switch among backend programming models, including OpenMP and CUDA, and can be effortlessly dispatched onto supercomputers and the cloud. Finally, we construct benchmark experiments and ablation studies on supercomputers and consumer workstations in a local network to evaluate the scalability and load balancing criteria. We demonstrate massively parallel, highly scalable, and gigascale resolution MPM simulations of up to 1.01 billion particles for less than 323.25 seconds per frame with 8 OpenSSH-connected workstations.

97 MATHEMATICS AND COMPUTING↗

An aggregation-based nonlinear multigrid solver for two-phase flow and transport in porous media

A nonlinear multigrid solver for two-phase flow and transport in a mixed fractional-flow velocity-pressure-saturation formulation is proposed. The solver, which is under the framework of the full approximation scheme (FAS), extends our previous work on nonlinear multigrid for heterogeneous diffusion problems. The coarse spaces in the multigrid hierarchy are constructed by first aggregating degrees of freedom, and then solving some local flow problems. The mixed formulation and the choice of coarse spaces allow us to assemble the coarse problems without visiting finer levels during the solving phase, which is crucial for the scalability of multigrid methods. Specifically, a natural generalization of the upwind flux can be evaluated directly on coarse levels using the precomputed coarse flux basis vectors. We find that the resulting solver is applicable to problems discretized on general unstructured grids. The performance of the proposed nonlinear multigrid solver in comparison with the standard single level Newton's method is demonstrated through challenging numerical examples. It is observed that the proposed solver is robust for highly nonlinear problems and clearly outperforms Newton's method in the case of high Courant-Friedrichs-Lewy (CFL) numbers.

58 GEOSCIENCES↗

Utilizing Essential Symmetry Breaking in Auxiliary-Field Quantum Monte Carlo: Application to the Spin Gaps of the C 36 Fullerene and an Iron Porphyrin Model Complex

We present three distinct examples where phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) can be reliably performed with a single-determinant trial wave function with essential symmetry breaking. Essential symmetry breaking was first introduced by Lee and Head-Gordon [ Phys. Chem. Chem. Phys. 2019, 21, 4763-4778, 10.1039/C8CP07613H]. We utilized essential complex and time-reversal symmetry breaking with ph-AFQMC to compute the triplet–singlet energy gap in the TS12 set. We found statistically better performance of ph-AFQMC with complex-restricted orbitals than with spin-unrestricted orbitals. We then showed the utilization of essential spin symmetry breaking when computing the singlet–triplet gap of a known biradicaloid, C 36 . ph-AFQMC with spin-unrestricted Hartree–Fock (ph-AFQMC+UHF) fails catastrophically even with spin-projection and predicts no biradicaloid character. With approximate Brueckner orbitals obtained from regularized orbital-optimized second-order Møller–Plesset perturbation theory (κ-OOMP2), ph-AFQMC quantitatively captures strong biradicaloid character of C 36 . Lastly, we applied ph-AFQMC to the computation of the quintet–triplet gap in a model iron porphyrin complex where brute-force methods with a small active space fail to capture the triplet ground state. We show unambiguously that neither triplet nor quintet is strongly correlated using UHF, κ-OOMP2, and coupled-cluster with singles and doubles (CCSD) performed on UHF and κ-OOMP2 orbitals. There is no essential symmetry breaking in this problem. By virtue of this, we were able to perform UHF+ph-AFQMC reliably with a cc-pVTZ basis set and predicted a triplet ground state for this model geometry. The largest ph-AFQMC in this work correlated 186 electrons in 956 orbitals. Our work highlights the utility, scalability, and accuracy of ph-AFQMC with a single-determinant trial wave function with essential symmetry breaking for systems mainly dominated by dynamical correlation with little static correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems

With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.

Song, Ruibing↗

Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach

Training an effective deep learning model to learn ocean processes involves careful choices of various hyperparameters. We leverage DeepHyper’s advanced search algorithms for multiobjective optimization, streamlining the development of neural networks tailored for ocean modeling. The focus is on optimizing Fourier neural operators (FNOs), a data-driven model capable of simulating complex ocean behaviors. Selecting the correct model and tuning the hyperparameters are challenging tasks, requiring much effort to ensure model accuracy. DeepHyper allows efficient exploration of hyperparameters associated with data preprocessing, FNO architecture-related hyperparameters, and various model training strategies. We aim to obtain an optimal set of hyperparameters leading to the most performant model. Moreover, on top of the commonly used mean squared error for model training, we propose adopting the negative anomaly correlation coefficient as the additional loss term to improve model performance and investigate the potential trade-off between the two terms. The numerical experiments show that the optimal set of hyperparameters enhanced model performance in single timestepping forecasting and greatly exceeded the baseline configuration in the autoregressive rollout for long-horizon forecasting up to 30 days. Utilizing DeepHyper, we demonstrate an approach to enhance the use of FNO in ocean dynamics forecasting, offering a scalable solution with improved precision.

97 MATHEMATICS AND COMPUTING↗