Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization algorithm”

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 1,729 records · Page 96

Adaptive Sparse-Grid Stochastic Collocation Uncertainty Quantification Convergence for Multigroup Diffusion

Advanced methods in uncertainty quantification for numerical models in computational physics continue to gain acceptance in nuclear modeling. Previously, the efficiency of sparse-grid stochastic collocation in comparison with Monte Carlo for uncertainty quantification through convergence studies was demonstrated. An adaptive method for anisotropic sparse grid collocation and its convergence compared to previous efforts is considered. The physical system in consideration is a two-dimensional quarter-core reactor, consisting of 5 materials distributed in 121 regions. The two-group neutron diffusion criticality approximation is solved. Vacuum boundaries are applied on the top and right, and reflecting boundaries on the bottom and left. The material cross sections, neutron multiplication factors, and diffusion coefficients are potential sources of uncertainty. Uniformly-distributed uncertainty within 5% of the reference values is introduced for material properties. The distribution of the uncertain parameters make up the uncertainty space Γ included in R{sup N}, where N is the number of uncertain parameters. The input parameter uncertainties are independently distributed. As expected, the convergence of Monte Carlo on the benchmark as a function of computational solves is nearly linear and lethargic compared to the other methods. The static isotropic index set, in which each input dimension is treated with equal importance, converges much more efficiently than Monte Carlo, but lacks the benefit of emphasizing some dimensions over others. The anisotropic case is most efficient, where first-order sensitivity information was used to determine anisotropic weights for polynomials to use in the polynomial chaos expansion. Interestingly, the adaptive algorithm converges slightly less efficiently than the anisotropic case, while still performing better than the isotropic case. Because the adaptive case has to determine the importance of each input dimension, it occasionally predicts inaccurately and wastes computation solves compared to the more ideal anisotropic case. However, in circumstances when an ideal anisotropy is not understood a priori, the adaptive algorithm may be optimally efficient in representing the original model. Given the potential loss of efficiency when using a poorly-chosen anisotropic weighting, the adaptive algorithm may be an effective choice for initial uncertainty quantification in problems with a low-dimensionality input space. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A genetic meta-algorithm-assisted inversion approach: hydrogeological study for the determination of volumetric rock properties and matrix and fluid parameters in unsaturated formations

An evolutionary inversion approach is suggested for the interpretation of nuclear and resistivity logs measured by direct-push tools in shallow unsaturated sediments. The efficiency of formation evaluation is improved by estimating simultaneously (1) the petrophysical properties that vary rapidly along a drill hole with depth and (2) the zone parameters that can be treated as constant, in one inversion procedure. In the workflow, the fractional volumes of water, air, matrix and clay are estimated in adjacent depths by linearized inversion, whereas the clay and matrix properties are updated using a float-encoded genetic meta-algorithm. The proposed inversion method provides an objective estimate of the zone parameters that appear in the tool response equations applied to solve the forward problem, which can significantly increase the reliability of the petrophysical model as opposed to setting these parameters arbitrarily. The global optimization meta-algorithm not only assures the best fit between the measured and calculated data but also gives a reliable solution, practically independent of the initial model, as laboratory data are unnecessary in the inversion procedure. The feasibility test uses engineering geophysical sounding logs observed in an unsaturated loessy-sandy formation in Hungary. The multi-borehole extension of the inversion technique is developed to determine the petrophysical properties and their estimation errors along a profile of drill holes. The genetic meta-algorithmic inversion method is recommended for hydrogeophysical logging applications of various kinds to automatically extract the volumetric ratios of rock and fluid constituents as well as the most important zone parameters in a reliable inversion procedure.

58 GEOSCIENCES↗

Strategic planning for power system restorations

This paper considers the power system restoration planning problem (PSRPP) for disaster recovery, a fundamental problem faced by all populated areas. PSRPPs are complex stochastic optimization problems that combine resource allocation, warehouse location, and vehicle routing considerations. Furthermore, electrical power systems are complex systems whose behavior can only be determined by physics simulations. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This work is three fold: (1) it formalizes the specification of PSRPPs; (2) introduces a simple optimization-simulation hybridization necessary for solving PSRPPs; and (3) presents a complete restoration algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. This paper studied a novel problem in the field of humanitarian logistics, the Power System Restoration Problem (PSRPP). The PSRPP models the strategic planning process for post disaster power system recovery. The paper proposed a multi-stage stochastic hybrid optimization algorithm that yields high quality solutions to real-world benchmarks provided by Los Alamos National Laboratory (LANL). The algorithm uses a variety of technologies, including MIP, constraint programming, and large neighborhood search, to exploit the structure of each individual optimization subproblem. The experimental results on hurricane disaster benchmarks indicate that the algorithm is practical from a computational standpoint and produce significant improvements over existing relief delivery procedures.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Description of Sensor Assignment Optimization Method as Deployed on a Multi-Node Cluster

Data analytic methods are being developed to address the problem of how to assign a sensor set in a nuclear facility such that a requisite level of process monitoring capability is realized and that the sensor set is sufficiently rich to determine the status of the individual sensors with respect to need for calibration. There is an awareness in the nuclear industry that data analytics combined with rich sensor sets represent a means to improve operations and reduce costs. In the industry the calibration problem has been previously approached as an empirical data-driven problem with several methods having been developed. However, the experience of the utilities over the past ten years with these methods indicates that the absence of physics-based information renders the data-driven approach less reliable. Complicating factors such as the inherent variability of operation (both equipment alignment and operating condition) can confound a pure data-driven approach while there are no rigorous guidelines for determining what constitutes an adequate sensor set. The solution under development to overcome these shortcomings supplements the data analytic method with process information in a so-called process-constrained data-analytic approach. Simple balance equations are written for generic components (e.g., mechanical pump, valve, and heat exchanger). These do not require a priori knowledge of process parameters, such as heat transfer coefficients or friction factors. All that is needed on the part of the utility user is to identify the components and how they are connected. This report describes the development of a parallel computing capability for determining the optimal sensor set. The optimal sensor set problem suffers from the curse of dimensionality. Computation time increases exponentially as the size of the system grows. To overcome this difficulty a pre-conditioner algorithm is developed to find an approximate solution close the actual solution. This serves as a seed for the full-blown algorithm and acts to constrain the space that must searched. The optimization algorithms are described and the implementation on a parallel computing platform is described. The application of the method to a use case we are solving in collaboration with our utility partner served to illustrate how the default sensor set in a nuclear plant may not provide sufficient coverage to infer sensor calibration status.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-E-T-580: Comparison of Cervical Carcinoma IMRT Plans From Four Commercial Treatment Planning Systems (TPS)

Purpose: Different treatment planning systems (TPS) use different treatment optimization and leaf sequencing algorithms. This work compares cervical carcinoma IMRT plans optimized with four commercial TPSs to investigate the plan quality in terms of target conformity and delivery efficiency. Methods: Five cervical carcinoma cases were planned with the Corvus, Monaco, Pinnacle and Xio TPSs by experienced planners using appropriate optimization parameters and dose constraints to meet the clinical acceptance criteria. Plans were normalized for at least 95% of PTV to receive the prescription dose (Dp). Dose-volume histograms and isodose distributions were compared. Other quantities such as Dmin(the minimum dose received by 99% of GTV/PTV), Dmax(the maximum dose received by 1% of GTV/PTV), D100, D95, D90, V110%, V105%, V100% (the volume of GTV/PTV receiving 110%, 105%, 100% of Dp), conformity index(CI), homogeneity index (HI), the volume of receiving 40Gy and 50 Gy to rectum (V40,V50) ; the volume of receiving 30Gy and 50 Gy to bladder (V30,V50) were evaluated. Total segments and MUs were also compared. Results: While all plans meet target dose specifications and normal tissue constraints, the maximum GTVCI of Pinnacle plans was up to 0.74 and the minimum of Corvus plans was only 0.21, these four TPSs PTVCI had significant difference. The GTVHI and PTVHI of Pinnacle plans are all very low and show a very good dose distribution. Corvus plans received the higer dose of normal tissue. The Monaco plans require significantly less segments and MUs to deliver than the other plans. Conclusion: To deliver on a Varian linear-accelerator, the Pinnacle plans show a very good dose distribution. Corvus plans received the higer dose of normal tissue. The Monaco plans have faster beam delivery.

60 APPLIED LIFE SCIENCES↗

Accuracy of Some Approximate Gaussian Filters for the Navier--Stokes Equation in the Presence of Model Error

Bayesian state estimation of a dynamical system from a stream of noisy measurements is important in many geophysical and engineering applications where high dimensionality of the state space, sparse observations, and model error pose key challenges. In this work, three computationally feasible, approximate Gaussian data assimilation/filtering algorithms are considered in various regimes of turbulent 2D Navier--Stokes dynamics in the presence of model error. The first source of error arises from the necessary use of reduced models for the forward dynamics of the filters, while a particular type of representation error arises from the finite resolution of observations which mix up information about resolved and unresolved dynamics. Two stochastically parameterized filtering algorithms, referred to as cSPEKF and GCF, are compared with 3DVAR---a prototypical time-sequential algorithm known to be accurate for filtering dissipative systems for a suitably inflated “background” covariance. We provide the first evidence that the stochastically parameterized algorithms, which do not rely on detailed knowledge of the underlying dynamics and do not require covariance inflation, can compete with or outperform an optimally tuned 3DVAR algorithm, and they can overcome competing sources of error in a range of dynamical scenarios.

97 MATHEMATICS AND COMPUTING↗

pyDRESCALk

Modern data scientists are tasked to analyze ever-growing data sets with increasingly complex relationships. Tensor decompositions have come to play a central role in identifying underlying latent structures in higher-order data. The problem of fitting tensor models to different distributions is complicated by the combinations of size, dimensionality, and sparsity present in real world data. The situation demands efficient algorithms designed for shared-memory and distributed systems. This work will present new research that tackles these challenges on several different fronts, leveraging optimizations in numerical algorithms and sparse tensor representations in heterogeneous high performance computing environments.

Bhattarai, Manish↗

Integrated Multiscale Modeling of Molecular Computing Devices

The main bottleneck in modeling transport in molecular devices is to develop the correct formulation of the problem and efficient algorithms for analyzing the electronic structure and dynamics using, for example, the time-dependent density functional theory. We have divided this task into several steps. The first step is to developing the right mathematical formulation and numerical algorithms for analyzing the electronic structure using density functional theory. The second step is to study time-dependent density functional theory, particularly the far-field boundary conditions. The third step is to study electronic transport in molecular devices. We are now at the end of the first step. Under DOE support, we have made subtantial progress in developing linear scaling and sub-linear scaling algorithms for electronic structure analysis. Although there has been a huge amount of effort in the past on developing linear scaling algorithms, most of the algorithms developed suffer from the lack of robustness and controllable accuracy. We have made the following progress: (1) We have analyzed thoroughly the localization properties of the wave-functions. We have developed a clear understanding of the physical as well as mathematical origin of the decay properties. One important conclusion is that even for metals, one can choose wavefunctions that decay faster than any algebraic power. (2) We have developed algorithms that make use of these localization properties. Our algorithms are based on non-orthogonal formulations of the density functional theory. Our key contribution is to add a localization step into the algorithm. The addition of this localization step makes the algorithm quite robust and much more accurate. Moreover, we can control the accuracy of these algorithms by changing the numerical parameters. (3) We have considerably improved the Fermi operator expansion (FOE) approach. Through pole expansion, we have developed the optimal scaling FOE algorithm.

99 GENERAL AND MISCELLANEOUS↗

Technoeconomic Analysis of Novel PV Plant Designs for Extreme Cost Reductions

This project sought to gain a deeper understanding of the cost and performance of future solar photovoltaic (PV) plant components, including bifacial PV modules, tandem PV modules, increased plant voltage architectures, and module-level power electronics, and how they may be integrated into new PV plant designs to significantly reduce the levelized cost of electricity (LCOE) of PV. This was done through extensive modeling of current PV plants and future technologies in three different locations, informed by a comprehensive literature review and informational interviews to develop performance and cost assumptions for these technologies. Sensitivities were conducted to understand tradeoffs between different design options, such as the added energy from increasing row spacing versus additional land costs. An optimization tool was then created utilizing an evolutionary algorithm to determine an optimal PV plant configuration for a given set of technologies that resulted in minimized plant LCOE based upon typical performance and cost inputs.

14 SOLAR ENERGY↗

OPER: Optimality-Guided Embedding Table Parallelization for Large-scale Recommendation Model

With the sharp increasing volume of user data, Deep Learning Recommendation Model (DLRM) becomes an indispensable infrastructure in large technology companies. However, large-scale DLRM on the multi-GPU platform is still inefficient due to unbalanced workload partitioning and intensive inter-GPU communication. To this end, we propose OPER, an OPtimality guided Embedding table placement for large-scale Recommendation model training and inference. OPER explores the potential of mitigating remote memory access latency in DLRM through fine-grained embedding table placement. Specifically, OPER proposes a theoretical modeling that builds up the relationship between EMT placement and the embedding communication latency in both training and inference. OPER proves the NP hardness of finding the optimal embedding table placement and proposes a heuristic algorithm that yields near optimal placement. OPER implements a SHMEM-based embedding table training system and a unified embedding index mapping to support fine-grained embedding table sharding and placement. Comprehensive experiments reveal that OPER achieves on average 3.4× and 5.1× speedup on training and inference respectively over state-of-the-art DLRM frameworks.

Wang, Zheng↗

Hybrid Inverse Parameter Identification of Fully Coupled Ductile Damage Model for Steel Sheet DP600 with Two Different Algorithms: Trust Region and Genetic Algorithms

Ductile damage model has been widely regarded as a valuable method to predict the failure of sheet metal. Based on the thermodynamic theory and continuum damage mechanics, the fully coupled ductile damage model can be developed, which also can better predict the initiation and growth of the fracture. But the identifications of model parameters with theoretical methodology are difficult due to the complex coupling relationships existing among all state variables. The inverse methodology is regarded as a good method to resolve the problem. In this paper, the recently proposed fully coupled ductile damage model is chosen to investigate the deformation behavior of DP600 steel, in which the mixed saturation isotropic and kinematic hardenings are taken into account and fully coupled with the ductile damage. During the identification process, the least square formula of the error between experimental and numerical results is selected as the target function. The trust region algorithm and genetic algorithm are used with the help of MATLAB for the identification of three damage parameters. Finally, by comparing the experimental and numerical results, the validations of two algorithms are proved. The efficiency of the optimization process with trust region algorithm is higher, but with lower accuracy. Meanwhile, the optimization process is greatly affected by the chosen initial values of the ductile damage parameters.

36 MATERIALS SCIENCE↗

Multi-objective optimization of a PCHE-type intermediate heat exchanger using genetic algorithms

For the advanced nuclear reactor systems and power conversion units, it is important to optimize the design of intermediate heat exchangers (IHXs) which transfer heat from the primary loop to the secondary or intermediate loop. For a multi-objective optimization problem, a printed circuit heat exchanger-type IHX with zigzag and S-shaped fin channels is selected to be optimized in terms of both the total cost and the heat exchanger thermal effectiveness using genetic algorithms. A computer code is developed to search a set of optimized designs of the zigzag channel geometry. It is found that among the Pareto-optimal solutions, the total cost is approximately linearly related to the thermal effectiveness between 88 and 95% while it rises rapidly after the effectiveness exceeds 95%. An optimal flow channel diameter is also determined through the optimization. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Choreographing Couch and Collimator in Volumetric Modulated Arc Therapy

Purpose: To design and optimize trajectory-based, noncoplanar subarcs for volumetric modulated arc therapy (VMAT) deliverable on both Varian TrueBEAM system and traditional accelerators; and to investigate their potential advantages for treating central nervous system (CNS) tumors. Methods and Materials: To guide the computerized selection of beam trajectories consisting of simultaneous couch, gantry, and collimator motion, a score function was implemented to estimate the geometric overlap between targets and organs at risk for each couch/gantry angle combination. An initial set of beam orientations is obtained as a function of couch and gantry angle, according to a minimum search of the score function excluding zones of collision. This set is grouped into multiple continuous and extended subarcs subject to mechanical limitations using a hierarchical clustering algorithm. After determination of couch/gantry trajectories, a principal component analysis finds the collimator angle at each beam orientation that minimizes residual target-organ at risk overlaps. An in-house VMAT optimization algorithm determines the optimal multileaf collimator position and monitor units for control points within each subarc. A retrospective study of 10 CNS patients compares the proposed method of VMAT trajectory with dynamic gantry, leaves, couch, and collimator motion (Tra-VMAT); a standard noncoplanar VMAT with no couch/collimator motion within subarcs (Std-VMAT); and noncoplanar intensity-modulated radiotherapy (IMRT) plans that were clinically used. Results: Tra-VMAT provided improved target dose conformality and lowered maximum dose to brainstem, optic nerves, and chiasm by 7.7%, 1.1%, 2.3%, and 1.7%, respectively, compared with Std-VMAT. Tra-VMAT provided higher planning target volume minimum dose and reduced maximum dose to chiasm, optic nerves, and cochlea by 6.2%, 1.3%, 6.3%, and 8.4%, respectively, and reduced cochlea mean dose by 8.7%, compared with IMRT. Tra-VMAT averaged beam-on time was comparable to Std-VMAT but significantly (45%) less than IMRT. Conclusion: Optimized couch, gantry, and collimator trajectories may be integrated into VMAT with improved mechanical flexibility and may provide better dosimetric properties and improved efficiency in the treatment of CNS tumors.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Peak Reduction in a Residential Community Through Bayesian Optimization of Transactive Control Signals

Daily residential power consumption in aggregate tends to have a large peak that places stress on the distribution system and induces high operational costs. This work shows that coordinated transactive control of noncritical loads within a residential community or microgrid can help to alleviate peak-time stress on the distribution system by flattening the aggregate load curve. Treating the load forecaster as a high-fidelity, expensive black-box function, a new algorithm utilizing Bayesian optimization (BO) is proposed to achieve the best solution under uncertainty with minimal computing effort. The proposed BO algorithm manipulates the shape of the load based on transactive signals sent to each home. The thermostatically controlled loads (TCLs) act out of self-interest in response to the given price while maintaining comfort, and the optimizer exploits the thermal energy retention of the homes for the benefit of the community. Simulations confirm consistent neighborhood-level peak power reduction and energy cost savings.

Schomer, Ian↗

Temporal network alignment via GoT-WAVE

Abstract Motivation Network alignment (NA) finds conserved regions between two networks. NA methods optimize node conservation (NC) and edge conservation. Dynamic graphlet degree vectors are a state-of-the-art dynamic NC measure, used within the fastest and most accurate NA method for temporal networks: DynaWAVE. Here, we use graphlet-orbit transitions (GoTs), a different graphlet-based measure of temporal node similarity, as a new dynamic NC measure within DynaWAVE, resulting in GoT-WAVE. Results On synthetic networks, GoT-WAVE improves DynaWAVE’s accuracy by 30% and speed by 64%. On real networks, when optimizing only dynamic NC, the methods are complementary. Furthermore, only GoT-WAVE supports directed edges. Hence, GoT-WAVE is a promising new temporal NA algorithm, which efficiently optimizes dynamic NC. We provide a user-friendly user interface and source code for GoT-WAVE. Availability and implementation http://www.dcc.fc.up.pt/got-wave/ Supplementary information Supplementary data are available at Bioinformatics online.

Aparício, David↗

SU-E-I-45: Reconstruction of CT Images From Sparsely-Sampled Data Using the Logarithmic Barrier Method

Purpose: To develop and investigate whether the logarithmic barrier (LB) method can result in high-quality reconstructed CT images using sparsely-sampled noisy projection data Methods: The objective function is typically formulated as the sum of the total variation (TV) and a data fidelity (DF) term with a parameter λ that governs the relative weight between them. Finding the optimized value of λ is a critical step for this approach to give satisfactory results. The proposed LB method avoid using λ by constructing the objective function as the sum of the TV and a log function whose augment is the DF term. Newton's method was used to solve the optimization problem. The algorithm was coded in MatLab2013b. Both Shepp-Logan phantom and a patient lung CT image were used for demonstration of the algorithm. Measured data were simulated by calculating the projection data using radon transform. A Poisson noise model was used to account for the simulated detector noise. The iteration stopped when the difference of the current TV and the previous one was less than 1%. Results: Shepp-Logan phantom reconstruction study shows that filtered back-projection (FBP) gives high streak artifacts for 30 and 40 projections. Although visually the streak artifacts are less pronounced for 64 and 90 projections in FBP, the 1D pixel profiles indicate that FBP gives noisier reconstructed pixel values than LB does. A lung image reconstruction is presented. It shows that use of 64 projections gives satisfactory reconstructed image quality with regard to noise suppression and sharp edge preservation. Conclusion: This study demonstrates that the logarithmic barrier method can be used to reconstruct CT images from sparsely-amped data. The number of projections around 64 gives a balance between the over-smoothing of the sharp demarcation and noise suppression. Future study may extend to CBCT reconstruction and improvement on computation speed.

60 APPLIED LIFE SCIENCES↗

Diagnosing Barren Plateaus with Tools from Quantum Optimal Control

Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. However, more work is needed to understand their scalability. One known scaling result for VQAs is barren plateaus, where certain circumstances lead to exponentially vanishing gradients. It is common folklore that problem-inspired ansatzes avoid barren plateaus, but in fact, very little is known about their gradient scaling. In this work we employ tools from quantum optimal control to develop a framework that can diagnose the presence or absence of barren plateaus for problem-inspired ansatzes. Such ansatzes include the Quantum Alternating Operator Ansatz (QAOA), the Hamiltonian Variational Ansatz (HVA), and others. With our framework, we prove that avoiding barren plateaus for these ansatzes is not always guaranteed. Specifically, we show that the gradient scaling of the VQA depends on the degree of controllability of the system, and hence can be diagnosed through the dynamical Lie algebra $\mathfrak{g}$ obtained from the generators of the ansatz. We analyze the existence of barren plateaus in QAOA and HVA ansatzes, and we highlight the role of the input state, as different initial states can lead to the presence or absence of barren plateaus. Taken together, our results provide a framework for trainability-aware ansatz design strategies that do not come at the cost of extra quantum resources. Moreover, we prove no-go results for obtaining ground states with variational ansatzes for controllable system such as spin glasses. Our work establishes a link between the existence of barren plateaus and the scaling of the dimension of $\mathfrak{g}$.

97 MATHEMATICS AND COMPUTING↗