Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An iterative method to deblend AGN-Host contributions for Integral Field spectroscopic observations

ABSTRACT We present a new iterative deblending method to separate the host galaxy (HG) and their Active Galactic Nuclei (AGNs) emission with the use of Integral Field spectroscopic (IFS) data. The method decomposes the resolved HG emission from the unresolved AGN emission by modelling the two-dimensional surface brightness (SB) profile of the point-spread function (PSF) and the two-dimensional SB HG continuum simultaneously per each monochromatic slide. Our method does not require any prior information about the observed SB profile or a detailed fitting of the PSF, making it ideal for the automatic analysis of large galaxy samples. In this work, we test the quality of our method, its advantages, and its disadvantages. We test our method by using a set of IFS mock data cubes to quantify the reliability of our deblending process and further compare our method with the qdblend3d analysis tool. Furthermore, we applied our method to three data cubes selected from the MaNGA survey according to the dominance of either its HG or its AGN. We show that our deblending method is capable of disengaging the bright, non-resolved AGN emission from the HG continuum and its narrow emission lines. However, the decoupling depends on how well the IFS spatially resolves the PSF, and on the relative flux intensity of the HG-AGN. Therefore, the method is ideal for disentangling the bright-flux contribution from AGN-dominated spectra.

Ibarra-Medel, H. (ORCID:0000000297906313)↗
DOE OSTI2024

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A simulation study of the ability to detect power distribution perturbations in the texas A&M TRIGA reactor with self-powered neutron detectors

Given the variety of ways that nuclear reactor core power may be perturbed, reactor operators and developers are keen on understanding the accuracy and convergence time during which perturbations in reactor power distribution may be synthesized (i.e., inferred) from an array of in-core radiation detectors. A simulation study was conducted as described herein using a highly detailed model of the Texas A&M Training, Research, Isotopes, General Atomics Reactor, in which an array of self-powered neutron detectors (SPNDs) was considered for input to the power synthesis methodology. The core power synthesis is conducted using a point-based iterative method with an iterative loop built in to ensure working equation consistency. The forward problem of SPND response to simulated perturbations in reactor power was solved for Gaussian peak-type perturbations in the reactor power distribution. These perturbations varied in variance, amplitude, and core location to assess their impact on synthesis error and to determine the number of iterations required for convergence. A relation between the unique resolvability limit and perturbation width was identified such that the maximum synthesis error increased rapidly when the peak width went beneath this limit (a width approximating half the reactor’s fuel pin-to-pin pitch); this resolvability limit is specific to the SPND configuration and fuel segmentation considered herein. The synthesis error increased linearly with perturbation peak amplitude, whereas the convergence time increased nonlinearly. Perturbations located closer to the center of the core were synthesized more accurately, albeit with a higher number of required iterations. These findings provide a qualitative and quantitative understanding of the accuracy and speed at which different types of spatial power perturbations can be resolved in light-water reactors.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Detailed Characterization of CZT Detector Response for Improved Coded-Aperture Imaging Performance

Gamma-ray imaging is a powerful method for locating and quantifying sources of radiation. The coded-aperture technique demonstrates superior angular resolution in comparison to other methods (e.g., Compton reconstruction). In this method, a mask constructed of highly attenuating material encodes the scene as a shadow pattern on a position-sensitive detector; this pattern can then be used to recreate the origin(s) of incident radiation. This is typically done through convolution of the mask and shadow patterns. Iterative methods which attempt to reconstruct the observed shadow pattern using a weighted combination of simulated patterns may also be employed. In either case, errors in event position reconstruction due to detector imperfections alter the shadow pattern and will therefore degrade system performance and may introduce imaging artifacts. These effects can be mitigated with a detailed understanding of such errors – allowing for the generation of representative simulations that include the errors and/or correction of raw imager data to remove the errors. We present a calibration process for a commercially available cadmium zinc telluride (CZT) gamma imager which provides a comprehensive characterization of the spatial and energy dependence of event reconstruction. By illuminating a mask featuring a regular grid of pinholes with a calibration source, the localized response of the detector can be measured with fine granularity. These local responses are combined to generate a full detector response map which can be used to distort simulations in a manner that is representative of the observed detector data. Details of the calibration procedure and an assessment of the impact of its end products on the performance of iterative imaging methods will be presented.

Ziock, Klaus-Peter↗
DOE OSTI2025

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Accurate Ultrasonic Thickness Measurement for Arbitrary Time-Variant Thermal Profile

Ultrasonic thickness measurement of mechanical structures is one of the most popular and commonly used nondestructive methods for various kinds of process control and corrosion monitoring. With ultrasonic propagation speed being temperature-dependent, the thickness measurement can be performed reliably only when the thermal profile is completely known. Most conventional techniques assume the temperature of the test structure is uniform and at room temperature across its thickness. Such assumptions may lead to large errors in the thickness measurement, especially when there are significant temperature variations across the thickness. State-of-the-art techniques use external temperature measurements or implement iterative methods to compensate for the unknown thermal profiles. However, such techniques produce unsatisfactory results when the heat distribution is complex or varies rapidly with time. In this work, we propose a two-sensors technique, using both compressive and shear excitations, with a non-iterative rapid data processing method for accurate thickness measurement under arbitrary time-variant thermal profile. The independent behavior of shear and compressive waves is used to formulate a real-time thickness estimation technique. The developed technique is experimentally validated on a steel plate with fixed acoustic sensors. Test results show that the error in thickness estimation can be reduced by up to 98% compared to conventional thickness gauging methods.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Equilibrium core modeling of a pebble bed reactor similar to the Xe-100 with SCALE

As the nuclear industry moves towards licensing and constructing advanced reactors, new attention has been focused on the advanced reactor designs that have past operational experience, such as pebble-bed high-temperature gas-cooled reactors (PB-HTGRs). Pebble-bed reactor designs have many advantages, such as their higher operating temperatures and online refueling capabilities. However, high-fidelity computational modeling of pebble-bed reactor designs, from reactor startup to operation at equilibrium, is more challenging compared to conventionally fueled reactors due to the continuous movement of the fuel pebbles through the reactor during operation. In previous work at Oak Ridge National Laboratory (ORNL), the SCALE Leap-In method for Cores at Equilibrium (SLICE) was developed around tools within the SCALE code system. This iterative method can effectively generate pebble-bed reactor zone-wise fuel inventories at equilibrium core operation within a reasonable computational time. The objective of this work was to further verify the ORNL SLICE method and to investigate the impact of considering temperature profiles during the application of the method. The SLICE method was applied to a modular high-temperature gas-cooled reactor design based upon publicly available design specifications of the Xe-100 pebble-bed reactor. Upon comparing the results from the SLICE method to published literature, the differences in the eigenvalue k effective were on the order of several hundred pcm (percent millirho). To investigate one possible cause of these differences, a study looking at the sensitivity of the full-core equilibrium k effective and discharge nuclide inventory to temperature was performed by developing equilibrium cores of two additional temperature profiles. From this temperature study, differences on the order of hundreds of pcm for the full-core equilibrium k effective , and up to 15% difference for the discharge inventories were found. In conclusion, these results indicated the strong dependence on temperature that needs to be considered for future work in equilibrium modeling of PB-HTGRs.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Super Resolving Unrolled Neural Networks for Remote Sensing

In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

Lyapunov-Based Iterative Learning of Regions of Attraction for Autonomous Systems

This paper proposes a novel algorithm for estimating the region of attraction of equilibrium points for nonlinear discrete-time autonomous systems. The method iteratively expands an initial estimate of the region of attraction by constructing unions of sublevel sets of learned functions parametrized as neural networks. Unlike conventional techniques that rely on a single global Lyapunov function, the proposed approach provides a collection of local Lyapunov-like functions, enabling richer representations and potentially larger region of attraction estimates. These functions are trained using sampled state-space data, and their Lipschitz continuity ensures that desirable properties extend beyond the training samples. The devised strategy is tested via numerical simulations, demonstrating the effectiveness of the proposed approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Lyapunov-Based Iterative Learning of the Region of Attraction for Autonomous Systems

This presentation introduces a novel algorithm for estimating the region of attraction of equilibrium points for nonlinear discrete-time autonomous systems. The method iteratively expands an initial estimate of the region of attraction by constructing unions of sublevel sets of learned functions parametrized as neural networks. Unlike conventional techniques that rely on a single global Lyapunov function, the proposed approach provides a collection of local Lyapunov-like functions, enabling richer representations and potentially larger region of attraction estimates. These functions are trained using sampled state-space data, and their Lipschitz continuity ensures that desirable properties extend beyond the training samples. The devised strategy is tested via numerical simulations, demonstrating the effectiveness of the proposed approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Joint state-parameter estimation for the reduced fracture model via the united filter

Here, in this paper, we introduce an effective United Filter method for jointly estimating the solution state and physical parameters in flow and transport problems within fractured porous media. Fluid flow and transport in fractured porous media are critical in subsurface hydrology, geophysics, and reservoir geomechanics. Reduced fracture models, which represent fractures as lower-dimensional interfaces, enable efficient multi-scale simulations. However, reduced fracture models also face accuracy challenges due to modeling errors and uncertainties in physical parameters such as permeability and fracture geometry. To address these challenges, we propose a United Filter method, which integrates the Ensemble Score Filter (EnSF) for state estimation with the Direct Filter for parameter estimation. EnSF, based on a score-based diffusion model framework, produces ensemble representations of the state distribution without deep learning. Meanwhile, the Direct Filter, a recursive Bayesian inference method, estimates parameters directly from state observations. The United Filter combines these methods iteratively: EnSF estimates are used to refine parameter values, which are then fed back to improve state estimation. Numerical experiments demonstrate that the United Filter method surpasses the state-of-the-art Augmented Ensemble Kalman Filter, delivering more accurate state and parameter estimation for reduced fracture models. This framework also provides a robust and efficient solution for PDE-constrained inverse problems with uncertainties and sparse observations.

Bayesian inference↗
DOE OSTI2024

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Simulation of an inductively coupled plasma with a two-dimensional Darwin particle-in-cell code

A two-dimensional particle-in-cell code for the simulation of low-frequency electromagnetic processes in laboratory plasmas has been developed. The code uses the Darwin method omitting the electromagnetic wave propagation. The Darwin method separates the electric field into solenoidal and irrotational parts. The solenoidal electric field is calculated with a new algorithm based on the equation for the electric field vorticity. The system of linear equations in the new algorithm is readily solved using a standard iterative method. The irrotational electric field is the electrostatic field calculated with the direct implicit algorithm. The code is verified by reproducing the two-stream instability, electron electromagnetic waves, and shear Alfvén waves. The code is applied to simulate an inductively coupled plasma with the driving current flowing around the plasma region. In this simulation, a ring of dense plasma forms at the initial stage but then the density becomes maximal in the center and decays monotonically toward the walls. The skin effect is in the transitional mode between local and non-local, and the electron velocity distribution function is non-Maxwellian.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Fermilab Booster loss modelling and rebalancing using Bayesian methods

Fermilab Booster is being upgraded for the PIP-II project to support 20Hz ramp rate at higher intensities. Loss trip limits determine the achievable peak power. To meet PIP-II requirements, losses need to be halved as compared to current levels. Losses primarily occur at injection and transition crossing, with both gradually increasing and threshold-like intensity-dependent behaviors. The existing simulation models are not yet good enough for quantitative loss predictions. In practice, it will be necessary to tune up the Booster using iterative methods and operator intuition. In this paper we present an effort to systematically model Booster losses using active learning (Bayesian exploration) techniques, and subsequently to rebalance them for higher trip limit margins. We first created several sets of spatially and temporally isolated orbit and optics knobs, and trained Gaussian process models for each beam loss monitor as well as beam current. This is a complex task due to safety and timing requirements – we discuss mitigations such as uncertainty constraints and approximate fitting. Once models are stable, we perform large-scale single and multi-objective tuning using scalarized objectives made up of critical beam loss locations. Our results demonstrate significant rebalancing of losses, increasing trip margins, as well as an overall improvement in beam transmission efficiency. We are exploring how to combine existing simulations with experimental data and automate the collection procedure so that more advanced surrogate models can be created over time.

Kuklev, Nikita [Fermilab]↗
DOE OSTI2024

Score-based denoising for atomic structure identification

We propose an effective method for removing thermal vibrations that complicate the task of analyzing complex dynamics in atomistic simulation of condensed matter. Our method iteratively subtracts thermal noises or perturbations in atomic positions using a denoising score function trained on synthetically noised but otherwise perfect crystal lattices. The resulting denoised structures clearly reveal underlying crystal order while retaining disorder associated with crystal defects. Purely geometric, agnostic to interatomic potentials, and trained without inputs from explicit simulations, our denoiser can be applied to simulation data generated from vastly different interatomic interactions. The denoiser is shown to improve existing classification methods, such as common neighbor analysis and polyhedral template matching, reaching perfect classification accuracy on a recent benchmark dataset of thermally perturbed structures up to the melting point. Demonstrated here in a wide variety of atomistic simulation contexts, the denoiser is general, robust, and readily extendable to delineate order from disorder in structurally and chemically complex materials.

36 MATERIALS SCIENCE↗
DOE OSTI2025

An FFT-based micromechanical model for gradient enhanced brittle fracture

Damage models incorporated within FFT-based micromechanical methods have received much attention recently because of the need to better understand and predict brittle and ductile fracture. An important aspect of a damage model is non-local regularization, which removes the mesh dependence of the predictions that otherwise become physically unacceptable upon grid refinement. In this work, the Helmholtz-type equation for non-local gradient regularization of a damage model on a distorted grid is solved using an FFT-based approach. Further, the resulting system of equations is solved using the Jacobi iterative method. The model is applied to simulate brittle fracture of an intermetallic. The influence of the time and space discretization, the length-scale parameter, and intermetallic crystallographic orientation on crack evolution is studied.

36 MATERIALS SCIENCE↗