Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms.”

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,423 records · Page 79

Machine learning-guided discovery of polymer membranes for CO 2 separation with genetic algorithm

Designing polymer membranes with high gas permeability and selectivity is a difficult multi-task constrained problem due to the trade-off between these two properties. In this work, we present a machine learning (ML) driven genetic algorithm to tackle the design problem of polymer membranes for CO 2 separation from N 2 and O 2 . Using literature data of permeability for three gases, we constructed multiple ML models with different fingerprinting featurization schemes to predict gas permeabilities. Then, we employed a genetic algorithm to design new polymers and evaluated their performance using our ML models. We were able to identify new polymer membranes that are promising for both CO 2 /N 2 and CO 2 /O 2 separations. Further, the top discovered polymers are predicted to have high glass transition temperatures. Similarly, the pyridine functionality was found in ≈20% of the predicted polymers. This framework can be used to design polymers for any application involving constrained optimization. Finally, we outlined the challenges and opportunities with using ML guided data-driven inverse design of polymers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effects of high count rate and gain shift on isotope identification algorithms

Spectroscopic gamma-ray detectors are used for many research, industrial, and homeland- security applications. Thallium-doped sodium iodide, (NaI(Tl)), scintillation crystals coupled to photomultiplier tubes provide medium-resolution spectral data about the surrounding environment. NaI(Tl)-based detectors, paired with spectral identification algorithms, are often effective for identifying gamma-ray sources by isotope. However, intrinsic limitations for NaI(Tl) systems exist, including gain shifts and spectral marring (e.g., loss of resolution and count-rate saturation) at high count rates. These effects are hardware dependent and have strong effects on the radioisotopic identification capability of NaI(Tl)-based systems. In this work, the effects of high count rate on the response of isotope-identification algorithms are explored. It is shown that a small gain shift of a few tens of keV is sufficient to disturb identification. The onset of this and other spectral effects is estimated for NaI(Tl) crystals, and a mechanism for mitigating these effects by estimating and correcting for them is implemented and evaluated.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case

This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse non-symmetric matrices. We assume a general sparse matrix A has been decomposed as $PAQ$ = $LU$ on a distributed memory parallel machine, where L, U are lower and upper triangular matrices, and P, Q are permutation matrices, respectively. The PSelInvmethod computes selected elements of $A$ -1 . The selection is confined by the sparsity pattern of the matrix A T . Here our algorithm does not assume any symmetry properties of A, and our parallel implementation is memory efficient, in the sense that the computed elements of $A$ -T overwrites the sparse matrix $L + U$ in situ . PSelInv involves a large number of collective data communication activities within different processor groups of various sizes. In order to minimize idle time and improve load balancing, tree-based asynchronous communication is used to coordinate all such collective communication. Numerical results demonstrate that PSelInv can scale efficiently to 6,400 cores for a variety of matrices.

97 MATHEMATICS AND COMPUTING↗

Visualizing and improving the robustness of phase retrieval algorithms

Coherent x-ray diffractive imaging is a novel imaging technique that utilizes phase retrieval and nonlinear optimization methods to image matter at nanometer scales. We explore how the convergence properties of a popular phase retrieval algorithm, Fienup's HIO, behave by introducing a reduced dimensionality problem allowing us to visualize and quantify convergence to local minima and the globally optimal solution. We then introduce generalizations of HIO that improve upon the original algorithm's ability to converge to the globally optimal solution.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

GBOpt: Grain boundary structure optimization using Monte Carlo and evolutionary algorithms

Polycrystalline materials are made of many small crystals separated by grain boundaries (GBs), whose atomic structure strongly influences material properties. Because the structure of a GB determines its properties, the optimal structure must be known in order to determine those impacts. There are many ways of placing atoms in the GB region, but the optimal structure is defined as the one that gives the lowest value of a target property (typically energy). GB structure optimization has been successfully demonstrated using stochastic and evolutionary methods, but no reusable, community-maintained open-source workflow has been developed. GBOpt (Grain Boundary Optimization) is an open-source Python package that creates that workflow, where we have presently implemented two approaches: Markov Chain Monte Carlo, and genetic algorithm based on elite selection. We demonstrate this capability by successfully reproducing the known optimal structures of a specific GB in two materials, and point interested readers to the GitHub repository for additional examples, including optimization for different properties. Both of the implemented approaches recovered the known structures, with the genetic algorithm approach finding the optimal structure faster on average.

99 - GENERAL AND MISCELLANEOUS↗

The XtalOpt Evolutionary Algorithm for Crystal Structure Prediction

Significant progress has been made in the field of a priori crystal structure prediction, with a number of recent remarkable success stories. Herein, we briefly outline the methods that have been developed for finding the global minimum structure and interesting local minima without the need for experimental information. Focus is placed on describing the XTALOPT evolutionary algorithm (EA) developed in our group towards this end. XTALOPT is published under well-known open-source licenses, and the EA searches can be analyzed via the AVOGADRO chemical editor and visualizer. We describe new algorithmic developments that have made it possible to predict the structures of ever-more complex crystalline lattices. Benchmark tests, which clearly illustrate how the new developments improve the success rate and accelerate the discovery of the global minimum structure, are carried out. Lastly, we describe how XTALOPT has been employed to predict novel ternary hydrides that have the propensity for high-temperature superconductivity under pressure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Generalized Transformer-Based Pulse Detection Algorithm

Pulse-like signals are ubiquitous in the field of single molecule analysis, e.g., electrical or optical pulses caused by analyte translocations in nanopores. The primary challenge in processing pulse-like signals is to capture the pulses in noisy backgrounds, but current methods are subjectively based on a user-defined threshold for pulse recognition. Here, we propose a generalized machine-learning based method, named pulse detection transformer (PETR), for pulse detection. PETR determines the start and end time points of individual pulses, thereby singling out pulse segments in a time-sequential trace. It is objective without needing to specify any threshold. It provides a generalized interface for downstream algorithms for specific application scenarios. PETR is validated using both simulated and experimental nanopore translocation data. It returns a competitive performance in detecting pulses through assessing them with several standard metrics. Finally, the generalization nature of the PETR output is demonstrated using two representative algorithms for feature extraction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p required for a quantum device to outperform classical algorithms. There is potential for quantum advantage on hundreds of qubits and moderate depth with a sampling frequency of 10 kHz. We observe, however, that classical heuristic solvers are capable of producing high-quality approximate solutions in linear time complexity. In order to match this quality for large graph sizes N, a quantum device must support depth p > 11. Additionally, multi-shot QAOA is not efficient on large graphs, indicating that QAOA p ≤ 11 does not scale with N. These results limit achieving quantum advantage for QAOA MaxCut on 3-regular graphs. Other problems, such as different graphs, weighted MaxCut, and 3-SAT, may be better suited for achieving quantum advantage on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design of lightweight BCC multi-principal element alloys with enhanced hydrogen storage using a machine learning-driven genetic algorithm

Body-centered cubic (BCC) based multi-principal element alloy (MPEA) hydrides have demonstrated significant potential for compact and efficient hydrogen storage. In this work, we first leverage machine learning (ML) models to predict the hydrogen affinity, storage capacity and phase stability of BCC MPEAs, creating a unique hydrogen-to-metal (H/M) predictor for materials with unprecedented performance. We developed a metaheuristic optimizer high-throughput framework by interfacing ML models with a genetic algorithm for the accelerated search of {Mg, Al, Ti, V, Cr, Mn, Fe, Co, Ni, Cu, Nb, Mo} based lightweight BCC MPEAs with improved hydrogen storage characteristics. We report five new MPEAs with a predicted gravimetric hydrogen storage capacity of around 3.5 wt% or more, including Cr 0.09 Mg 0.73 Ti 0.18 (4.25 wt% H) and Cr 0.21 Nb 0.11 Ti 0.35 V 0.33 (3.5 wt% H). The electronic structure of the top-performing composition, Cr 0.09 Mg 0.73 Ti 0.18 , was analyzed using density functional theory (DFT) to understand the reasons for its improved hydrogen storage properties compared to TiFe (1.90 wt% H), LaNi 5 (1.37 wt% H) or BCC MPEAs like TiVNbCr (3.70 wt% H). Temperature-dependent molecular dynamics (MD) studies were further performed on optimized BCC MPEAs to qualitatively study hydrogen mobility and analyze the effect of different elemental composition on bulk hydrogen diffusion. Our findings demonstrate how a ML assisted genetic algorithm framework can be used for efficient search of stable, lightweight and cost-effective MPEAs while minimizing the need for expensive ab initio calculations.

DFT↗

Using the Gerchberg-Saxton algorithm to reconstruct nonmodulated pyramid wavefront sensor measurements

Adaptive optics (AO) is a technique to improve the resolution of ground-based telescopes by correcting, in real-time, optical aberrations due to atmospheric turbulence and the telescope itself. With the rise of Giant Segmented Mirror Telescopes (GSMT), AO is needed more than ever to reach the full potential of these future observatories. One of the main performance drivers of an AO system is the wavefront sensing operation, consisting of measuring the shape of the above mentioned optical aberrations. Aims. The non-modulated pyramid wavefront sensor (nPWFS) is a wavefront sensor with high sensitivity, allowing the limits of AO systems to be pushed. The high sensitivity comes at the expense of its dynamic range, which makes it a highly non-linear sensor. We propose here a novel way to invert nPWFS signals by using the principle of reciprocity of light propagation and the Gerchberg-Saxton (GS) algorithm. We test the performance of this reconstructor in two steps: the technique is first implemented in simulations, where some of its basic properties are studied. Then, the GS reconstructor is tested on the Santa Cruz Extreme Adaptive optics Laboratory (SEAL) testbed located at the University of California Santa Cruz. This new way to invert the nPWFS measurements allows us to drastically increase the dynamic range of the reconstruction for the nPWFS, pushing the dynamics close to a modulated PWFS. The reconstructor is an iterative algorithm requiring heavy computational burden, which could be an issue for real-time purposes in its current implementation. However, this new reconstructor could still be helpful in the case of many wavefront control operations. In conclusion, this reconstruction technique has also been successfully tested on the Santa Cruz Extreme AO Laboratory (SEAL) bench where it is now used as the standard way to invert nPWFS signal.

47 OTHER INSTRUMENTATION↗

An Algorithm for the Optimization of Insertion Devices to Increase Useful Flux and to Decrease Useless Radiation Power

A continuous spectrum of synchrotron radiation in the hard x-ray region, 5-20 keV, is necessary for the special demand of users, but the high radiation power in that continuous spectrum adversely affects the design of optical components in the beam line. A compromise between photon flux and radiation power of insertion devices should hence be considered. An algorithm and code for spectrum optimization was hence developed using program Mathematica. A wiggler-like undulator with a continuous spectrum was investigated with this code. An optimization algorithm for continuous spectra in the energy range 5-20 keV is presented, and features of the wiggler-like undulator with a continuous spectrum are discussed herein.

43 PARTICLE ACCELERATORS↗

Algorithm for precision subsample timing between Gaussian-like pulses

Moderately priced oscilloscopes available for the NIF power sensors and target diagnostics have 6 GHz bandwidths at 20-25 Gsamples/s (40 ps sample spacing). Some NIF experiments require cross timing between instruments be determined with accuracy better than 30 ps. A simple analysis algorithm for Gaussian-like pulses such as the 100-ps-wide NIF timing fiducial can achieve single-event cross-timing precision of 1 ps (1/50 of the sample spacing). The midpoint-timing algorithm is presented along with simulations that show why the technique produces good timing results. Optimum pulse width is found to be {approx}2.5 times the sample spacing. Experimental measurements demonstrate use of the technique and highlight the conditions needed to obtain optimum timing performance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A numerical algorithm for the explicit calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients

We present an algorithm for the explicit numerical calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients, based on the Gelfand-Tsetlin pattern calculus. Our algorithm is well suited for numerical implementation; we include a computer code in an appendix. Our exposition presumes only familiarity with the representation theory of SU(2).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Comparative Study of Algorithms for the Numerical Simulation of Lattice QCD

Large-scale numerical simulations are the prime method for a nonperturbative study of QCD from first principles. Although the lattice simulation of the pure-gauge (or quenched-QCD) case may be performed very efficiently on parallel machines, there are several additional difficulties in the simulation of the full-QCD case, i.e. when dynamical quark effects are taken into account. We discuss the main aspects of full-QCD simulations, describing the most common algorithms. We present a comparative analysis of performance for two versions of the hybrid Monte Carlo method (the so-called R and RHMC algorithms), as provided in the MILC software package. We consider two degenerate flavors of light quarks in the staggered formulation, having in mind the case of finite-temperature QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithms for lattice QCD: progress and challenges

The development of improved algorithms for QCD on the lattice has enabled us to do calculations at small quark masses and get control over the chiral extrapolation. Also finer lattices have become possible, however, a severe slowing down associated with the topology of the gauge fields has been observed. This may prevent simulations of lattices fine enough for controlling the continuum extrapolation. This conference contribution introduces the basic concepts behind contemporary lattice algorithms, the current knowledge about their slowing down towards the continuum and its consequences for future lattice simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Plasma equilibria with multiple ion species: Equations and algorithm

Axisymmetric equilibrium of a magnetically confined plasma with multiple ion species is considered. To describe hot plasmas with isothermal surfaces, we adopt a formulation consistent with zero poloidal ion flow. This formulation includes all magnetic field components and also correctly includes all effects of toroidal ion rotation. There are two free surface functions for each species and a third which is determined by a differential equation relating surface functions per species. We have developed and implemented an algorithm for the solution of the resulting nonlinear equations and found solutions with large charge and mass contrast among the ion species for both compact (r = 0 included) and annular (r = 0 excluded) domains. Our solution method allows for arbitrary domain shapes, includes far-field conditions, and treats any combination of electrically conducting or insulating walls. Appropriate surface functions are used to describe the transition from closed to open field plasma in a reasonable manner. Solutions for advanced fuel cycle fusion systems (both D-{sup 3}He and p-{sup 11}B) are presented to illustrate the power of the method. Finally, we briefly discuss the special issues associated with obtaining very elongated solutions and describe the algorithm for implementing these features.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analytic and algorithmic aspects of generalized harmonic sums and polylogarithms

In recent three-loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short S-sums) arise. They are characterized by rational (or real) numerator weights also different from ±1. In this article we explore the algorithmic and analytic properties of these sums systematically. We work out the Mellin and inverse Mellin transform which connects the sums under consideration with the associated Poincaré iterated integrals, also called generalized harmonic polylogarithms. In this regard, we obtain explicit analytic continuations by means of asymptotic expansions of the S-sums which started to occur frequently in current QCD calculations. In addition, we derive algebraic and structural relations, like differentiation with respect to the external summation index and different multi-argument relations, for the compactification of S-sum expressions. Finally, we calculate algebraic relations for infinite S-sums, or equivalently for generalized harmonic polylogarithms evaluated at special values. The corresponding algorithms and relations are encoded in the computer algebra package HarmonicSums.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗