SEARCH · Search NASA

Results for “precomputing”

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 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS2017

Precomputing Process Noise Covariance for Onboard Sequential Filters

Process noise is often used in estimation filters to account for unmodeled and mismodeled accelerations in the dynamics. The process noise covariance acts to inflate the state covariance over propagation intervals, increasing the uncertainty in the state. In scenarios where the acceleration errors change significantly over time, the standard process noise covariance approach can fail to provide effective representation of the state and its uncertainty. Consider covariance analysis techniques provide a method to precompute a process noise covariance profile along a reference trajectory using known model parameter uncertainties. The process noise covariance profile allows significantly improved state estimation and uncertainty representation over the traditional formulation. As a result, estimation performance on par with the consider filter is achieved for trajectories near the reference trajectory without the additional computational cost of the consider filter. The new formulation also has the potential to significantly reduce the trial-and-error tuning currently required of navigation analysts. A linear estimation problem as described in several previous consider covariance analysis studies is used to demonstrate the effectiveness of the precomputed process noise covariance, as well as a nonlinear descent scenario at the asteroid Bennu with optical navigation.

onboard↗

NASA NTRS1972

Precomputed state dependent digital control of a nuclear rocket engine

A control method applicable to multiple-input multiple-output nonlinear time-invariant systems in which desired behavior can be expressed explicitly as a trajectory in system state space is developed. The precomputed state dependent control method is basically a synthesis technique in which a suboptimal control law is developed off-line, prior to system operation. This law is obtained by conducting searches at a finite number of points in state space, in the vicinity of some desired trajectory, to obtain a set of constant control vectors which tend to return the system to the desired trajectory. These vectors are used to evaluate the unknown coefficients in a control law having an assumed hyperellipsoidal form. The resulting coefficients constitute the heart of the controller and are used in the on-line computation of control vectors. Two examples of PSDC are given prior to the more detailed description of the NERVA control system development.

Johnson, M. R.↗

NASA NTRS1974

Small parametric model of the precomputation of meteorological fields on the basis of complete equations and its energetic analogs

A small parametric, nonadiabatic model for precomputation of meteorological fields on the basis of complete equations, along with its energetic analogs is described. The model incorporates integral characteristics of the components of the wind speed and the analogous functions of the total fluxes of the ocean, and uses a Cartesian isobaric system of coordinates.

Borisenkov, Y. P.↗

NASA NTRS1989

Application of precomputed control laws in a reconfigurable aircraft flight control system

A self-repairing flight control system concept in which the control law is reconfigured after actuator and/or control surface damage to preserve stability and pilot command tracking is described. A key feature of the controller is reconfigurable multivariable feedback. The feedback gains are designed off-line and scheduled as a function of the aircraft control impairment status so that reconfiguration is performed simply by updating the gain schedule after detection of an impairment. A novel aspect of the gain schedule design procedure is that the schedule is calculated using a linear quadratic optimization-based simultaneous stabilization algorithm in which the scheduled gain is constrained to stabilize a collection of plant models representing the aircraft in various control failure modes. A description and numerical evaluation of a controller design for a model of a statically unstable high-performance aircraft are given.

Moerder, Daniel D.↗

NASA NTRS1990

Comparison of effects of copropagated and precomputed atmosphere profiles on Monte Carlo trajectory simulation

A realization of a stochastic atmosphere model for use in simulations is presented. The model provides pressure, density, temperature, and wind velocity as a function of latitude, longitude, and altitude, and is implemented in a three degree of freedom simulation package. This implementation is used in the Monte Carlo simulation of an aeroassisted orbital transfer maneuver and results are compared to those of a more traditional approach.

Queen, Eric M.↗

DOE OSTI2024

Virtual Tokamak for Test and Development of Plasma Control Applied to NSTX-U

Safe and efficient operation of tokamak experiments depends on shot preparation prior to the experiment to maximize performance and avoid issues that are predictable consequences of known physics. The General Atomics TokSys toolbox is used to test and develop the plasma control system (PCS) on numerous tokamaks around the world. Tokamaks that use a version of the DIII-D PCS can connect it to a TokSys simulation and control a virtual version of the tokamak with the real PCS. Recent upgrades to the simulation include more detailed profile and transport modeling to support design and implementation of optimized scenarios. The simulation combines a module called “Profiles” that simulates the 1D profiles of density, pressure, and current and a module called “GSevolve'' that evolves the 2D Grad-Shafranov equilibrium. The “Profiles'' module primarily uses simplified models for fueling, heating, and current. The TRANSP code provides precomputed diffusion coefficients and heating/current drive profiles from radio-frequency and neutral beam sources for the scenarios being simulated. The fidelity of a simulation can be enhanced by analyzing it with TRANSP and making corrections to the precomputed values and iterating until convergence. Simulations of the National Spherical Torus Upgrade (NSTX-U) are presented. It is shown that the simulation reproduces the experimental profile evolution. Here, the simulation has also been upgraded to reproduce the experimental outcome at points of bifurcation. This is demonstrated with a simulation of vertical displacement in NSTX-U.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1984

State estimation Kalman filter using optical processings Noise statistics known

Reference is made to a study by Casasent et al. (1983), which gave a description of a frequency-multiplexed acoustooptic processor and showed how it was capable of performing all the individual operations required in Kalman filtering. The data flow and organization of all required operations however, were not detailed in that study. Consideration is given here to a simpler Kalman filter state estimation problem. Equally spaced time-sampled intervals (k times T sub s, with k the iterative time index) are assumed. It is further assumed that the system noise vector w and the measurement noise vector v are uncorrelated and Gaussian distributed and that the noise statistics (Q and R) and the system model (Phi, Gamma, H) are known. The error covariance matrix P and the extrapolated error covariance matrix M can thus be precomputed and the Kalman gain matrix K sub k can be precomputed and stored for each input time sample.

Jackson, J.↗

NASA NTRS1986

Monochromatic calculations of atmospheric radiative transfer due to molecular line absorption

Sensitivity studies related to the effects of line cutoff, spectral resolution, and temperature and pressure interpolations in radiative transfer have been performed so that a data set of absorption coefficients for water vapor, CO2, and O3 may be created efficiently. Results show that computations of absorption coefficients are affected only slightly by cutting a line off at a wave number 190 times the Lorentz half width from the center, or equivalently, cutting off 0.33 percent of the line intensity from the wings. To achieve a relative cooling rate error smaller than 2 percent, it is sufficient to precompute the absorption coefficient at three temperatures (210, 250, and 290 K) and 19 pressures with Delta (log 10 p) = 0.2. The absorption coefficient at other conditions can be interpolated linearly with pressure and exponentially with a quadratic in temperature. For the spectral resolution the absorption coefficients can be adequately computed at 0.01, 0.002, 0.005, and 0.025/cm intervals in the thermal water vapor, the CO2 and O3 bands, and the solar water vapor bands, respectively, which limits the error to only a few percent in the cooling and heating rates. Using the precomputed absorption coefficients, repeated monochromatic calculations of atmospheric heating/cooling rates for radiation model developments and for comparison with less detailed calculations are no longer difficult.

Chou, M.-D.↗

NASA NTRS1989

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗

NASA NTRS1990

Run-time scheduling and execution of loops on message passing machines

Saltz, Joel↗

NASA NTRS2005

Automated daily processing of more than 1000 ground-based GPS receivers for studying intense ionospheric storms

To take advantage of the vast amount of GPS data, researchers use a number of techniques to estimate satellite and receiver interfrequency biases and the total electron content (TEC) of the ionosphere. Most techniques estimate vertical ionospheric structure and, simultaneously, hardware-related biases treated as nuisance parameters. These methods often are limited to 200 GPS receivers and use a sequential least squares or Kalman filter approach. The biases are later removed from the measurements to obtain unbiased TEC. In our approach to calibrating GPS receiver and transmitter interfrequency biases we take advantage of all available GPS receivers using a new processing algorithm based on the Global Ionospheric Mapping (GIM) software developed at the Jet Propulsion Laboratory. This new capability is designed to estimate receiver biases for all stations. We solve for the instrumental biases by modeling the ionospheric delay and removing it from the observation equation using precomputed GIM maps. The precomputed GIM maps rely on 200 globally distributed GPS receivers to establish the ''background'' used to model the ionosphere at the remaining 800 GPS sites.

total electron content (TEC)↗

DOE OSTI2026

Local reduced-order modeling for electrostatic plasmas by physics-informed solution manifold decomposition

Despite advancements in high-performance computing and modern numerical algorithms, computational cost remains prohibitive for multi-query kinetic plasma simulations. Here, in this work, we develop data-driven reduced-order models (ROMs) for collisionless electrostatic plasma dynamics, based on the kinetic Vlasov-Poisson equation. Our ROM approach projects the equation onto a linear subspace defined by the proper orthogonal decomposition (POD) modes. We introduce an efficient tensorial method to update the nonlinear term using a precomputed third-order tensor. We capture multiscale behavior with a minimal number of POD modes by decomposing the solution manifold into multiple time windows and creating temporally local ROMs. We consider two strategies for decomposition: one based on the physical time and the other based on the electric field energy. Applied to the 1D1V Vlasov–Poisson simulations, that is, prescribed E-field, Landau damping, and two-stream instability, we demonstrate that our ROMs accurately capture the total energy of the system both for parametric and time extrapolation cases. The temporally local ROMs are more efficient and accurate than the single ROM. In addition, in the two-stream instability case, we show that the energy-windowing reduced-order model (EW-ROM) is more efficient and accurate than the time-windowing reduced-order model (TW-ROM). With the tensorial approach, EW-ROM solves the equation approximately 90 times faster than Eulerian simulations while maintaining a maximum relative error of 7.5% for the training data and 11% for the testing data.

Electrostatic plasmas↗

DOE OSTI2026

Parametric reduced order models for graded lattice structures

Graded lattice structures, characterized by smoothly varying mechanical properties, hold significant promise for optimizing material distribution in advanced engineering applications. However, accurately modeling these structures poses substantial computational challenges due to the continuous geometric variations within their unit cells. Here, to address these challenges, this paper introduces a novel Efficient Reduced Order Model (EROM) that integrates the Matrix Discrete Empirical Interpolation Method (MDEIM) and Discrete Empirical Interpolation Method (DEIM) with polynomial regression to efficiently manage geometric parametrization in lattice structures. Unlike traditional reduced order models (ROMs) that require extensive precomputed libraries for each geometric configuration, our approach enables continuous geometric variations through a flexible algebraic formulation, significantly reducing computational costs while preserving high accuracy. The method constructs projection matrices for individual unit cells that can be efficiently assembled into global systems, leveraging the repetitive nature of lattice structures. Numerical studies demonstrate that our EROM achieves displacement errors below 1% and von Mises stress prediction errors below 4%, coupled with computational speedups exceeding two orders of magnitude compared to full-order simulations. The proposed method's modularity and scalability make it particularly suitable for design optimization and real-time simulation of functionally graded lattice structures, with applications spanning aerospace to biomedical engineering.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2025

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗

DOE OSTI2026

Active operator learning with predictive uncertainty quantification for partial differential equations

With the increased prevalence of neural operators being used to provide rapid solutions to partial differential equations (PDEs), understanding the accuracy of model predictions and the associated error levels is necessary for deploying reliable surrogate models in scientific applications. Existing uncertainty quantification (UQ) frameworks employ ensembles or Bayesian methods, which can incur substantial computational costs during both training and inference. Here, we propose a lightweight predictive UQ method tailored for Deep operator networks (DeepONets) that also generalizes to other operator networks. Numerical experiments on linear and nonlinear PDEs demonstrate that the framework’s uncertainty estimates are unbiased and provide accurate out-of-distribution uncertainty predictions with a sufficiently large training dataset. Our framework provides fast inference and uncertainty estimates that can efficiently drive outer-loop analyses that would be prohibitively expensive with conventional solvers. We demonstrate how predictive uncertainties can be used in the context of Bayesian optimization and active learning problems to yield improvements in accuracy and data-efficiency for outer-loop optimization procedures. In the active learning setup, we extend the framework to Fourier Neural Operators (FNO) and describe a generalized method for other operator networks. To enable real-time deployment, we introduce an inference strategy based on precomputed trunk outputs and a sparse placement matrix, reducing evaluation time by more than a factor of five. Our method provides a practical route to uncertainty-aware operator learning in time-sensitive settings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Radiological Source Term Estimation and Isotopic Identification with Parallel Log Domain Particle Filters

This paper presents a parallel log-domain particle filtering algorithm combined with gamma spectrum unfolding to perform localization, identification, and evaluation of multiple point sources of various isotopes in an environment with attenuating obstacles. The method uses sets of precomputed attenuation kernels that map the attenuation characteristics of the environment. These kernels are specific to the energy level of a photopeak of interest. The spectral measurements are deconvolved into count measurements of each photopeak. These count measurements are fed into a set of parallel particle filters using attenuation kernels computed for that photopeak’s energy level. The individual regularized particle filters perform all likelihood calculations in the logarithmic domain to mitigate the effects of particle degeneracy. The output of each particle filter is combined to estimate which isotopes are present as well as their positions and strengths. The performance of the algorithm is characterized in a lab-scale environment using a mobile robot equipped with a gamma ray spectrometer in the presence of up to three different radioactive isotopes simultaneously. The sources were localized to within 10 cm, and their strengths were estimated within 10% of their true values. Furthermore, the isotopes were all correctly identified, and no spurious sources were reported.

42 ENGINEERING↗

DOE OSTI2026

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗