Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative regularization”

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 37 records · Page 2

Efficient 3-D velocity model building using joint inline and crossline plane-wave wave-equation migration velocity analyses

SUMMARY Wave-equation migration velocity analysis (WEMVA) is an image-domain inversion method for velocity model building. Automatic plane-wave WEMVA (PWEMVA) calculates the moveouts of plane-wave common-image gathers (CIGs) by searching a best-fitting parabola with semblance analysis and backprojects residual CIG moveouts into wavefield wave paths with a reflection tomographic kernel. However, 3-D PWEMVA is very computationally expensive because 3-D reflection tomographic inversion requires at least five 3-D reverse-time migrations per iteration and stores two types of source wavefields at model boundaries. We develop a joint inline and crossline PWEMVA method for efficient 3-D velocity model building. We alternatively implement the inline and crossline PWEMVAs with a constraint for each other, in which we iteratively construct the 3-D velocity model update through 1-D spline interpolation of 2-D gradients. The inline and crossline joint inversion is practical since PWEMVA only inverts for low-wavenumber velocity perturbations along wave paths, and the method can take less than 1 per cent of the computational cost of full 3-D PWEMVA. To construct unaliased plane waves for our joint inline and crossline PWEMVA, we develop a 3-D data interpolation method in the frequency–wavenumber (FK) domain to recover regularly and randomly missing traces. The method minimizes the misfit on sufficiently localized data subsets with iterative optimal step lengths and a gradient preconditioner that iteratively selects dominant dips along different azimuths. In numerical experiments, we use a 3-D synthetic seismic data set and a land 3-D field seismic data set acquired at the Farnsworth CO2-EOR (enhanced oil recovery) field to demonstrate the efficacy of our velocity model building and data interpolation methods.

Liu, Xuejian↗

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗

srMO-BO-3GP: A sequential regularized multi-objective Bayesian optimization for constrained design applications using an uncertain Pareto classifier

Bayesian optimization (BO) is an efficient and flexible global optimization framework that is applicable to a very wide range of engineering applications. To leverage the capability of the classical BO, many extensions, including multi-objective, multi-fidelity, parallelization, and latent-variable modeling, have been proposed to address the limitations of the classical BO framework. In this work, we propose a novel multi-objective BO formalism, called srMO-BO-3GP, to solve multi-objective optimization problems in a sequential setting. Three different Gaussian processes (GPs) are stacked together, where each of the GPs is assigned with a different task. The first GP is used to approximate a single-objective computed from the multi-objective definition, the second GP is used to learn the unknown constraints, and the third one is used to learn the uncertain Pareto frontier. At each iteration, a multi-objective augmented Tchebycheff function is adopted to convert multi-objective to single-objective, where the regularization with a regularized ridge term is also introduced to smooth the single-objective function. Finally, we couple the third GP along with the classical BO framework to explore the convergence and diversity of the Pareto frontier by the acquisition function for exploitation and exploration. The proposed framework is demonstrated using several numerical benchmark functions, as well as a thermomechanical finite element model for flip-chip package design optimization.

42 ENGINEERING↗

Efficient QAOA Optimization using Directed Restarts and Graph Lookup

Variational Quantum Algorithms (VQA) aim to enhance the capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices. These algorithms utilize parameterized circuits and classical optimizers to iteratively execute circuits with varying parameters. However, VQA faces computational overheads due to repeated iterations and random restarts. Prior work suggests using basic sub-graphs to transfer parameters for the input graph, reducing optimizer overheads but limiting applicability to structured regular graphs. In real-world applications, random irregular graphs are common, and existing methods are not scalable or practical for such graphs. This paper presents a framework that aims to improve random irregular graphs in VQA. The framework uses graph similarity and important features like total edge counts, average edge counts, and variance. It follows an iterative process to choose basis sub-graphs from a small database and adjust parameters accordingly. Classical optimizers then utilize these parameters to determine when to restart and perform gradient descent. This approach increases the chances of reaching global maximum points.

Wang, Meng↗

Automated shaker placement and regularized input estimation for MIMO testing.

Multi-input, multi-output (MIMO) testing is used in component qualification to reproduce operational responses in the laboratory. It is often preferred to single-input and base-shake testing because of the potential for equivalent or better tests using smaller actuators and shorter test suites. Given a target response, two key steps in MIMO test design are selecting actuator locations and solving for input loads. Actuator locations are often manually selected using expert judgment. If an automatic method is used, locations are usually determined by simulating the vibration control problem and minimizing a combination of the input energy and control residuals. To select a configuration, the relative importance of input energy and residuals must be specified. Specifying relative weights is, in general, a manual and subjective process. This paper develops an objective function that compares actuator configurations based on control accuracy and required input energy without any manual parameter tuning. The objective function uses an optimally selected tradeoff parameter for each candidate configuration. To choose actuator locations using the new objective function, a pivoting algorithm for integer programming problems is developed. Starting with an initial configuration (such as the one generated by a greedy algorithm), the pivoting algorithm guarantees an objective function decrease in each iteration until convergence is reached. In a simulation featuring a structure excited by a diffuse acoustic field, electrodynamic shaker locations and regularized inputs are solved for without any analyst-specified parameters. Simulations are performed in MIMO configurations where the number of target responses is less than, equal to, and greater than the number of actuators.

Multi-input multi-output↗

Evolution of ELMs, pedestal profiles and fluctuations in the inter-ELM period in NBI and ECH dominated discharges in DIII-D

In DIII-D, it has been observed that ELM frequency decreases by 40% and ELM spacing becomes more regular in time when heating is changed from pure neutral beam injection (NBI) to predominantly electron cyclotron heating (ECH) in ITER Similar Shape plasmas. In comparison with pure the NBI discharges, pedestal fluctuations in magnetics and density increase in the ECH dominated discharges. Recovery of the pedestal profiles like electron density (ne), temperature (Te) and pressure (pe) shows marked differences for these two heating schemes. Average profiles in the last 30% of the ELM cycle shows higher Te, lower ne, and similar pe at the pedestal top for the ECH discharge when compared to the NBI discharge. Here, the gradient of Te (∇Te) is also steeper at the pedestal in the ECH discharge. Magnetic fluctuations show 3 distinct modes in 13~116 kHz in the ECH discharges only. ne fluctuations show two modes evolving in the inter-ELM period of the ECH discharge, a low frequency (400 kHz) quasi-coherent mode (LFQC) and high frequency (~2 MHz) broadband (HFB) fluctuations. Evolution of these modes has marked correspondence with the inter-ELM ∇Te recovery. A sharp decrease in the Dα baseline is observed whenever the LFQC weakens and the HFB grows, prior to each large ELM. Transport coefficients obtained from TRANSP shows that MTM and/or TEM are plausible candidates for the observed fluctuations. Linear gyrofluid simulation (TGLF) corroborates this characterization. TGLF shows that the linear growth rate of the most dominant mode peaks at ion-scale (kθρs ~ 0.4) at the pedestal steep gradient and the frequency is in the electron diamagnetic direction. It is proposed that increased fluctuations in the ECH dominated case, due to increased ∇Te, caused an increase in fluctuation-driven transport in the pedestal and slowed the pedestal recovery between ELMs, leading to a reduction in the ELM frequency.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical Investigation of Fluid Flow and Space Charge in Liquid Argon Time Projection Chamber (LArTPC) Detectors

Overview This project focused on developing a high-fidelity numerical framework to simulate the multiphysics environment within Liquid Argon Time Projection Chamber (LArTPC) detectors. The primary objective was to characterize the complex interplay between ion transport, background fluid dynamics, and electric field distortions—a critical factor for the calibration and sensitivity of next-generation High Energy Physics experiments, such as DUNE. Technical Achievements The research successfully yielded a hybrid numerical space-charge solver utilizing a Cell-Centered Finite Volume Method (FVM) for ion transport coupled with a Finite Element Method (FEM) for electric potential. Key accomplishments include: • Verification & Validation: The 3-D solver was rigorously verified against 1-D analytical solutions, demonstrating high numerical accuracy in predicting space-charge-induced field deviations. • Field Distortion Analysis: 3D simulations revealed that space charge effects introduce significant non-uniformities in the electric field. Critically, the research identified that background LAr flow velocities, when comparable to ion drift velocities, markedly exacerbate these distortions. • Technology Transfer: The resulting source code and comprehensive user manuals were successfully transferred to collaborators at Fermilab, providing a portable computational tool for the broader scientific community. Challenges and Future Directions While the space-charge solver achieved all performance metrics, the integrated fluid dynamics modeling encountered convergence challenges stemming from the extreme 200-fold disparity in length scales between the detector's 37 mm inlet pipes and the 8-meter global domain. To address this, the project has identified a clear technical pivot toward Hierarchical Geometric Adaptive Mesh Refinement (HG-AMR). By implementing an h-type refinement strategy with hanging nodes, future iterations of this solver will be capable of resolving localized high-gradient inlet flows without the prohibitive computational costs of regular grids. This advancement, combined with data-driven uncertainty quantification based on MicroBooNE-style calibration, will enable the precise modeling of detector responses in large-scale cryogenic environments where direct measurement remains difficult. Impact The computational tools developed under this award provide a foundation for enhancing the energy resolution and spatial reconstruction of noble liquid detectors. By bridging the gap between theoretical fluid dynamics and experimental field calibration, this work supports the DOE’s mission to advance the frontiers of neutrino physics and dark matter detection.

42 ENGINEERING↗

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Synthesis and Self-Assembly of Monodisperse Graphene Nanoribbons: Access to Submicron Architectures with Long-Range Order and Uniform Orientation

Fabricating organic semiconducting materials into large-scale well-organized architectures is critical for building high performance molecular electronics. While graphene nanoribbons (GNRs) hold enormous promise for various device applications, their assembly into a well-structured monolayer or multilayer architecture poses a substantial challenge. Here we report the preparation of length-defined monodisperse GNRs via the integrated iterative binomial synthesis (IIBS) strategy and their self-assembly into submicron-architectures with long-range order, uniform orientation as well as regular layers. Further, the use of short alkyl side chains benefits forming stable multi-layers through interlocking structures. By changing the length and backbone shapes of these monodisperse GNRs, various three-dimensional assemblies including multilayer stripes, monolayer stripes, and nanowires, can be achieved, leading to different photophysical properties and band gaps. The discovery of these intriguing self-assembly behaviors of length-defined GNRs is expected to open the door for various future applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

National Solar Jobs Accelerator (Final Technical Report (FTR))

The aptitudes and experiences gained through military service—such as dynamic leadership, teamwork and critical thinking skills, technical specialization, and a mission-completion work ethic—make veterans exceptional candidates for a wide range of solar energy careers. The solar industry offers a highly collaborative and purpose-driven work environment that resonates with service members and veterans looking to rise to their next challenge, and solar employers are eager to tap into this valuable talent pool. From October 2019 - February 2023, The National Solar Jobs Accelerator (publicly the Solar Ready Vets Network TM (SRV Network; SRVN)) enhanced and streamlined options for military service members and veterans to pursue solar training, certification, and employment, while advancing solar employers’ efforts and capacity to invest in military talent as part of a long-term workforce development strategy. The SRVN was led by the Interstate Renewable Energy Council (IREC) in partnership with the Solar Energy Industries Association (SEIA), the US Chamber of Commerce Foundation’s Hiring Our Heroes program (HOH) and the North American Board of Certified Energy Practitioners (NABCEP). Through several direct-impact and indirect, high-impact capacity building initiatives aligned with six key objectives, the SRV Network strengthened solar career pathways, and promoted increased representation of military talent across all levels and sectors of the solar workforce. A work-based learning Corporate Fellowship model connected transitioning service members with on-the-job experience in leadership roles with solar employers nationwide. The project advanced broader veteran recruitment and talent development by expanding GI Bill eligibility and streamlining veterans’ pathways for solar training and credentialing, supported direct connections to jobs with top solar employers, and led coordination among key education and industry partners to advance registered apprenticeships aligned with solar career pathways. To ensure that the project best served the needs of all stakeholders, an Advisory Committee of military-connected solar professionals, solar employers, and training providers met biannually to guide project activities and sustainability plans. The project team engaged the broader “SRV Network” (comprised of over 2,000 veterans, employers and training organizations) through regular newsletters and targeted outreach to share resources, hiring fairs, webinars, and other opportunities for engagement. The work done under this award builds on the previous iterations of the Department of Energy’s Solar Ready Vets ® program. As the solar industry continues to grow rapidly over the next decade, the military community will continue to be a highly valuable source of talent. The relationships established and work accomplished through this project will have an enduring positive impact well beyond the funding period.

14 SOLAR ENERGY↗

Quantum Local Search with the Quantum Alternating Operator Ansatz

We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set problem and demonstrate the ability of quantum local search to solve large problem instances on quantum devices with few qubits. This hybrid algorithm iteratively finds independent sets over carefully constructed neighborhoods and combines these solutions to obtain a global solution. We study the performance of this algorithm on 3-regular, Community, and Erdős-Rényi graphs with up to 100 nodes.

Tomesh, Teague↗

Combining shallow-water and analytical wake models for tidal array micro-siting

For tidal-stream energy to become a competitive renewable energy source, clustering multiple turbines into arrays is paramount. Array optimisation is thus critical for achieving maximum power performance and reducing cost of energy. However, ascertaining an optimal array layout is a complex problem, subject to specific site hydrodynamics and multiple inter-disciplinary constraints. In this work, we present a novel optimisation approach that combines an analytical-based wake model, FLORIS, with an ocean model, Thetis. The approach is demonstrated through applications of increasing complexity. By utilising the method of analytical wake superposition, the addition or alteration of turbine position does not require re-calculation of the entire flow field, thus allowing the use of simple heuristic techniques to perform optimisation at a fraction of the computational cost of more sophisticated methods. Using a custom condition-based placement algorithm, this methodology is applied to the Pentland Firth for arrays with turbines of 3.05 m/s rated speed, demonstrating practical implications whilst considering the temporal variability of the tide. For a 24-turbine array case, micro-siting using this technique delivered an array 15.8% more productive on average than a staggered layout, despite flow speeds regularly exceeding the rated value. Performance was evaluated through assessment of the optimised layout within the ocean model that treats turbines through a discrete turbine representation. Used iteratively, this methodology could deliver improved array configurations in a manner that accounts for local hydrodynamic effects.

16 TIDAL AND WAVE POWER↗

Filtered Backprojection in Compton Imaging using a Spherical Harmonic Wiener Filter with Pixelated CdZnTe

Filtered backprojection is an image reconstruction technique for Compton imaging that provides reasonably high resolution at much lower computational costs when compared to iterative methods. Here, this work applies a Wiener filter that has been derived for spherical harmonics on Compton imaging using the OrionUM pixelated CdZnTe imaging-spectrometer. To regularize the filter, an investigation is made into the power spectral density of the signal and noise to develop an appropriate spectral signal-to-noise ratio model for the restoration process. Experimental measurements were conducted with two 228Th sources placed 30° apart. The resulting filtered image of the two sources have an average full-width-at-half-maximum (FWHM) of 9.8° or 7.5° when using a mean squared error and structural similarity optimization approach respectively; an improvement from the 29.0° FWHM image when using simple backprojection.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reducing Artifacts in BF and HAADF-STEM Images of Pt/C Fuel Cells using MBIR-ARAR

Electron tomography is a powerful tool for characterization of three-dimensional (3D) nanoscale materials and devices. Bright-field (BF) and high-angle annular dark-field (HAADF) scanning transmission electron microscopy (STEM) are two widely used imaging modes in electron tomography. These imaging modalities have proven to be useful for characterizing the structure of carbon-supported platinum (Pt/C) electrocatalysts used in fuel cells, which are an important class of clean energy conversion systems. BF and HAADF-STEM images are typically simultaneously acquired due to the complementary information they contain, as BF-STEM is more suitable for characterizing carbon due to its ability to detect lighter elements, while HAADF-STEM is more suitable for characterizing platinum due to its sensitivity to atomic number. However, the quality of BF- and HAADF-STEM images is often compromised by various artifacts, such as local blurring due to abrupt contrast changes as well as missing wedge artifacts which can severely impact the accuracy of the reconstructed 3D images. The traditional methods of reconstruction, such as Filtered Back-projection (FBP), Simultaneous Iterative Reconstruction Technique (SIRT), and Model-Based Iterative Reconstruction (MBIR), are often not suitable for removing these artifacts effectively. Here, to address this challenge, we present a novel approach called MBIR with Artifact Reduction and Adaptive Regularization (MBIR-ARAR).

25 ENERGY STORAGE↗

Particulate Fuel Modeling of MC 2 -3 using Iterative Local Spatial Self-shielding Method

We report a new spatial self-shielding method for particulate fuels has been developed based on disadvantage factors and implemented in the MC 2 -3 code. This method named the iterative local spatial self-shielding (ILSS) method considers the shadowing effect of randomly distributed particles on spatial self-shielding in particles through a homogenized composition region added outside the particle of interest at the center. The self-shielded cross sections of the central particle are determined iteratively since they are used in determining the cross sections of the homogenized composition region. The ILSS method was verified for infinite stochastic medium problems of single and multiple types of particles, VHTR unit cell problems, and HTTR assembly problems. The verification test results show that the ILSS method accurately predicts the stochastic particle shadowing effect and reaction rates in particles, whereas the regular array model and the stochastic collision probability method underpredict the particle shadowing effect and overestimate reaction rates in particles.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Unfolding quantum computer readout noise

Abstract In the current era of noisy intermediate-scale quantum computers, noisy qubits can result in biased results for early quantum algorithm applications. This is a significant challenge for interpreting results from quantum computer simulations for quantum chemistry, nuclear physics, high energy physics (HEP), and other emerging scientific applications. An important class of qubit errors are readout errors. The most basic method to correct readout errors is matrix inversion, using a response matrix built from simple operations to probe the rate of transitions from known initial quantum states to readout outcomes. One challenge with inverting matrices with large off-diagonal components is that the results are sensitive to statistical fluctuations. This challenge is familiar to HEP, where prior-independent regularized matrix inversion techniques (“unfolding”) have been developed for years to correct for acceptance and detector effects, when performing differential cross section measurements. We study one such method, known as iterative Bayesian unfolding, as a potential tool for correcting readout errors from universal gate-based quantum computers. This method is shown to avoid pathologies from commonly used matrix inversion and least squares methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗