Search NASA⌕ Search

SEARCH · Search NASA

Results for “deterministic”

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 685 records · Page 38

Construction of fractal nanostructures based on Kepler-Shubnikov nets

A system of information codes for deterministic fractal lattices and sets of multifractal curves is proposed. An iterative modular design was used to obtain a series of deterministic fractal lattices with generators in the form of fragments of 2D structures and a series of multifractal curves (based on some Kepler-Shubnikov nets) having Cantor set properties. The main characteristics of fractal structures and their lacunar spectra are determined. A hierarchical principle is formulated for modules of regular fractal structures.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Usefulness of multiqubit W-type states in quantum information processing

We analyze the efficiency of multiqubit W-type states as resources for quantum information. For this, we identify and generalize four-qubit W-type states. Our results show that these states can be used as resources for deterministic quantum information processing. The utility of results, however, is limited by the availability of experimental setups to perform and distinguish multiqubit measurements. We therefore emphasize protocols where two users want to establish an optimal bipartite entanglement using the partially entangled W-type states. We find that for such practical purposes, four-qubit W-type states can be a better resource in comparison to three-qubit W-type states. For a dense coding protocol, our states can be used deterministically to send two bits of classical message by locally manipulating a single qubit. In addition, we also propose a realistic experimental method to prepare the four-qubit W-type states using standard unitary operations and weak measurements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classical and quantum discrete dynamical systems

We study deterministic and quantum dynamics from a constructive “finite” point of view, since the introduction of the continuum or other actual infinities in physics poses severe conceptual and technical difficulties, and while all of these concepts are not really needed in physics, which is in fact an empirical science. Particular attention is paid to the symmetry properties of discrete systems. For a consistent description of the symmetries of dynamical systems at different time instants and the symmetries of various parts of such systems, we introduce discrete analogs of gauge connections. These gauge structures are particularly important to describe the quantum behavior. The symmetries govern the fundamental properties of the behavior of dynamical systems. In particular, we can show that the moving soliton-like structures are inevitable in a deterministic (classical) dynamical system, whose symmetry group breaks the set of states into a finite number of orbits of the group. We demonstrate that the quantum behavior is a natural consequence of symmetries of dynamical systems. This behavior is a result of the fundamental inability to trace the identity of indistinguish-able objects during their evolution. Information is only available on invariant statements and values related with such objects. Using general mathematical arguments, any quantum dynamics can be shown to reduce to a sequence of permutations. The quantum interferences occur in the invariant subspaces of permutation representations of the symmetry groups of dynamical systems. The observables can be expressed in terms of permutation invariants. We also show that in order to describe quantum phenomena it is sufficient to use cyclotomic fields—the minimal extensions of natural numbers suitable for quantum mechanics, instead of a non-constructive number system—the field of complex numbers. The finite groups of symmetries play the central role in this review. In physics there is an additional reason for such groups to be of interest. Numerous experiments and observations in particle physics point to the importance of finite groups of relatively low orders in a number of fundamental processes. The origin of these groups has no explanation within presently recognized theories, such as the Standard Model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Estimating computational noise.

Computational noise in deterministic simulations is as ill-defined a concept as can be found in scientific computing. When coupled with adaptive strategies, the effects of finite precision destroy smoothness of the simulation output and complicate subsequent analysis. Following the work of Hamming on roundoff errors, we present a new algorithm, ECnoise, for quantifying the noise level of a computed function. Our theoretical framework is based on stochastic noise but does not assume a specific distribution for the noise. For the deterministic simulations considered, ECnoise produces reliable results in a few function evaluations and offers new insights into building blocks of large scale simulations.

99 GENERAL AND MISCELLANEOUS↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

The exit-time problem for a Markov jump process

The purpose of this paper is to consider the exit-time problem for a finite-range Markov jump process, i.e, the distance the particle can jump is bounded independent of its location. Additionally, such jump diffusions are expedient models for anomalous transport exhibiting super-diffusion or nonstandard normal diffusion. We refer to the associated deterministic equation as a volume-constrained nonlocal diffusion equation. The volume constraint is the nonlocal analogue of a boundary condition necessary to demonstrate that the nonlocal diffusion equation is well-posed and is consistent with the jump process. A critical aspect of the analysis is a variational formulation and a recently developed nonlocal vector calculus. Finally, this calculus allows us to pose nonlocal backward and forward Kolmogorov equations, the former equation granting the various moments of the exit-time distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards Off-policy Evaluation as a Prerequisite for Real-world Reinforcement Learning in Building Control

We present an initial study of off-policy evaluation (OPE), a problem prerequisite to real-world reinforcement learning (RL), in the context of building control. OPE is the problem of estimating a policy's performance without running it on the actual system, using historical data from the existing controller. It enables the control engineers to ensure a new, pretrained policy satisfies the performance requirements and safety constraints of a real-world system, prior to interacting with it. While many methods have been developed for OPE, no study has evaluated which ones are suitable for building operational data, which are generated by deterministic policies and have limited coverage of the state-action space. After reviewing existing works and their assumptions, we adopted the approximate model (AM) method. Furthermore, we used bootstrapping to quantify uncertainty and correct for bias. In a simulation study, we evaluated the proposed approach on 10 policies pretrained with imitation learning. On average, the AM method estimated the energy and comfort costs with 1.84% and 14.1% error, respectively.

Chen, B↗

LOGOS

LOGOS is a software package which contains a set of discrete optimization models that can be employed for capital budgeting optimization problems. More specifically, provided a set of items (characterized by cost and reward values) and constraints, these models select the best combination of items which maximizes overall reward and satisfies the provided constraints. The developed models are based on different versions of the knapsack optimization algorithms. Two main classes of optimization models have been initially developed: deterministic and stochastic. Stochastic optimization models evolve deterministic models by explicitly considering data uncertainties (associated to constraints or item cost and reward). These models can be employed as stand-alone models or interfaced with the INL developed RAVEN code to propagate data uncertainties and analyze the generated data (i.e., sensitivity analysis).

Wang, Congjian↗

UMT

UMT is a Sn deterministic thermal radiative transport Fortran proxy application. Its primary purpose is to research how data layout, programming paradigms and architectures effect the implementation and performance of Sn transport in Fortran on unstructured meshes. It is based on the LLNL Teton Sn deterministic thermal radiative transport code.

Yee, BenC.↗

FAIR to WISE (F2W) v1.0.0

FAIR to WISE (F2W) is an iterative, large-language model (LLM) driven pipeline that turns unstructured research PDFs into structured, queryable knowledge graphs (KGs). Core features include schema-driven extraction to a LinkML model; full provenance capture; ontology-grounded enrichment (e.g., chemical validation and ChEBI lookup); graph construction to JSON-LD with stable IDs; and KG-RAG question answering with evidence-aware retrieval. The system is engineered for reproducibility and accessibility (open-source Ollama models, temperature=0, NVTX/Nsight profiling) with robust QA (relation verification, deduplication, and deterministic outputs). Primary uses are literature-to-KG automation, knowledge-grounded Q&A, and experimental steering support. We demonstrate the approach in organic photovoltaics, where the pipeline ingests papers, builds a domain KG, and evaluates answers against expert competency questions to guide experimental planning and interpretation. Compared with off-the-shelf LLMs and ad-hoc NLP tools, F2W addresses ontology gaps and reduces hallucination risk by grounding responses in extracted evidence and enforcing schema constraints; it also offers deterministic, provenance-linked outputs and open, cost-aware deployment. Evidence-aware ranking further improves answer quality over pure vector search.

Abramov, David [Lawrence Berkeley National Laborat↗

AstraAI v1

AstraAI is an open-source, structure-aware AI coding agent designed for large scientific and DOE-HPC codebases such as AMReX-based applications. Unlike general-purpose coding assistants, AstraAI combines retrieval-augmented generation (RAG) with compiler-level Abstract Syntax Tree (AST) analysis to perform precise, scope-constrained code modifications. It identifies exact function spans, enforces locality of edits, and maintains cross-file invariants, enabling deterministic and build-safe transformations in complex C++/GPU environments. AstraAI is intended for developers working on large, evolving HPC frameworks where correctness, reproducibility, and structural integrity are critical. Typical use cases include modifying physics kernels, updating GPU device lambdas, and performing multi-file refactors without breaking compilation or runtime semantics. Compared to conventional LLM-based coding agents - even those with repository access - AstraAI provides structural guarantees rather than free-form text patches. It minimizes unintended diffs, prevents scope drift, preserves formatting and build stability, and reduces structural hallucinations. By integrating compiler tooling directly into the generation loop, AstraAI transforms AI-assisted coding from probabilistic text editing into deterministic, structure-preserving program transformation suitable for mission-critical scientific software.

Natarajan, Mahesh [Lawrence Berkeley National Labo↗

CodeScribe Agent

SF-26-086 CodeScribe introduces a structured, multi-stage pipeline that combines deterministic program analysis with LLM-powered translation to enable incremental, testable Fortran-to-C++ migration. First, `code-scribe index` traverses the project directory tree and produces `scribe.yaml` metadata files recording all modules, subroutines, and functions at each level, giving the LLM accurate structural context instead of a hallucinated codebase model. Second, `code-scribe draft` performs the deterministic portion of translation — converting Fortran types to C++ equivalents, replacing `use` statements with `#include` and `using namespace` directives, and detecting constructs requiring special handling — while embedding`scribe-prompt` annotations that guide the LLM through non-trivial cases such as statement-function-to-lambda conversions and `extern "C"` wrapper generation. Third, `code-scribe translate` applies project-specific TOML-based few-shot prompt templates and submits the composed prompt to a pluggable LLM backend (OpenAI, Anthropic, Argonne ARGO, any OpenAI-compatible endpoint, or local Hugging Face checkpoints), producing a C++ source file, a header, and a Fortran-C++ interface file for each translated routine so the codebase compiles and runs correctly throughout the migration. Beyond translation, CodeScribe includes a tool-using coding agent (`code-scribe agent`) with read, bash, edit, and write capabilities, and a bounded loop mode (`code-scribe loop`) that runs repeated stateless agent sessions over a task file with restricted tool access — enabling sustained, auditable software development workflows for broader scientific computing tasks.

Dhruv, Akash [Argonne National Laboratory (ANL), A↗

How Snow Aggregate Ellipsoid Shape and Orientation Variability Affects Fall Speed and Self-Aggregation Rates

Snow aggregate shapes and orientations have long been known to exhibit substantial variability. Despite this observed variability, most weather and climate prediction models use fixed power-law functions that deterministically map particle size to mass and fall speed. As such, integrated quantities like precipitation and self-aggregation rates currently ignore nonlinear effects resulting from variation in shape and orientation for aggregates of the same size. This study therefore develops an analytic framework that couples an empirically based bivariate distribution of ellipsoid shapes to classical hydrodynamic theory so as to capture an appropriate dispersion of masses, projected areas, and fall speeds for an assumed size distribution. For a fixed aggregate size, shape variations produce approximately ±0.13 m s -1 standard deviation of fall speed which increases the mass flux fall speed dispersion by more than 100% over traditional microphysics models. This increased fall speed dispersion results predominantly from shape-induced mass dispersion whereas orientation and drag dispersion play a lesser role. Shape variations can increase mass- and reflectivity-weighted fall speeds by up to 60% of traditional models whereas self-aggregation rates can increase by a factor of 100 for very small slope parameters. This implies that aggregate shape variations effectively forestall the theorized onset of fall speed distribution narrowing and subsequent quenching of the aggregation process. As a result, it is likely that secondary ice formation is necessary to prevent an ever decreasing slope parameter. The mathematical theory presented in this study is used to develop simple correction factors for snow forecast and climate models.

54 ENVIRONMENTAL SCIENCES↗

Insights into ENSO Diversity from an Intermediate Coupled Model. Part II: Role of Nonlinear Dynamics and Stochastic Forcing

Abstract In this study, we investigate how a single leading linear El Niño–Southern Oscillation (ENSO) mode, as studied in Part I, leads to the irregular coexistence of central Pacific (CP) and eastern Pacific (EP) ENSO, a phenomenon known as ENSO spatiotemporal diversity. This diversity is fundamentally generated by deterministic nonlinear pathways to chaos via the period-doubling route and, more prevailingly, the subharmonic resonance route with the presence of a seasonally varying basic state. When residing in the weakly nonlinear regime, the coupled system sustains a weak periodic oscillation with a mixed CP/EP pattern as captured by the linear ENSO mode. With a stronger nonlinearity effect, the ENSO behavior experiences a period-doubling bifurcation. The single ENSO orbit splits into coexisting CP-like and EP-like ENSO orbits. A sequence of period-doubling bifurcation results in an aperiodic oscillation featuring irregular CP and EP ENSO occurrences. The overlapping of subharmonic resonances between ENSO and the seasonal cycle allows this ENSO irregularity and diversity to be more readily excited. In the strongly nonlinear regime, the coupled system is dominated by regular EP ENSO. The deterministic ENSO spatiotemporal diversity is thus confined to a relatively narrow range corresponding to a moderately unstable ENSO mode. Stochastic forcing broadens this range and allows ENSO diversity to occur when the ENSO mode is weakly subcritical. A close relationship among a weakened mean zonal temperature gradient, stronger ENSO activity, and more (fewer) occurrences of EP (CP) ENSO is noted, indicating that ENSO–mean state interaction may yield ENSO regime modulations on the multidecadal time scale.

Geng, Licheng↗

Stochastic Parameterization of Subgrid-Scale Velocity Enhancement of Sea Surface Fluxes

Abstract Subgrid-scale (SGS) velocity variations result in gridscale sea surface flux enhancements that must be parameterized in weather and climate models. Traditional parameterizations are deterministic in that they assign a unique value of the SGS velocity flux enhancement to any given configuration of the resolved state. In this study, we assess the statistics of SGS velocity flux enhancement over a range of averaging scales (as a proxy for varying model resolution) through systematic coarse-graining of a convection-permitting atmospheric model simulation over the Indian Ocean and west Pacific warm pool. Conditioning the statistics of the SGS velocity flux enhancement on 1) the fluxes associated with the resolved winds and 2) the precipitation rate, we find that the lack of a separation between “resolved” and “unresolved” scales results in a distribution of flux enhancements for each configuration of the resolved state. That is, the SGS velocity flux enhancement should be represented stochastically rather than deterministically. The spatial and temporal statistics of the SGS velocity flux enhancement are investigated by using basic descriptive statistics and through a fit to an anisotropic space–time covariance structure. Potential spatial inhomogeneities of the statistics of the SGS velocity flux enhancement are investigated through regional analysis, although because of the relatively short duration of the simulation (9 days) distinguishing true inhomogeneity from sampling variability is difficult. Perspectives for the implementation of such a stochastic parameterization in weather and climate models are discussed.

54 ENVIRONMENTAL SCIENCES↗

Improving Solution Accuracy and Convergence for Stochastic Physics Parameterizations with Colored Noise

Stochastic parameterizations are used in numerical weather prediction and climate modeling to help capture the uncertainty in the simulations and improve their statistical properties. Convergence issues can arise when time integration methods originally developed for deterministic differential equations are applied naively to stochastic problems. In previous studies, it has been demonstrated that a correction term, known in stochastic analysis as the Itô correction, can help improve solution accuracy for various deterministic numerical schemes and ensure convergence to the physically relevant solution without substantial computational overhead. The usual formulation of the Itô correction is valid only when the stochasticity is represented by white noise. In this study, a generalized formulation of the Itô correction is derived for noises of any color. The formulation is applied to a test problem described by an advection–diffusion equation forced with a spectrum of fast processes. We present numerical results for cases with both constant and spatially varying advection velocities to show that, for the same time step sizes, the introduction of the generalized Itô correction helps to substantially reduce time integration error and significantly improve the convergence rate of the numerical solutions when the forcing term in the governing equation is rough (fast varying); alternatively, for the same target accuracy, the generalized Itô correction allows for the use of significantly longer time steps and, hence, helps to reduce the computational cost of the numerical simulation.

54 ENVIRONMENTAL SCIENCES↗

Characterization of temporal variations and feedback timescales of exhaust gas recirculation gas properties using high-speed diode laser absorption spectroscopy for next-cycle control of cyclic variability

Dilute combustion offers efficiency gains in boosted gasoline direct injection engines both through knock-limit extension and thermodynamic advantages (i.e. the effect of γ on cycle efficiency), but is limited by cyclic variability at high dilution levels. Past studies have shown that the cycle-to-cycle dynamics are a combination of deterministic and stochastic effects. The deterministic causes of cyclic variations, which arise from feedback due to exhaust gas recirculation, imply the possibility of using active control strategies for dilution limit extension. While internal exhaust gas recirculation will largely provide a next-cycle effect (short-timescale feedback), the feedback of external exhaust gas recirculation will have an effect after a delay of several cycles (long timescale). Therefore, control strategies aiming to improve engine stability at dilution limit may have to account for both short- and long-timescale feedback pathways. This study shows the results of a study examining the extent to which variations in exhaust gas recirculation composition are preserved along the exhaust gas recirculation flow path and thus the relative importance and information content of the long-timescale feedback pathway. To characterize the filtering or retention of cycle-resolved feedback information, high-speed (1–5 kHz) CO 2 concentration measurements were performed simultaneously at three different locations along the low-pressure external exhaust gas recirculation loop of a four-cylinder General Motors gasoline direct injection engine using a multiplexed two-color diode laser absorption spectroscopy sensor system during steady-state and transient engine operation at various exhaust gas recirculation levels. It was determined that cycle-resolved feedback propagates through internal residual gases but is filtered out by the low-pressure exhaust gas recirculation flow system and do not reach the intake manifold. Intermediate variations driven by flow rate and compositional changes are also distinguished and identified.

Dilute combustion↗