Search NASA⌕ Search

SEARCH · Search NASA

Results for “Methods”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

System and method for extracting ethanol from a fermentation broth

The present invention is directed to a system and method for producing an organic compound using fermentation wherein multiple components of the system are recycled within the system. The system and method allow for extraction of a high concentration of the organic compound from the fermentation broth in a continuous system that allows recycling of the biomass, aqueous fermentation broth and extraction solvents. The system and method are particularly well adapted for producing and extracting ethanol.

Abbas, Charles↗
DOE OSTI2024

Sum-of-Fractions Method

Sum-of-fractions is a method intended to make sure a subcritical margin for aqueous solutions and slurries of fissionable isotopes exists. The method indicates that a system is subcritical if the sum of the ratios of the mass of each isotope (in a mixture) to its individual minimum subcritical mass limit is less than or equal to one. Historically, the basis of the sum-of-fractions has been derived from allowances given in the American National Standards Institute (ANSI)/ American Nuclear Society (ANS)-8.15-1981. However, the allowance was removed in ANSI/ANS-8.15-2014 due to a lack of technical basis. A methodology was developed to assess the validity of using the sum-of-fractions for water- or polyethylene-moderated systems for the following nuclides: 232U, 233U, 234U, 235U, 237Np, 236Pu, 238Pu, 239Pu, 240Pu, 241Pu, 242Pu, 241Am, 242mAm, 243Am, 242Cm, 243Cm, 244Cm, 245Cm, 246Cm, 247Cm, 249Cf, and 251Cf. The methodology uses available benchmark data for mixtures of 233U, 235U, and 239Pu to establish the calculational margin, and a mass limit reduction to establish the margin of subcriticality. Water- or polyethylene-moderated and -reflected mixtures containing the nuclides are evaluated with the code system, SCALE 6.2.4. Including the calculational margin, subcritical mass limits for each nuclide were computed for optimally water- or polyethylene-moderated and fully reflected systems. These masses were used to create nuclide mixtures in which the sum of the mass to subcritical mass limit ratios is one. The various nuclide mixtures were modeled over a range of moderation and demonstrate the keff does not exceed the calculational margin. For additional assurance of subcriticality, a significant mass reduction is applied to each computed minimum critical mass of the nuclides without adequate benchmark data consistent with the method in ANSI/ANS-8.15-2014.

criticality safety, Actinide↗
DOE OSTI2024

Nonparametric Multiparticle Set Methods for Interpreting Environmental Samples

Collection and analysis of environmental samples is commonly used by a range of stakeholders in nuclear safeguards and security contexts. While the ubiquity of samples and their transport in the environment allow regular collection, developing and demonstrating methods for analyzing these samples is difficult. In this work, an environmental sample consists of a set of one or more individual particles. Recent advances in reactor simulation have allowed us to generate data that are more representative of real-world environmental samples, enabling statistically defensible method development and testing. The most notable of these advances is a drastic increase in the number of material depletion regions, which allows our simulations to capture the variation in isotopic composition seen at length scales consistent with environmental samples. Traditional approaches for handling multiparticle samples treat each particle in the sample individually, estimating the quantity of interest (e.g., core-average burnup) resulting from measurement and analysis of signatures (e.g., nuclide assays) from each individual particle. Individual estimates are then averaged to generate a single estimate of the quantity of interest over the entire sample. In this presentation, we introduce two novel approaches for interpreting environmental samples that comprise of multiple particles: (1) the Quantile-Quantile Comparator, which uses a multivariate generalization of quantile-quantile plots for comparing unknown statistical distributions, and (2) the Set Transformer, an attention-based neural network module designed to model interactions among elements (particles) in the input set (sample). Statistically representative sampling cannot be guaranteed as samples are passively collected and are beholden to what particles are available in the environment. These new analysis methods for set-input problems are expected to be more robust than traditional approaches to issues of sampling bias where particles are not uniformly distributed throughout regions of interest, as well as generally outperform traditional approaches by jointly considering all elements in the set. We will present results comparing the performance of traditional single particle approaches and the novel Quantile-Quantile Comparator and Set Transformer for interpretation of simulated environmental samples.

Phathanapirom, Birdy↗
DOE OSTI2026

Data Analytics Methods to Measure Plant Outage Resilience

Every 18 or 24 months nuclear power plants (depending on plant configuration, pressurized or boiling water reactor respectively) undergo a period of outage where the plant is taken offline and a large number of maintenance and surveillance activities (that cannot be performed while plant is running) are performed in typically 2–3 weeks. Planning of a plant outage is very challenging since all the activities are required to be performed in the shortest amount of time given available resources (typically contractor crews hired for the duration of the outage). Consequently, plant outages can be costly due the actual loss of power generation and crew costs and, because of it, there is a need to maximize resource usage in the outage planning phase and reduce the risk of outage delays. This paper is addressing these needs by providing a set of analytical methods designed to analyze plant outage schedule and identify critical elements based on available resources (time and crews). These methods are based on natural language processing and optimization algorithms. In this respect, two classes of methods have been developed: one that focuses on the time resource and how variability in the time to complete outage tasks may impact outage delays, and one that minimizes the risk of outage delays by integrating available resources to assess when daily activities should be performed.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
DOE OSTI2025

Application of a temporal multiscale method for efficient simulation of degradation in PEM Water Electrolysis under dynamic operating conditions

Hydrogen is emerging as a vital energy carrier, driven by the need to reduce carbon emissions. Proton Electrolyte Membrane Water Electrolysis (PEMWE) enables hydrogen production under fluctuating renewable power conditions but requires improved understanding and stability of the anode catalyst layer under dynamic operating conditions, especially with low noble metal loadings. Long-term degradation experiments are both time-consuming and costly; therefore, a systematic, model-aided approach is essential. In the present work, a temporal multiscale method is applied to reduce the computational effort of simulating long-term degradation processes in PEMWE, with an exemplary focus on catalyst dissolution. A mechanistic model incorporating the oxygen evolution reaction, catalyst dissolution, and hydrogen permeation from the cathode to the anode was hypothesized and implemented. In this way, the local periodicity of transport and reaction processes in dynamic PEMWE operation, which influence the gradual degradation of the catalyst layer, is captured. The temporal multiscale method significantly reduces the computational effort of simulation, decreasing processing time from hours to mere minutes. This efficiency gain is attributed to the limited evolution of Slow-Scale variables during each period of time P of the Fast-Scale variables. Consequently, simulation is required only until local periodicity is achieved within each Slow-Scale time step. Hence, the fully resolved dynamic problem is decoupled into these two scales, employing a heterogeneous multiscale technique. The developed approach effectively accelerates parameter estimation and predictive simulations, supporting systematic modeling of PEMWE degradation under dynamic conditions.

08 HYDROGEN↗
DOE OSTI2024

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

A fourth order sharp immersed method for the incompressible Navier-Stokes equations with stationary and moving boundaries and interfaces

We propose a fourth order Navier-Stokes solver based on the immersed interface method (IIM), for flow problems with stationary and one-way coupled moving boundaries and interfaces. Our algorithm employs a Runge-Kutta-based projection method that maintains high-order temporal accuracy in both velocity and pressure for steady and unsteady velocity boundary conditions. Fourth order spatial accuracy is achieved through a novel fifth order IIM discretization scheme for the advection term, as well as existing high-order interface-corrected finite difference schemes for the other differential operators. Using a set of manufactured flow problems with stationary and moving boundaries, we demonstrate fourth order convergence of velocity and pressure in the infinity norm, both inside the domain and on the immersed boundaries. The solver’s performance is further validated through a range of practical flow simulations, highlighting its efficiency over a second order scheme. Finally, we showcase the ability of our immersed discretization scheme to handle interface-coupled multiphysics problems by solving a conjugate heat transfer problem with multiple immersed solids. Overall, the proposed approach robustly combines the efficiency of high order discretization schemes with the flexibility of immersed discretizations for flow problems with complex, moving boundaries and interfaces.

42 ENGINEERING↗
DOE OSTI2025

An implementation of a high-order generalized finite difference method for solving the time-harmonic cold plasma wave equation in toroidal geometry

A high-order physics-informed meshless finite difference numerical technique is introduced for solving the time-harmonic cold plasma wave equation in toroidal geometries, presenting a novel application of the generalized finite difference (GFD) method to plasma wave simulations. The algorithm employs an irregular distribution of computational points, with local point density informed by the shortest wavelength derived from the cold plasma dispersion relation. Numerical stability and robustness are addressed using regularization techniques. The algorithm, implemented for two spatial dimensions, solves for the wave electric field and is demonstrated to achieve convergence rates of $\mathcal{O}$($\mathcal{h}$ $\mathcal{P}$ )⁠. Verification tests reproduce plane wave solutions, and example simulations of ion cyclotron resonance heating and electron cyclotron resonance heating demonstrate its capability, approaching realistic tokamak plasma scenarios. This work contributes to laying a foundation for the GFD method to be used in more sophisticated, optimized, and physically realistic full-wave simulations in time-harmonic plasma wave research.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

How Well Can Quantum Embedding Method Predict the Reaction Profiles for Hydrogenation of Small Li Clusters?

Quantum computing leverages the principles of quantum mechanics in novel ways to tackle complex chemistry problems that cannot be accurately addressed using traditional quantum chemistry methods. However, the high computational cost and available number of physical qubits with high fidelity limit its application to small chemical systems. This work employed a quantum-classical framework which features a quantum active space-embedding approach to perform simulations of chemical reactions that require up to 14 qubits. This framework was applied to prototypical example metal hydrogenation reactions: the coupling between hydrogen and Li 2 , Li 3 , and Li 4 clusters. Particular attention was paid to the computation of barriers and reaction energies. The predicted reaction profiles compare well with advanced classical quantum chemistry methods, demonstrating the potential of the quantum embedding algorithm to map out reaction profiles of realistic gas-phase chemical reactions to ascertain qualitative energetic trends. Additionally, the predicted potential energy curves provide a benchmark to compare against both current and future quantum embedding approaches.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Image-based modeling of coupled electro-chemo-mechanical behavior of Li-ion battery cathode using an interface-modified reproducing kernel particle method

Abstract An interface-modified reproducing kernel particle method (IM-RKPM) is introduced in this work to allow for a direct model construction from image pixels of heterogeneous polycrystalline Li-ion battery microstructures. The interface-modified reproducing kernel (IM-RK) approximation is constructed through scaling of a kernel function by a regularized distance function in conjunction with strategic placement of interface node locations. This leads to RK shape functions with either weak or strong discontinuities across material interfaces, suitable for modeling various interface mechanics. With the placement of a triple junction node and distance-based scaling of kernel functions, the resulting IM-RK shape function also possesses proper discontinuities at the triple junctions. This IM-RK approximation effectively remedies the well-known Gibb’s oscillation in the smooth approximation of discontinuities. Different from the conventional meshfree approaches for interface discontinuities, this IM-RK approach is done without additional degrees of freedom associated with the enrichment functions, and it is formulated with the standard procedures in the RK shape function construction. This work focuses on identifying the accuracy and convergence properties of IM-RKPM for modeling the coupled electro-chemo-mechanical system. A linear patch test is formulated and numerically tested for the electro-chemo-mechanical coupled problem with a Butler–Volmer boundary condition representing the physical conditions in Li-ion battery microstructures. This is followed by verification of the optimal rates of convergence of IM-RKPM for solving the coupled problem with higher order solutions. The image-based modeling of Li-ion battery microstructures in the numerical examples demonstrates the applicability of the proposed method to realistic Li-ion battery materials modeling.

25 ENERGY STORAGE↗
DOE OSTI2026

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing↗
DOE OSTI2025

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗
DOE OSTI2024

Stochastic finite volume method for uncertainty quantification of transient flow in gas pipeline networks

We develop a weakly intrusive framework to simulate the propagation of uncertainty in solutions of generic hyperbolic partial differential equation systems on graph-connected domains with nodal coupling and boundary conditions. The method is based on the Stochastic Finite Volume (SFV) approach and can be applied for uncertainty quantification (UQ) of the dynamical state of fluid flow over actuated transport networks. The numerical scheme has specific advantages for modeling intertemporal uncertainty in time-varying boundary parameters, which cannot be characterized by strict upper and lower (interval) bounds. We describe the scheme for a single pipe, and then formulate the controlled junction Riemann problem (JRP) that enables the extension to general network structures. In conclusion, we demonstrate the method's capabilities and performance characteristics using a standard benchmark test network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

3D mesh regularization within an ALE code using a weighted line sweeping method

The Lagrangian formalism is widely used to simulate hydrodynamic responses in complex engineering applications, particularly those involving strong shock waves. However, as the mesh moves with the fluid, it can become highly distorted, requiring a regularization step. This involves constructing a new grid and remapping conservative quantities onto it to restore mesh quality. This work introduces a regularization method for block-structured meshes within a 3D ALE (Arbitrary Lagrangian-Eulerian) code. The proposed approach prevents mesh tangling while preserving the anisotropic features of the initial Lagrangian mesh. This regularization technique incorporates aspect ratio-based weights to control mesh smoothing. Unlike uniform rezoning techniques, this weighted approach maintains proximity to the Lagrangian mesh while improving mesh quality. Here, the method effectively handles concave geometries by mitigating the grid attraction phenomenon, which typically leads to mesh concentration along concave edges. Numerical experiments demonstrate its efficiency in regularizing severely deformed meshes, and its integration within the ALE framework is validated on challenging hydrodynamic test cases, including the triple point problem.

42 ENGINEERING↗
DOE OSTI2025

Directional finite difference method for directly solving 3D gyrokinetic field equations with enhanced accuracy

The gyrokinetic (GK) field equation is a three-dimensional (3D) elliptic equation, but it is often simplified to a set of two-dimensional (2D) equations by assuming that the field does not vary along a specific direction. However, this simplification can introduce inevitable 0th-order numerical errors, as nonlinear mode coupling in toroidal geometry can produce undesirable harmonic modes that violate the assumption. In this work, we propose a novel directional finite difference method (FDM) with a local coordinate transformation to better resolve the target field of interest. The directional FDM can accurately solve 3D GK field equations without simplifications, which can overcome the limitations of conventional methods. The accuracy and efficiency of different FDMs are analyzed in great detail for a variety of geometries, from simple 2D Cartesian coordinates to realistic 3D curvilinear coordinates. The 0th-order numerical errors of simplified 2D GK equations were found to be more problematic for low-harmonic modes and low aspect ratio geometries such as spherical tokamaks. On the other hand, the directional 3D FDM can accurately resolve a much wider range of harmonic modes aligned to the direction of interest, including the low-harmonic modes. In conclusion, we demonstrate that the directional 3D FDM is a highly effective algorithm for solving the 3D GK field equations, achieving accuracy improvements of 10 to 100 times or more, particularly for low-harmonic modes in spherical tokamaks.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗