SEARCH · Search NASA

Results for “POLYNOMIAL”

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 271 records · Page 15

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

DOE OSTI2024

Uncertainty Quantification and Sensitivity Analysis of Non-Nuclear Advanced Controls Testbed Reactor Mockup

The research presented in this report describes our progress in applying stochastic methods and uncertainty quantification, parametric study, and variance-based sensitivity analysis (also known as Sobol sensitivity analysis) to a full-core model of a nuclear thermal propulsion (NTP) system simulated with Griffin, with the goal of developing a reduced order (surrogate) model which can be rapidly sampled while perturbing multiple input parameters. In this NTP system, reactivity and power feedback affect the rotation of control drums, which are controlled by a hybrid proportional, integral and derivative (PID) controller, actuated by the power demand and reactivity feedback from the numerical model. This model uses reactor kinetic feedback (mean generation time and $\beta$ from a transient Griffin simulation executed with the improved quasi-static method to provide the kinetic parameters) as inputs to functions which control the CD rotation angle. Using a number of stochastic method approaches, we developed a dual purpose training-surrogate model of the NTP system using polynomial regression. The trained model can be rapidly sampled while simultaneously perturbing various input parameters of the model, such as coefficients on the PID control, or temperature (directly affect the neutron cross section). The surrogate model delivers accurate results orders-of-magnitude faster (minutes, not days) than the base model. Once the base model has been trained, distributions of the uncertain parameters can be changed at will to investigate the effects of perturbing multiple inputs and their effect on the output. For example, coefficients used in the PID control system may vary due to some physical interference, or there may be uncertainty in the temperature of the neutron cross sections in various regions of the reactor. A distribution can be placed on these parameters and operational boundaries can be determined. The goal of this work is to support development of an advanced control system to operate CDs in a functioning NTP system.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2025

Working with Bezier Curves as bases for Functional Expansion Tallies

Functional expansion tallies (FETs) are a powerful tool for getting more information per history from Monte Carlo simulations, but in the past they have been constrained to orthogonal bases. Bezier curves, from computer aided design (CAD), could be well suited for FET due to their ability to assume many arbitrary shapes, but are non-orthogonal. Recent development has made non-orthongal FET possible. The convergence of B ´ezier curve FETs in both polynomial order and number of samples is explored. These bases are well suited for representing normal distributions, and opens the door to possible other CAD derived FET bases.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A DATA EFFICIENT SPARSE MODELING FRAMEWORK FOR POWER ESTIMATION IN WATER TREATMENT SENSING OPERATIONS

With increasing freshwater scarcity, advanced process design mechanisms such as Closed-Circuit Reverse Osmosis (CCRO) and Digital/Physical Twin systems are gaining traction in water treatment and reuse operations. While digital and physical twin models enable improved system insight and control, their development is often expensive and computationally intensive, requiring large volumes of synthetic or experimental data to characterize underlying process dynamics. This work introduces a sparse surrogate modeling framework to estimate power consumption from measured flow and pressure variables, along with their nonlinear polynomial and interaction expansions. To ensure model reliability and reduce overfitting, a two-stage pipeline is proposed. First, a dynamic data filtering algorithm is employed to remove uninformative observations and transient operational states. Second, a sparse penalized regression technique is applied to select a minimal set of parsimonious features. The proposed model achieves high sparsity, retaining only 7 out of 34 candidate features (≈79.41% sparsity) while delivering a root mean square error (RMSE) of 0.072 on the test dataset.

Mukherjee, Subrata [ORNL] (ORCID:0000000309930338)↗

DOE OSTI2024

INL Poster - Juan Barrera Salazar

Generation IV nuclear reactors introduce several advantages and benefits in terms of safety and efficiency when compared with their predecessors from previous generation. This is due, among many things, to the use of innovative forms of fuel and coolant, different from the conventional ones used in the last decades. Given that these upcoming designs utilize emerging technologies, the related instrumentation is also in the process of being developed; therefore, it is necessary to establish the sensitivity requirements and the effects of uncertainty on different properties of the components and elements of the reactor designs. This report presents the results of simulations that quantify the impacts of the uncertainties of four thermophysical properties of the refrigerant salt (LiF-BeF2) for the Kairos Power benchmark model (g-FHR) for steady state making use of the Sobol’ method through polynomial chaos surrogate modeling. The properties of the salt to which uncertainty was evaluated were density, dynamic viscosity, thermal conductivity and heat capacity. This study was carried out using the Griffin/Pronghorn multiphysics model under the computational resources of the Idaho National Laboratory (INL) High Performance Computing (HPC). The results indicate a weak dependence of the uncertainty of thermal conductivity on the quantities of core pressure drop and core outlet temperature.

21 - SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLAN↗

DOE OSTI2025

Working with Bézier Curves as bases for Functional Expansion Tallies

Functional expansion tallies (FETs) are powerful tools for getting more information per history from Monte Carlo simulations, but in the past they have been constrained to orthogonal bases. Bézier curves are used widely in computer aided design (CAD) geometry kernels and could be well-suited for FETs due to their ability to assume many arbitrary shapes, but they use nonorthogonal bases. Recent developments in 2021 have made nonorthogonal FETs possible. The convergence of Bézier curve FETs in both polynomial order and number of samples is explored in this work. It is shown that these bases are well-suited for representing normal distributions and this opens the door to the possibility of other CAD-derived FET bases.

97 - MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Simulation and Experimental Validation of an Integrated Heat Pump – Thermal Energy Storage Using a Room-Temperature Phase Change Material

As the dependence on electrical heat pumps (HPs) and intermittent renewables increases, grid strains are expected to grow. This necessitates an energy storage system to reduce the mismatch between energy supply and demand. Thus, a proposed dual-mode commercially available 14.1 kW HP was integrated with a single 22°C phase change material (PCM) thermal storage system (TES) to load-shift both cooling and heating loads. The HP-TES system was manufactured and experimentally tested using a novel test matrix based on AHRI 210/240 psychrometric conditions. Furthermore, transient dual-mode system-level HP-TES models were developed in Modelica and validated using the experimental test conditions. Base HP cooling and heating experimental tests at ambient temperatures of 35°C and −8.3°C show that the modified HP-TES maintained the rated system capacity and performance. The HP-TES discharge provided approximately 30% and 50% reductions in cooling and heating demand, respectively. The transient HP-TES models predicted system capacity and total power input for discharge and recharge operating modes within ±4% mean percentage error, and recharge power input within ±2%, with maximum errors occurring at the equipment startup. During system operation, the sources of model deviations are first-order polynomial fits of the PCM digital scanning calorimetry (DSC) data and unaccounted supercooling in the PCM during solidification. Nonetheless, the model predictions agree with the experimental tests, demonstrating the availability of robust, accurate, and validated transient models that can be used for further validation and the development of system controls.

25 ENERGY STORAGE↗

DOE OSTI2026

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Matrix chain multiplication -- computing $\mathcal{W} = M^{(0)}\cdots M^{(K-1)}$ where $M^{(k)} \in \mathbb{R}^{P_k \times P_{k+1}}$-- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\mathcal{O}(\max_{k} \mathrm{polylog} (P_k P_{k+1}))$, which is independent of~$K$ within the QRAM-based state-preparation model, whereas the qubit count is $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$; the total gate count remains linear in $K$, so the gain is in the circuit depth. The construction interleaves state-preparation operators across two layers; within each layer, all operators act on disjoint registers and execute in parallel. This subroutine can be specialized for the chain-vector case, which computes the product of $K-1$ matrices applied to a vector. We prove the correctness of the subroutine for all $K$ and provide two implementations using the Qiskit and QCLAB frameworks. The subroutine is applicable to any downstream quantum algorithm that operates on a matrix encoded in the statevector, including norm estimation, graph-matrix powers, linear system solving, and quantum machine learning kernels.

Antonioli, Giacomo [Pisa U.] (ORCID:00090000668703↗

DOE OSTI2025

Investigating the universality of five-point QCD scattering amplitudes at high energy

We investigate 2 → 3 QCD scattering amplitudes in multi-Regge kinematics, i.e. where the final partons are strongly ordered in rapidity. In this regime amplitudes exhibit intriguing factorisation properties which can be understood in terms of effective degrees of freedom called reggeons. Working within the Balitsky/JIMWLK framework, we predict these amplitudes for the first time to next-to-next-to-leading logarithmic order, and compare against the limit of QCD scattering amplitudes in full colour and kinematics. We find that the latter can be described in terms of universal objects, and that the apparent non-universality arising at NNLL comes from well-defined and under-control contributions that we can predict. Thanks to this observation, we extract for the first time the universal vertex that controls the emission of the central-rapidity gluon, both in QCD and $\mathcal{N}$ = 4 super Yang-Mills.