Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient 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 415 records · Page 23

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accurate modeling of switched reluctance machine based on hybrid trained WNN

According to the strong nonlinear electromagnetic characteristics of switched reluctance machine (SRM), a novel accurate modeling method is proposed based on hybrid trained wavelet neural network (WNN) which combines improved genetic algorithm (GA) with gradient descent (GD) method to train the network. In the novel method, WNN is trained by GD method based on the initial weights obtained per improved GA optimization, and the global parallel searching capability of stochastic algorithm and local convergence speed of deterministic algorithm are combined to enhance the training accuracy, stability and speed. Based on the measured electromagnetic characteristics of a 3-phase 12/8-pole SRM, the nonlinear simulation model is built by hybrid trained WNN in Matlab. The phase current and mechanical characteristics from simulation under different working conditions meet well with those from experiments, which indicates the accuracy of the model for dynamic and static performance evaluation of SRM and verifies the effectiveness of the proposed modeling method.

97 MATHEMATICS AND COMPUTING↗

Dosimetric evaluation of three adaptive strategies for prostate cancer treatment including pelvic lymph nodes irradiation

Purpose: The movements of the prostate relative to the pelvic lymph nodes during intensity-modulated radiation therapy treatment can limit margin reduction and affect the protection of the organs at risk (OAR). In this study, the authors performed an analysis of three adaptive treatment strategies that combine information from both bony and gold marker registrations. The robustness of those treatments against the interfraction prostate movements was evaluated. Methods: A retrospective study was conducted on five prostate cancer patients with 7–13 daily cone-beam CTs (CBCTs). The clinical target volumes (CTVs) consisting of pelvic lymph nodes, prostate, and seminal vesicles as well as the OARs were delineated on each CBCT and the initial CT. Three adaptive strategies were analyzed. Two of these methods relied on a two-step patient positioning at each fraction. First step: a bony registration was used to deliver the nodal CTV prescription. Second step: a gold marker registration was then used either to (1) complete the dose delivered to the prostate (complement); (2) or give almost the entire prescription to the prostate with a weak dose gradient between the targets to compensate for possible motions (gradient). The third method (COR) used a pool of precalculated plans based on images acquired at previous treatment fractions. At each new fraction, a plan is selected from that pool based on the daily position of prostate center-of-mass. The dosimetric comparison was conducted and results are presented with and without the systematic shift in the prostate position on the CT planning. The adaptive strategies were compared to the current clinical standard where all fractions are treated with the initial nonadaptive plan. Results: The minimum daily prostate D{sub 95%} is improved by 2%, 9%, and 6% for the complement, the gradient, and the COR approaches, respectively, compared to the nonadaptive method. The average nodal CTV D{sub 95%} remains constant across the strategies, except for the gradient approach where a reduction of 7% is observed. However, a correction of the systematic shift reduced the problem, and the adaptive strategies remain robust against the prostate movement across the fraction. The bladder V{sub 55Gy} is reduced by 35% on average for the adaptive strategies. Conclusions: Because they offer increased CTV coverage and OAR sparing, adaptive methods may be suitable candidates for simple and efficient adaptive treatment strategies for prostate cancer. Margin reduction and systematic error correction in the prostate position improve the protection of the OAR and the dose coverage. A cumulative dose to simulate a complete treatment would show real effects and allow a better comparison between each method.

60 APPLIED LIFE SCIENCES↗

A Stochastic Gradient Descent Approach for Stochastic Optimal Control

In this work, we introduce a stochastic gradient descent approach to solve the stochastic optimal control problem through stochastic maximum principle. The motivation that drives our method is the gradient of the cost functional in the stochastic optimal control problem is under expectation, and numerical calculation of such an expectation requires fully computation of a system of forward backward stochastic differential equations, which is computationally expensive. By evaluating the expectation with single-sample representation as suggested by the stochastic gradient descent type optimisation, we could save computational efforts in solving FBSDEs and only focus on the optimisation task which aims to determine the optimal control process.

97 MATHEMATICS AND COMPUTING↗

Say where you sample: Increasing site selection transparency in urban ecology

Urban ecological studies have the potential to extend our understanding of socio-ecological systems beyond that of an individual city or region. Cross-comparative empirical work and synthesis are imperative to develop a general urban ecological theory. This can be achieved only if studies are replicable and generalizable. Transparency in methods reporting facilitates generalizability and replicability by documenting the decisions scientists make during the various steps of research design; this is particularly true for sampling design and selection because of their impact on both internal and external validity and the potential to unintentionally introduce bias. Three interdependent aspects of sample design are study sample selection (e.g., specific organisms, soils, or water), sample specification (measurement of specific variable of interest), and site selection (locations sampled). Of these, documentation of site selection—the where component of sample design—is underrepresented in the urban ecology literature. Using a stratified random sample of 158 papers from 12 major urban ecology journals, we investigated how researchers selected study sites in urban ecosystems and evaluated whether their site selection methods were transparent. We extracted data from these papers using a 50-question, theory-based questionnaire and a multiple-reviewer approach. Our sample represented almost 45 years of urban ecology research across 40 different countries. We found that more than 80% of the papers read were not transparent in their site selection methodology. We do not believe site selection methods are replicable for 70% of the papers read. Key weaknesses include incomplete descriptions of populations and sampling frames, urban gradients, sample selection methods, and property access. Low transparency in reporting the where methodology limits urban ecologists’ ability to assess the internal and external validity of studies’ findings and to replicate published studies; it also limits the generalizability of existing studies. The challenges of low transparency are particularly relevant in urban ecology, a field where standard protocols for site selection and delineation are still being developed. These limitations interfere with the fields’ ability to build theory and inform policy. We conclude by offering a set of recommendations to increase transparency, replicability, and generalizability.

54 ENVIRONMENTAL SCIENCES↗

CONCURRENT, CONDENSED STEIN VARIATIONAL GRADIENT DESCENT FOR UNCERTAINTY QUANTIFICATION OF NEURAL NETWORKS

In this work, we propose a Stein variational gradient descent (SVGD) method to concurrently sparsify, train, and provide uncertainty quantification (UQ) of a complexly parameterized model, such as a neural network (NN). It employs a graph reconciliation and condensation process to reduce complexity and increase similarity in the Stein ensemble of parameterizations. Therefore, the proposed concurrent, condensed SVGD (ccSVGD) method can provide UQ on parameters, not just outputs. Furthermore, the parameter reduction speeds up the convergence of the Stein gradient descent as it reduces the combinatorial complexity by aligning and differentiating the sensitivity to parameters. These properties are demonstrated with an illustrative example and an application to a mechanical response representation problem in solid mechanics.

42 ENGINEERING↗

WE-G-204-07: Automated Characterization of Perceptual Quality of Clinical Chest Radiographs: Improvements in Lung, Spine, and Hardware Detection

Purpose: To develop and validate more robust methods for automated lung, spine, and hardware detection in AP/PA chest images. This work is part of a continuing effort to automatically characterize the perceptual image quality of clinical radiographs. [Y. Lin et al. Med. Phys. 39, 7019–7031 (2012)] Methods: Our previous implementation of lung/spine identification was applicable to only one vendor. A more generalized routine was devised based on three primary components: lung boundary detection, fuzzy c-means (FCM) clustering, and a clinically-derived lung pixel probability map. Boundary detection was used to constrain the lung segmentations. FCM clustering produced grayscale- and neighborhood-based pixel classification probabilities which are weighted by the clinically-derived probability maps to generate a final lung segmentation. Lung centerlines were set along the left-right lung midpoints. Spine centerlines were estimated as a weighted average of body contour, lateral lung contour, and intensity-based centerline estimates. Centerline estimation was tested on 900 clinical AP/PA chest radiographs which included inpatient/outpatient, upright/bedside, men/women, and adult/pediatric images from multiple imaging systems. Our previous implementation further did not account for the presence of medical hardware (pacemakers, wires, implants, staples, stents, etc.) potentially biasing image quality analysis. A hardware detection algorithm was developed using a gradient-based thresholding method. The training and testing paradigm used a set of 48 images from which 1920 51×51 pixel{sup 2} ROIs with and 1920 ROIs without hardware were manually selected. Results: Acceptable lung centerlines were generated in 98.7% of radiographs while spine centerlines were acceptable in 99.1% of radiographs. Following threshold optimization, the hardware detection software yielded average true positive and true negative rates of 92.7% and 96.9%, respectively. Conclusion: Updated segmentation and centerline estimation methods in addition to new gradient-based hardware detection software provide improved data integrity control and error-checking for automated clinical chest image quality characterization across multiple radiography systems.

60 APPLIED LIFE SCIENCES↗

Implementation of analytic gradients for CCSD and EOM-CCSD using Cholesky decomposition of the electron-repulsion integrals and their derivatives: Theory and benchmarks

We present a general formulation of analytic nuclear gradients for the coupled-cluster with single and double substitution (CCSD) and equation-of-motion (EOM) CCSD energies computed using Cholesky decomposition (CD) representations of the electron repulsion integrals. By rewriting the correlated energy and response equations such that the storage of the largest four-index intermediates is eliminated, CD leads to a significant reduction in disk storage requirements, reduced I/O penalties, and an improved parallel performance. CD thus extends the scope of the systems that can be treated by (EOM-)CCSD methods, although analytic gradients in the framework of CD are needed to extend the applicability of (EOM-)CCSD methods in the context of geometry optimizations. This paper presents a formulation of analytic (EOM-)CCSD gradient within the CD framework and reports on the salient details of the corresponding implementation. The accuracy and the capabilities of analytic CD-based (EOM-)CCSD gradients are illustrated by benchmark calculations and several illustrative examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An exploration of machine learning models for the determination of reaction coordinates associated with conformational transitions

Determining collective variables (CVs) for conformational transitions is crucial to understanding their dynamics and targeting them in enhanced sampling simulations. Often, CVs are proposed based on intuition or prior knowledge of a system. However, the problem of systematically determining a proper reaction coordinate (RC) for a specific process in terms of a set of putative CVs can be achieved using committor analysis (CA). Identifying essential degrees of freedom that govern such transitions using CA remains elusive because of the high dimensionality of the conformational space. Various schemes exist to leverage the power of machine learning (ML) to extract an RC from CA. Here, we extend these studies and compare the ability of 17 different ML schemes to identify accurate RCs associated with conformational transitions. We tested these methods on an alanine dipeptide in vacuum and on a sarcosine dipeptoid in an implicit solvent. Our comparison revealed that the light gradient boosting machine method outperforms other methods. In order to extract key features from the models, we employed Shapley Additive exPlanations analysis and compared its interpretation with the “feature importance” approach. For the alanine dipeptide, our methodology identifies ϕ and θ dihedrals as essential degrees of freedom in the C7ax to C7eq transition. For the sarcosine dipeptoid system, the dihedrals ψ and ω are the most important for the cisαD to transαD transition. We further argue that analysis of the full dynamical pathway, and not just endpoint states, is essential for identifying key degrees of freedom governing transitions.

Chemistry↗

Single-shot in-line x-ray phase-contrast imaging of void-shockwave interactions in fusion energy materials

Recent breakthroughs in nuclear fusion, specifically the report of reactions exceeding scientific breakeven at the National Ignition Facility (NIF), highlight the potential of inertial fusion energy (IFE) as a sustainable and virtually limitless energy source. However, further progress in IFE requires characterization of defects in ablator materials and how they affect fuel capsule compression. Voids within the ablator can degrade energy yield, but their impact on the density distribution has primarily been studied through simulations, with limited high-resolution experimental validation. To address this, we used the x-ray free-electron laser (XFEL) at the matter in extreme conditions (MECs) instrument at the Linac coherent light source (LCLS) to capture 2D x-ray phase-contrast (XPC) images of a void-bearing sample with a composition similar to inertial confinement fusion (ICF) ablators. By driving a compressive shockwave through the sample using MEC's long-pulse laser system, we analyzed how voids influence shockwave propagation and density distribution during compression. To quantify this impact, we extracted phase information using two phase retrieval algorithms. First, we applied the contrast transfer function (CTF) method, paired with Tikhonov regularization and a fast optimization approach to generate an initial phase estimate. We then refined the result using a projected gradient descent (PGD) method that works directly with the sample's refractive index. Comparing these results with radiation adaptive grid Eulerian (xRAGE) radiation hydrodynamic simulations enables identification of model validation needs or improvements. By calculating phase maps in situ, it becomes possible to reconstruct areal density maps, improving understanding of laser-capsule interactions and advancing IFE research.

Hodge, D. S. [Colorado State Univ., Fort Collins, ↗

Iterative image-domain decomposition for dual-energy CT

Purpose: Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its capability of material decomposition. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical values of DECT. Existing denoising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. In this work, the authors propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images. Methods: The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. The regularization term enforces the image smoothness by calculating the square sum of neighboring pixel value differences. To retain the boundary sharpness of the decomposed images, the authors detect the edges in the CT images before decomposition. These edge pixels have small weights in the calculation of the regularization term. Distinct from the existing denoising algorithms applied on the images before or after decomposition, the method has an iterative process for noise suppression, with decomposition performed in each iteration. The authors implement the proposed algorithm using a standard conjugate gradient algorithm. The method performance is evaluated using an evaluation phantom (Catphan©600) and an anthropomorphic head phantom. The results are compared with those generated using direct matrix inversion with no noise suppression, a denoising method applied on the decomposed images, and an existing algorithm with similar formulation as the proposed method but with an edge-preserving regularization term. Results: On the Catphan phantom, the method maintains the same spatial resolution on the decomposed images as that of the CT images before decomposition (8 pairs/cm) while significantly reducing their noise standard deviation. Compared to that obtained by the direct matrix inversion, the noise standard deviation in the images decomposed by the proposed algorithm is reduced by over 98%. Without considering the noise correlation properties in the formulation, the denoising scheme degrades the spatial resolution to 6 pairs/cm for the same level of noise suppression. Compared to the edge-preserving algorithm, the method achieves better low-contrast detectability. A quantitative study is performed on the contrast-rod slice of Catphan phantom. The proposed method achieves lower electron density measurement error as compared to that by the direct matrix inversion, and significantly reduces the error variation by over 97%. On the head phantom, the method reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures. Conclusions: The authors propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. By exploring the full variance-covariance properties of the decomposed images and utilizing the edge predetection, the proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DISENTANGLING AGN AND STAR FORMATION ACTIVITY AT HIGH REDSHIFT USING HUBBLE SPACE TELESCOPE GRISM SPECTROSCOPY

Differentiating between active galactic nucleus (AGN) activity and star formation in z ∼ 2 galaxies is difficult because traditional methods, such as line-ratio diagnostics, change with redshift, while multi-wavelength methods (X-ray, radio, IR) are sensitive to only the brightest AGNs. We have developed a new method for spatially resolving emission lines using the Hubble Space Telescope /Wide Field Camera 3 G141 grism spectra and quantifying AGN activity through the spatial gradient of the [O iii]/H β line ratio. Through detailed simulations, we show that our novel line-ratio gradient approach identifies ∼40% more low-mass and obscured AGNs than obtained by classical methods. Based on our simulations, we developed a relationship that maps the stellar mass, star formation rate, and measured [O iii]/H β gradient to the AGN Eddington ratio. We apply our technique to previously studied stacked samples of galaxies at z ∼ 2 and find that our results are consistent with these studies. This gradient method will also be able to inform other areas of galaxy evolution science, such as inside-out quenching and metallicity gradients, and will be widely applicable to future spatially resolved James Webb Space Telescope data.

79 ASTRONOMY AND ASTROPHYSICS↗

An atomic orbital-based formulation of analytical gradients and nonadiabatic coupling vector elements for the state-averaged complete active space self-consistent field method on graphical processing units

We recently presented an algorithm for state-averaged complete active space self-consistent field (SA-CASSCF) orbital optimization that capitalizes on sparsity in the atomic orbital basis set to reduce the scaling of computational effort with respect to molecular size. Here, we extend those algorithms to calculate the analytic gradient and nonadiabatic coupling vectors for SA-CASSCF. Combining the low computational scaling with acceleration from graphical processing units allows us to perform SA-CASSCF geometry optimizations for molecules with more than 1000 atoms. The new approach will make minimal energy conical intersection searches and nonadiabatic dynamics routine for molecular systems with O(10{sup 2}) atoms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Electronic Bloch oscillation in bilayer graphene gradient superlattices

We investigate the electronic Bloch oscillation in bilayer graphene gradient superlattices using transfer matrix method. By introducing two kinds of gradient potentials of square barriers along electrons propagation direction, we find that Bloch oscillations up to terahertz can occur. Wannier-Stark ladders, as the counterpart of Bloch oscillation, are obtained as a series of equidistant transmission peaks, and the localization of the electronic wave function is also signature of Bloch oscillation. Furthermore, the period of Bloch oscillation decreases linearly with increasing gradient of barrier potentials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Accelerating iterative ptychography with an integrated neural network

Electron ptychography is a powerful and versatile tool for high-resolution and dose-efficient imaging. Iterative reconstruction algorithms are powerful but also computationally expensive due to their relative complexity and the many hyperparameters that must be optimised. Gradient descent-based iterative ptychography is a popular method, but it may converge slowly when reconstructing low spatial frequencies. Here, in this work, we present a method for accelerating a gradient descent-based iterative reconstruction algorithm by training a neural network (NN) that is applied in the reconstruction loop. The NN works in Fourier space and selectively boosts low spatial frequencies, thus enabling faster convergence in a manner similar to accelerated gradient descent algorithms. We discuss the difficulties that arise when incorporating a NN into an iterative reconstruction algorithm and show how they can be overcome with iterative training. We apply our method to simulated and experimental data of gold nanoparticles on amorphous carbon and show that we can significantly speed up ptychographic reconstruction of the nanoparticles.

4DSTEM↗

Charged particle beam scanning using deformed high gradient insulator

Devices and methods are provided to allow rapid deflection of a charged particle beam. The disclosed devices can, for example, be used as part of a hadron therapy system to allow scanning of a target area within a patient's body. The disclosed charged particle beam deflectors include a dielectric wall accelerator (DWA) with a hollow center and a dielectric wall that is substantially parallel to a z-axis that runs through the hollow center. The dielectric wall includes one or more deformed high gradient insulators (HGIs) that are configured to produce an electric field with an component in a direction perpendicular to the z-axis. A control component is also provided to establish the electric field component in the direction perpendicular to the z-axis and to control deflection of a charged particle beam in the direction perpendicular to the z-axis as the charged particle beam travels through the hollow center of the DWA.

43 PARTICLE ACCELERATORS↗

A volumetric model-based 2D to 3D registration method for measuring kinematics of natural knees with single-plane fluoroscopy

Purpose: Accurate measurement of the three-dimensional (3D) rigid body and surface kinematics of the natural human knee is essential for many clinical applications. Existing techniques are limited either in their accuracy or lack more realistic experimental evaluation of the measurement errors. The purposes of the study were to develop a volumetric model-based 2D to 3D registration method, called the weighted edge-matching score (WEMS) method, for measuring natural knee kinematics with single-plane fluoroscopy to determine experimentally the measurement errors and to compare its performance with that of pattern intensity (PI) and gradient difference (GD) methods. Methods: The WEMS method gives higher priority to matching of longer edges of the digitally reconstructed radiograph and fluoroscopic images. The measurement errors of the methods were evaluated based on a human cadaveric knee at 11 flexion positions. Results: The accuracy of the WEMS method was determined experimentally to be less than 0.77 mm for the in-plane translations, 3.06 mm for out-of-plane translation, and 1.13 deg. for all rotations, which is better than that of the PI and GD methods. Conclusions: A new volumetric model-based 2D to 3D registration method has been developed for measuring 3D in vivo kinematics of natural knee joints with single-plane fluoroscopy. With the equipment used in the current study, the accuracy of the WEMS method is considered acceptable for the measurement of the 3D kinematics of the natural knee in clinical applications.

62 RADIOLOGY AND NUCLEAR MEDICINE↗