Search NASA⌕ Search

SEARCH · Search NASA

Results for “APPROXIMATION METHOD”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Performance of high-order Godunov-type methods in simulations of astrophysical low Mach number flows

High-order Godunov methods for gas dynamics have become a standard tool for simulating different classes of astrophysical flows. Their accuracy is mostly determined by the spatial interpolant used to reconstruct the pair of Riemann states at cell interfaces and by the Riemann solver that computes the interface fluxes. In most Godunov-type methods, these two steps can be treated independently, so that many different schemes can in principle be built from the same numerical framework. Because astrophysical simulations often test out the limits of what is feasible with the computational resources available, it is essential to find the scheme that produces the numerical solution with the desired accuracy at the lowest computational cost. However, establishing the best combination of numerical options in a Godunov-type method to be used for simulating a complex hydrodynamic problem is a nontrivial task. In fact, formally more accurate schemes do not always outperform simpler and more diffusive methods, especially if sharp gradients are present in the flow. For this work, we used our fully compressible Seven-League Hydro (SLH) code to test the accuracy of six reconstruction methods and three approximate Riemann solvers on two- and three-dimensional (2D and 3D) problems involving subsonic flows only. We considered Mach numbers in the range from 10 −3 to 10 −1 , which are characteristic of many stellar and geophysical flows. In particular, we considered a well-posed, 2D, Kelvin–Helmholtz instability problem and a 3D turbulent convection zone that excites internal gravity waves in an overlying stable layer. Although the different combinations of numerical methods converge to the same solution with increasing grid resolution for most of the quantities analyzed here, we find that (i) there is a spread of almost four orders of magnitude in computational cost per fixed accuracy between the methods tested in this study, with the most performant method being a combination of a low-dissipation Riemann solver and a sextic reconstruction scheme; (ii) the low-dissipation solver always outperforms conventional Riemann solvers on a fixed grid when the reconstruction scheme is kept the same; (iii) in simulations of turbulent flows, increasing the order of spatial reconstruction reduces the characteristic dissipation length scale achieved on a given grid even if the overall scheme is only second order accurate; (iv) reconstruction methods based on slope-limiting techniques tend to generate artificial, high-frequency acoustic waves during the evolution of the flow; and (v) unlimited reconstruction methods introduce oscillations in the thermal stratification near the convective boundary, where the entropy gradient is steep.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Sparse chronology strategy for integrating seasonal energy storage in capacity expansion models

Here, this study develops the sparse chronology method to enhance the representative period framework in capacity expansion models, enabling the effective integration of long-duration energy storage modeling. Traditional representative period methods cannot capture the state of charge of seasonal energy storage systems because they do not establish effective inter-day linkages to connect the state of charge between periods. The sparse chronology approach addresses this limitation by establishing inter-day linkages that allow state of charge to shift inter-seasonally. At the same time, it groups identical representative days into partitions, applying constraints sparsely and implicitly to reduce computational load further. Validation results demonstrate that this method successfully simulates long-duration energy storage patterns, achieving close alignment with a continuous yearly benchmark model, with seasonal trends and state of charge cycles clearly represented. The computational load analysis reveals that the sparse chronology method efficiently applies constraints on maximum and minimum state of charge limits within the representative day framework, eliminating the need for detailed constraints on each individual day. By partitioning representative days and constraining only the start and end of each partition, the method significantly decreases computational requirements. Simulation results show that sparse chronology closely approximates the continuous yearly method's accuracy, even with as few as 20 representative days, achieving correlation values with the benchmark of nearly 0.9 in state of charge plots. Furthermore, it maintains computational efficiency, requiring only 4 % of the solver time compared to the continuous yearly method with 20 representative days. This approach allows capacity expansion models to incorporate long-duration energy storage with high temporal, spatial, and technological resolution, enabling more detailed modeling for large-scale power systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Analytical simulation of meander morphology from equilibrium to long-term evolution: Impacts of channel geometry and vegetation-induced coarsening

This study introduces an innovative approach to modeling meandering river morphology, integrating and investigating the effects of geometric characteristics and vegetation-induced channel coarsening. The developed comprehensive framework combines several advanced techniques: Genetic Programming for refining the scour factor of transverse bed slope, a Leaf Area Index (LAI)-enhanced analytical model for quantifying vegetative flow resistance, and an upstream-weighted moving average method for efficient approximation of the convolution integral in meander migration calculations. The model is validated against both an idealized Kinoshita meander and a natural bend of the Tumen River (China) in equilibrium, demonstrating its robustness across diverse scales and conditions. The model's ability to simulate the long-term evolution, including cutoff events, provides valuable insight for river management strategies. The current findings demonstrate that channel geometry, particularly width-to-depth ratio, plays a dominant role in meander evolution, with wider channels prone to more complex and rapid morphological changes. Vegetation effects are most pronounced in channels with moderate width-to-depth ratios, where they can significantly influence migration rates and bed topography. A combination of channel widening and deepening, coupled with strategic vegetation management, can effectively enhance navigability while maintaining channel stability in the studied Tumen River reach. Sensitivity analyses highlight the complex interplay between hydraulic conditions, sediment characteristics, and vegetation in shaping river morphology. This research advances understanding of the multifaceted nature of meandering river systems and offers practical tools for informed decision-making in river engineering and environmental management, particularly in the context of climate change and increasing anthropogenic pressures on fluvial ecosystems.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Fast and deep phosphoproteome analysis with the Orbitrap Astral mass spectrometer

Owing to its roles in cellular signal transduction, protein phosphorylation plays critical roles in myriad cell processes. That said, detecting and quantifying protein phosphorylation has remained a challenge. We describe the use of a novel mass spectrometer (Orbitrap Astral) coupled with data-independent acquisition (DIA) to achieve rapid and deep analysis of human and mouse phosphoproteomes. With this method, we map approximately 30,000 unique human phosphorylation sites within a half-hour of data collection. The technology is benchmarked to other state-of-the-art MS platforms using both synthetic peptide standards and with EGF-stimulated HeLa cells. We apply this approach to generate a phosphoproteome multi-tissue atlas of the mouse. Altogether, we detect 81,120 unique phosphorylation sites within 12 hours of measurement. With this unique dataset, we examine the sequence, structural, and kinase specificity context of protein phosphorylation. Finally, we highlight the discovery potential of this resource with multiple examples of phosphorylation events relevant to mitochondrial and brain biology.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Exciting DeePMD: Learning excited-state energies, forces, and non-adiabatic couplings

We extend the DeePMD neural network architecture to predict electronic structure properties necessary to perform non-adiabatic dynamics simulations. While learning the excited state energies and forces follows a straightforward extension of the DeePMD approach for ground-state energies and forces, how to learn the map between the non-adiabatic coupling vectors (NACV) and the local chemical environment descriptors of DeePMD is less trivial. Most implementations of machine-learning-based non-adiabatic dynamics inherently approximate the NACVs, with an underlying assumption that the energy-difference-scaled NACVs are conservative fields. We overcome this approximation, implementing the method recently introduced by Richardson [J. Chem. Phys. 158, 011102 (2023)], which learns the symmetric dyad of the energy-difference-scaled NACV. Furthermore, the efficiency and accuracy of our neural network architecture are demonstrated through the example of the methaniminium cation CH 2 NH 2 + .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum Monte Carlo calculations of electron scattering from 12 C in the short-time approximation

The short-time approximation is a method introduced to evaluate electroweak nuclear response for systems with A ≥ 12, extending the reach of first-principle many-body quantum Monte Carlo calculations. Using realistic two- and three-body nuclear interactions and consistent one- and two-body electromagnetic currents, we calculate longitudinal and transverse response densities and response functions of 12 C. Here, we compare the resulting cross sections with experimental data for electron-nucleus scattering, finding good agreement.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

High-fidelity holographic beam shaping with optimal transport and phase diversity

A phase-only spatial light modulator (SLM) provides a powerful way to shape laser beams into arbitrary intensity patterns but at the cost of a hard computational problem of determining an appropriate SLM phase. Here, we show that optimal transport methods can generate approximate solutions to this problem that serve as excellent initializations for iterative phase retrieval algorithms, yielding vortex-free solutions with superior accuracy and efficiency. Additionally, we show that analogous algorithms can be used to measure the intensity and phase of the input beam incident upon the SLM via phase diversity imaging. These techniques furnish flexible and convenient solutions to the computational challenges of beam shaping with an SLM.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Self-Assembling Cell-Free Systems for Scalable Bioconversion

This project focused on developing cell-free systems to directly express multi-enzyme catalysts and perform CO2 bioconversions for industrial chemical production. The use of cell-free expression (CFE) systems derived from bacterial lysates is emerging as a promising approach for biomanufacturing. CFEs are genetically programmable, permit the expression of toxic enzymes, and allow for rapid prototyping of metabolic pathways. Research Contributions: 1. Understanding the Area Investigated: This research advances the understanding of cell-free systems by demonstrating their capability to perform complex multi-enzyme reactions. By directly expressing multi-gene systems, CFEs avoid the high costs and inefficiencies associated with producing and purifying enzymes for multi-step pathways. 2. Technical Effectiveness and Economic Feasibility: The project successfully engineered a CFE-based multienzyme biocatalyst for the de novo synthesis of serine and glycine from CO2 equivalents (formate and bicarbonate) and ammonia. This method achieved a 30% conversion rate of formate into these industrially important amino acids. Additionally, an 8-gene CFE biocatalyst was developed to produce malate, conserving 43% of carbon that would otherwise be lost as CO2. This approach has the potential to reach higher carbon efficiency than microbial production. 3. Public Benefit: The cell-free production of chemicals like serine, glycine, and malate using electrochemically generated formate could significantly reduce CO2 emissions. For example, satisfying the global malate market with this method could avoid approximately 400,000 tons of CO2 emissions annually. This work demonstrates the potential of CFE systems to produce platform chemicals, contributing to environmental sustainability and reducing reliance on petrochemicals. Future Prospects: The CFE-based biocatalyst process could be extended to produce a variety of chemicals, including other industrial di-acids, aromatics, terpenes, alcohols, and polymers. This project showcases the capabilities of cell-free expression systems for prototyping carbon-conserving pathways and sustainably bioproducing platform chemicals, marking a significant step towards economically-viable industrial processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data

The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗
DOE OSTI2025

Quantum real-time evolution using tensor renormalization group methods

We introduce an approach for approximate real-time evolution of quantum systems using tensor renormalization group (TRG) methods originally developed for imaginary time. We use higher-order TRG to generate a coarse-grained time evolution operator for a 1+1⁢D transverse Ising model with a longitudinal field. We show that the standard tensor norm used for the singular value decomposition-based truncation is degenerate and propose an alternate method to discriminate. We show that it is effective and efficient in evolving Gaussian wave packets for one and two particles in the disordered phase, while ordered phase behavior is more challenging to capture. We compare our algorithm with local simulators for universal quantum computers and discuss possible benchmarking in the near future.

lattice gauge theory↗
DOE OSTI2025

Projection-based multifidelity linear regression for data-scarce applications

Surrogate modeling for systems with high-dimensional quantities of interest remains challenging, particularly when training data are costly to acquire. This work develops multifidelity methods for multiple-input multiple-output linear regression targeting data-limited applications with high-dimensional outputs. Multifidelity methods integrate many inexpensive low-fidelity model evaluations with limited, costly high-fidelity evaluations. We introduce two projection-based multifidelity linear regression approaches with linear and nonlinear features that leverage principal component basis vectors for dimensionality reduction and combine multifidelity data through: (i) a direct data augmentation using low-fidelity data, and (ii) a data augmentation incorporating explicit linear corrections between low-fidelity and high-fidelity data. The data augmentation approaches combine high-fidelity and low-fidelity data into a unified training set and train the linear regression model through weighted least squares with fidelity-specific weights. We introduce a proximity-based weighting scheme with automatic weight selection strategy through cross-validation. Here, the proposed multifidelity linear regression methods are demonstrated on approximating the surface pressure field of a hypersonic vehicle in flight and the temperature field on an aircraft disc braking system. In an ultra low-data regime of no more than twelve high-fidelity samples, multifidelity linear regression achieves approximately 2% – 12% improvement in median accuracy and a higher R 2 score relative to single-fidelity methods at comparable computational cost.

data augmentation↗
DOE OSTI2024

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Development of a high-throughput method for processing sponge-stick samples to detect viable Bacillus anthracis spores

Since the national validation of the sponge-stick based method for detection of Bacillus anthracis spores in environmental samples, there have not been focused efforts to address the low throughput nature of the method, which processes only one sample at one time. Sample processing remains a serious bottleneck for rapidly analyzing large numbers of samples expected from a biological warfare attack. Therefore, we developed a high-throughput method to simultaneously process multiple sponge-stick samples to be better prepared for rapid response and recovery after wide area anthrax incidents. In this method, sponges are placed in 50 mL tubes containing 25 mL extraction buffer and shaken to release spores, after which the suspension is recovered for analysis. Here, we determined that an additional extraction step, conducted in the same tubes with 10 mL buffer, further increased spore recovery from sponge-stick by approximately 10 %. We determined that orbital shaking and multi-tube vortexing were both more effective than reciprocating shaking for recovering spores. We conducted simultaneous processing of up to 12 sponge-stick samples and demonstrated comparable spore recovery efficiencies to the traditional low-throughput stomacher-based method (approximately 60 % recovery at 10 2 -spore level and 75 % recovery at 10 4 -spore level for both methods in three replicate experiments, P > 0.05 for two-tailed t-tests for each experiment and spore level). We also demonstrated that our high-throughput method could be integrated with Rapid Viability-Polymerase Chain Reaction (RV-PCR) analysis and could detect levels as low as 40 spores per sponge even when challenged by a PCR particulate contaminant.

Anthrax↗
DOE OSTI2025

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗
DOE OSTI2025

Construction of approximate invariants for nonintegrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for nonintegrable Hamiltonian dynamical systems and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps expressed as square matrices, AIs can be constructed order by order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

36 MATERIALS SCIENCE↗