Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative 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 523 records · Page 29

Conservative streamtube solution of steady-state Euler equations

This paper presents a new method for solving the steady state Euler equations. The method is similar to streamline curvature methods but has a conserative finite volume formulation which ensures correct shock capturing. Either wall position or wall pressure may be prescribed as boundary conditions, permitting both direct and inverse calculations. In supersonic applications the solution is obtained by space-marching while in subsonic and transonic applications iterative relaxation methods are used. Numerical results are given for: (1) supersonic diffuser with oblique shocks (direct calculation); (2) supersonic jet entering still reservoir (inverse calculation); (3) subsonic bump in a channel with 25 percent blockage (direct and inverse); (4) subsonic high-work turbine cascade (direct); and (5) transonic bump in a channel with 12 percent blockage (direct calculation).

Drela, M.↗

Implementation of Perturbation Theory and Sensitivity Capabilities in Griffin

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor Multiphysics analysis application, jointly developed by Argonne and Idaho National Laboratories under the DOE-NE NEAMS program. This fiscal year, capabilities for reactivity and sensitivity evaluation using perturbation methods were implemented and verified. The First Order Perturbation Method (FOPT) was employed to compute reactivity worth resulting from small perturbations in input parameters, while the Generalized Perturbation Theory (GPT) was used to evaluate sensitivities of a range of response types, including reaction rate ratio, k-eigenvalue, neutron generation time, and effective delayed neutron fraction. These perturbation methods enable users to quantify how response quantities change due to a perturbation in a input parameter without explicitly performing an additional transport simulation for each perturbed state. In particular, the GPT formulation accounts for indirect effects arising from flux changes by solving generalized inhomogeneous equations, for which a Neumann series-based iterative solution method was developed and implemented in Griffin. The implemented reactivity and sensitivity evaluation capabilities were verified using two test problems: an infinite homogeneous system and a two-dimensional hexagonal core. The results showed excellent agreement with reference solutions obtained by a direct method based on finite difference approximation as well as GPT-based results from the PERSENT code, confirming the accuracy of both reactivity and sensitivity evaluations. Additionally, preliminary uncertainty quantification (UQ) results were obtained by combining the sensitivity values computed using GPT and external covariance data, demonstrating that the implemented sensitivity results can be reliably used for uncertainty calculations. To further demonstrate the generality and practical strength of the implementation, the sensitivity evaluation capability was successfully applied to the Empire microreactor with a geometrically complex design that poses significant modeling challenges. The results confirm that Griffin enables sensitivity evaluations even for irregular and highly heterogeneous reactor configurations, thereby establishing a foundation for UQ applications in advanced reactor designs and analyses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerating multigrid with streaming chiral SVD for Wilson fermions in lattice QCD

A modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD is presented. A larger basis of test vectors than that used in regular multigrid is calculated by the smoother and truncated by singular value decomposition on the chiral components of the test vectors. The truncated basis is used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification of the setup method is demonstrated to increase the convergence of linear solvers on an anisotropic lattice with m π ≈ 239 MeV from the Hadron Spectrum Collaboration and an isotropic lattice with m π ≈ 220 MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined. Increasing the number of test vectors improves speedup up to a point, but storing these vectors becomes impossible in limited memory resources such as GPUs. To address storage cost, we implement a streaming singular value decomposition of the basis of test vectors on the chiral components and demonstrate a decrease in the number of fine level iterations by a factor of 1.7 for m q ≈ m crit

Iterative methods↗

A computer program for wing subsonic aerodynamic performance estimates including attainable thrust and vortex lift effects

Numerical methods incorporated into a computer program to provide estimates of the subsonic aerodynamic performance of twisted and cambered wings of arbitrary planform with attainable thrust and vortex lift considerations are described. The computational system is based on a linearized theory lifting surface solution which provides a spanwise distribution of theoretical leading edge thrust in addition to the surface distribution of perturbation velocities. The approach used relies on a solution by iteration. The method also features a superposition of independent solutions for a cambered and twisted wing and a flat wing of the same planform to provide, at little additional expense, results for a large number of angles of attack or lift coefficients. A previously developed method is employed to assess the portion of the theoretical thrust actually attainable and the portion that is felt as a vortex normal force.

Carlson, H. W.↗

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Taylor, Arthur C., III↗

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↗

Quasi-Optimal Schwarz Methods for the Conforming Spectral Element Discretization

Fast methods are proposed for solving the system K(sub N)x = b resulting from the discretization of self-adjoint elliptic equations in three dimensional domains by the spectral element method. The domain is decomposed into hexahedral elements, and in each of these elements the discretization space is formed by polynomials of degree N in each variable. Gauss-Lobatto-Legendre (GLL) quadrature rules replace the integrals in the Galerkin formulation. This system is solved by the preconditioned conjugate gradients method. The conforming finite element space on the GLL mesh consisting of piecewise Q(sub 1) elements produces a stiffness matrix K(sub h) that is spectrally equivalent to the spectral element stiffness matrix K(sub N). The action of the inverse of K(sub h) is expensive for large problems, and is therefore replaced by a Schwarz preconditioner B(sub h) of this finite element stiffness matrix. The preconditioned operator then becomes B(sub h)(exp -l)K(sub N). The technical difficulties stem from the nonregularity of the mesh. Tools to estimate the convergence of a large class of new iterative substructuring and overlapping Schwarz preconditioners are developed. This technique also provides a new analysis for an iterative substructuring method proposed by Pavarino and Widlund for the spectral element discretization.

Casarin, Mario↗

Aircraft Conflict Analysis and Real-Time Conflict Probing Using Probabilistic Trajectory Modeling

Methods for maintaining separation between aircraft in the current airspace system have been built from a foundation of structured routes and evolved procedures. However, as the airspace becomes more congested and the chance of failures or operational error become more problematic, automated conflict alerting systems have been proposed to help provide decision support and to serve as traffic monitoring aids. The problem of conflict detection and resolution has been tackled from a number of different ways, but in this thesis, it is recast as a problem of prediction in the presence of uncertainties. Much of the focus is concentrated on the errors and uncertainties from the working trajectory model used to estimate future aircraft positions. The more accurate the prediction, the more likely an ideal (no false alarms, no missed detections) alerting system can be designed. Additional insights into the problem were brought forth by a review of current operational and developmental approaches found in the literature. An iterative, trial and error approach to threshold design was identified. When examined from a probabilistic perspective, the threshold parameters were found to be a surrogate to probabilistic performance measures. To overcome the limitations in the current iterative design method, a new direct approach is presented where the performance measures are directly computed and used to perform the alerting decisions. The methodology is shown to handle complex encounter situations (3-D, multi-aircraft, multi-intent, with uncertainties) with relative ease. Utilizing a Monte Carlo approach, a method was devised to perform the probabilistic computations in near realtime. Not only does this greatly increase the method's potential as an analytical tool, but it also opens up the possibility for use as a real-time conflict alerting probe. A prototype alerting logic was developed and has been utilized in several NASA Ames Research Center experimental studies.

Yang, Lee C.↗

Hierarchical Gaussian process-based Bayesian optimization for materials discovery in high entropy alloy spaces

Bayesian optimization (BO) is a powerful and data-efficient method for iterative materials discovery and design, particularly valuable when prior knowledge is limited, underlying functional relationships are complex or unknown, and the cost of querying the materials space is significant. Traditional BO methodologies typically utilize conventional Gaussian Processes (cGPs) to model the relationships between material inputs and properties, as well as correlations within the input space. However, cGP-BO approaches often fall short in multi-objective optimization scenarios, where they are unable to fully exploit correlations between distinct material properties. Leveraging these correlations can significantly enhance the discovery process, as information about one property can inform and improve predictions about others. Here, this study addresses this limitation by employing advanced kernel structures to capture and model multi-dimensional property correlations through multi-task (MTGPs) or deep Gaussian Processes (DGPs), thus accelerating the discovery process. We demonstrate the effectiveness of MTGP-BO and DGP-BO in rapidly and robustly solving complex materials design challenges that occur within the context of complex multi-objective optimization over FCC FeCrNiCoCu high entropy alloy (HEA) spaces, where traditional cGP-BO approaches fail. Furthermore, we highlight how the differential costs associated with querying various material properties can be strategically leveraged to make the materials discovery process more cost-efficient.

36 MATERIALS SCIENCE↗

Proton discrimination in CLYC for fast neutron spectroscopy

The Cs 2 LiYCl 6 :Ce (CLYC) elpasolite scintillator is known for its response to fast and thermal neutrons along with good γ-ray energy resolution. While the 35 Cl(n,p) reaction has been identified as a potential means for CLYC-based fast neutron spectroscopy in the absence of time-of-flight (TOF), previous efforts to functionalize CLYC as a fast neutron spectrometer have been thwarted by the inability to isolate proton interactions from 6 Li(n,α) and 35 Cl(n,α) signals. This work introduces a new approach to particle discrimination in CLYC for fission spectrum neutrons using a multi-gate charge integration algorithm that provides excellent separation between protons and heavier charged particles. Neutron TOF data were collected using a 252 Cf source, an array of EJ-309 organic liquid scintillators, and a 6 Li-enriched CLYC scintillator outfitted with fast electronics. Modal waveforms were constructed corresponding to the different reaction channels, revealing significant differences in the pulse characteristics of protons and heavier charged particles at ultrafast, fast, and intermediate time scales. These findings informed the design of a pulse shape discrimination algorithm, which was validated using the TOF data. This study also proposes an iterative subtraction method to mitigate contributions from confounding reaction channels in proton and heavier charged particle pulse height spectra, opening the door for CLYC-based fast neutron and γ-ray spectroscopy while preserving sensitivity to thermal neutron capture signals.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multireference Equation-of-Motion Driven Similarity Renormalization Group: Theoretical Foundations and Applications to Ionized States

We present a formulation and implementation of an equation-of-motion (EOM) extension of the multireference driven similarity renormalization group (MR-DSRG) formalism for ionization potentials (IP-EOM-DSRG). The IP-EOM-DSRG formalism results in a Hermitian generalized eigenvalue problem, delivering accurate ionization potentials for strongly correlated systems. The EOM step scales as O(N 5 ) with the basis set size N, allowing for efficient calculation of spectroscopic properties, such as transition energies and intensities. The IP-EOM-DSRG formalism is combined with three truncation schemes of the parent MR-DSRG theory: an iterative nonperturbative method with up to two-body excitations [MR-LDSRG(2)] and second- and third-order perturbative approximations [DSRG-MRPT2/3]. We benchmark these variants by computing (1) the vertical valence ionization potentials of a series of small molecules at both equilibrium and stretched geometries; (2) the spectroscopic constants of several low-lying electronic states of the OH, CN, N 2 + , and CO + radicals; and (3) the binding curves of low-lying electronic states of the CN radical. A comparison with experimental data and theoretical results shows that all three IP-EOM-DSRG methods accurately reproduce the vertical ionization potentials and spectroscopic constants of these systems. Notably, the DSRG-MRPT3 and MR-LDSRG(2) versions outperform several state-of-the-art multireference methods of comparable or higher cost.

Hamiltonians↗

Model-based iterative reconstruction with adaptive regularization for artifact reduction in electron tomography

Obtaining high-quality 3D reconstructions from electron tomography of crystalline particles embedded in lighter support elements is crucial for various material systems such as catalysts for fuel cell applications. However, significant challenges arise due to the limited tilt range, sparse and low signal-to-noise ratio of the measurements. In addition, small metal particles can cause strong streaking and shading artifacts in the 3D reconstructions when using conventional reconstruction algorithms due to the presence of Bragg diffraction and the large scattering cross-section difference between the materials of the particles and the background support regions. These artifacts lead to errors in the downstream characterization affecting extraction of critical features such as the size of the metal particles, their distribution and the volume of the lighter support regions. In this paper, we present a two-stage algorithm based on metal artifact reduction, utilizing model-based iterative reconstruction methods with adaptive adjustment of regularization parameters. Our approach yields high-quality 3D reconstructions compared to traditional algorithms, accurately capturing both the metal particles as well as the background support. We demonstrate the effectiveness of our algorithm through simulated and experimental bright-field electron tomography data, showing significant improvements in reconstruction quality compared to traditional methods.

97 MATHEMATICS AND COMPUTING↗

Modeling cross-beam energy transfer with sector ray tracing

Ray-based cross-beam energy transfer (CBET) models are an essential feature of the radiation-hydrodynamic codes used to simulate inertial confinement fusion implosions, but full 3D ray-based CBET calculations can have a prohibitively high computational cost. Sector ray tracing can be used to reduce the cost by orders of magnitude in cases where the coronal plasma and laser drive can be approximated as spherically symmetric. An extension of sector ray tracing (section ray tracing) can be used to relax the assumption of a spherically symmetric drive while still retaining most of the computational savings of a sector ray trace. We discuss the foundations of sector and section ray tracing and compare them to full ray tracing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Desmearing Bonse–Hart USANS data using Bayesian Gaussian process regression

Ultra-small-angle neutron scattering (USANS) enables access to micrometer-scale structures but is intrinsically affected by strong, anisotropic resolution smearing arising from slit-geometry optics. As a result, recovery of the intrinsic scattering intensity constitutes an ill-posed inverse problem, and commonly used iterative desmearing methods lack rigorous uncertainty quantification. We present a Bayesian desmearing framework for slit-geometry USANS based on Gaussian process regression. In this approach, the scattering intensity is modeled as a smooth random function, and the instrumental point spread function is incorporated explicitly as a forward operator. The resulting formulation yields a closed-form maximum a posteriori solution with well-defined credibility intervals. Computational benchmarks and experimental validation using combined USANS and small-angle neutron scattering (SANS) measurements demonstrate that the framework enables stable desmearing, suppresses experimental noise, and preserves physically meaningful structural features under realistic conditions.

Tung, Chi-Huan [Oak Ridge National Laboratory (ORN↗

The dual-electron cyclotron emission based measurement of 3D structures on DIII-D tokamak

The measurements of the locked mode and other 3D magnetohydrodynamic modes are essential for real-time control of plasma stability in future fusion reactors. Current magnetic measurements present non-negligible challenges for the application on fusion pilot plants (FPPs) due to neutron radiation and pose challenging design issues. In this paper, we discuss an alternative solution with microwave-based measurements. The dual-electron cyclotron emission (ECE) method has been developed and applied on DIII-D. The dual-ECE measurement method demonstrates clear identification of magnetic islands compared to single ECE, which is highly beneficial for locked mode feedback control on the FPPs. Toroidally separated ECE measurements provide accurate three-dimensional structure of magnetic islands and tearing modes. This technique also offers deeper physical insights into the penetration of resonant magnetic perturbations. Numerical calculations indicate that small locked modes (magnetic island width > 2 cm) can be detected using the dual-ECE measurement method in ITER plasma. This will enhance measurement capabilities for the safe operation of FPP plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Machine learning assisted unfolding for neutrino cross-section measurements with the OmniFold technique

The choice of unfolding method for a cross-section measurement is tightly coupled to the model dependence of the efficiency correction and the overall impact of cross-section modeling uncertainties in the analysis. A key issue is the dimensionality used in unfolding, as the kinematics of all outgoing particles in an event typically affect the reconstruction performance in a neutrino detector. OmniFold is an unfolding method that iteratively reweights a simulated dataset, using machine learning to utilize arbitrarily high-dimensional information, that has previously been applied to proton-proton and proton-electron datasets. This paper demonstrates OmniFold’s application to a neutrino cross-section measurement for the first time using a public T2K near detector simulated dataset, comparing its performance with traditional approaches using a mock data study.

Machine learning↗

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Generic Discretization Library

The GenDiL library is a collection of C++ software abstractions designed to discretize and solve partial differential equations (PDEs) for high-performance computing (HPC) applications. Its primary focus is on modern C++ generic programming, which helps ensure portability across various hardware architectures. The central idea behind the library is to provide building blocks for numerical algorithms-such as discretization methods and iteration patterns-so that domain experts can focus on the math, rather than the low-level details of hardware or implementation. By defining abstractions for data types, iteration over computational grids, and scheduling of operations, the library isolates the high-level PDE algorithms from the platform-specific optimizations needed to achieve efficient performance.

Dudouit, Yohann [Lawrence Livermore National Labor↗