Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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,009 records · Page 56

Coupled cluster Green function: Model involving single and double excitations

In this paper, we report on the development of a parallel implementation of the coupled-cluster (CC) Green function formulation (GFCC) employing single and double excitations in the cluster operator (GFCCSD). A key aspect of this work is the determination of the frequency dependent self-energy, Σ(ω). The detailed description of the underlying algorithm is provided, including approximations used that preserve the pole structure of the full GFCCSD method, thereby reducing the computational costs while maintaining an accurate character of methodology. Furthermore, for systems with strong local correlation, our formulation reveals a diagonally dominate block structure where as the non-local correlation increases, the block size increases proportionally. Here, to demonstrate the accuracy of our approach, several examples including calculations of ionization potentials for benchmark systems are presented and compared against experiment.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Models and Algorithms for Equilibrium Analysis of Mixed-Material Nucleic Acid Systems

Dynamic programming algorithms within the NUPACK software suite enable analysis of equilibrium base-pairing properties for complex and test tube ensembles containing arbitrary numbers of interacting nucleic acid strands. Currently, calculations are limited to single-material systems that are either all-RNA or all-DNA. Here, to enable analysis of mixed-material systems that are critical for modern applications in vitro, in situ, and in vivo, we develop physical models and dynamic programming algorithms that allow the material of the system to be specified at nucleotide resolution. Free energy parameter sets are constructed for both RNA/DNA and RNA/2'OMe-RNA mixed-material systems by combining available empirical mixed-material parameters with single-material parameter sets to enable treatment of the full complex and test tube ensembles. New dynamic programming recursions account for the material of each nucleotide throughout the recursive process. For a complex with N nucleotides, the mixed-material dynamic programming algorithms maintain the O(N 3 ) time complexity of the single-material algorithms, enabling efficient calculation of diverse physical quantities over complex and test tube ensembles (e.g., complex partition function, equilibrium complex concentrations, equilibrium base-pairing probabilities, minimum free energy secondary structure(s), and Boltzmann-sampled secondary structures) at a cost increase of roughly 2.0-3.5×. The results of existing single-material algorithms are exactly reproduced when applying the new mixed-material algorithms to single-material systems. Accuracy is significantly enhanced using mixed-material models and algorithms to predict RNA/DNA and RNA/2'OMe-RNA duplex melting temperatures from the experimental literature as well as RNA/DNA melt profiles from new experiments. In conclusion, mixed-material analyses can be performed online using the NUPACK web app (www.nupack.org) or locally using the NUPACK Python module.

2′OMe-RNA↗

TAMM: Tensor algebra for many-body methods

Tensor algebra operations such as contractions in computational chemistry consume a significant fraction of the computing time on large-scale computing platforms. The widespread use of tensor contractions between large multi-dimensional tensors in describing electronic structure theory has motivated the development of multiple tensor algebra frameworks targeting heterogeneous computing platforms. In this paper, we present Tensor Algebra for Many-body Methods (TAMM), a framework for productive and performance-portable development of scalable computational chemistry methods. TAMM decouples the specification of the computation from the execution of these operations on available high-performance computing systems. With this design choice, the scientific application developers (domain scientists) can focus on the algorithmic requirements using the tensor algebra interface provided by TAMM, whereas high-performance computing developers can direct their attention to various optimizations on the underlying constructs, such as efficient data distribution, optimized scheduling algorithms, and efficient use of intra-node resources (e.g., graphics processing units). The modular structure of TAMM allows it to support different hardware architectures and incorporate new algorithmic advances. We describe the TAMM framework and our approach to the sustainable development of scalable ground- and excited-state electronic structure methods. We present case studies highlighting the ease of use, including the performance and productivity gains compared to other frameworks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Detection of translational noncrystallographic symmetry in Patterson functions

Detection of translational noncrystallographic symmetry (TNCS) can be critical for success in crystallographic phasing, particularly when molecular-replacement models are poor or anomalous phasing information is weak. If the correct TNCS is detected then expected intensity factors for each reflection can be refined, so that the maximum-likelihood functions underlying molecular replacement and single-wavelength anomalous dispersion use appropriate structure-factor normalization and variance terms. Here, an analysis of a curated database of protein structures from the Protein Data Bank to investigate how TNCS manifests in the Patterson function is described. These studies informed an algorithm for the detection of TNCS, which includes a method for detecting the number of vectors involved in any commensurate modulation (the TNCS order). The algorithm generates a ranked list of possible TNCS associations in the asymmetric unit for exploration during structure solution.

59 BASIC BIOLOGICAL SCIENCES↗

Accelerated Voltage Regulation in Multi-Phase Distribution Networks Based on Hierarchical Distributed Algorithm

Here, we introduce a hierarchical distributed algorithm to solve optimal power flow (OPF) problems that aim at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm highlights unprecedented scalability to large multi-phase distribution networks by jointly exploring the tree/subtrees structure of a large radial distribution network and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves OPF. The proposed implementation significantly reduces the computation loads compared to the centrally coordinated implementation of the same primal-dual algorithm without compromising optimality. Numerical findings on a 4,521-node test feeder show that the designed algorithm achieves more than 10-fold acceleration in the speed of convergence compared to the centrally coordinated primal-dual algorithm through reducing and distributing computational loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Selection of Spectral Variables and Improvement of the Accuracy of Calibration of Temperature by Projection onto Latent Structures Using the Fluorescence Spectra of Yb{sup 3+}:CaF{sub 2}

The efficiency of interval methods for selecting variables and the divisive method of interval optimization by a genetic algorithm is considered with the purpose to increase the accuracy of temperature calibration by projection onto latent structures. The fluorescence spectra of Yb{sup 3+}:CaF{sub 2} recorded in the 880–1120 nm band with a resolution of approximately 0.2 nm in the temperature range from 66 to 150°C in 2°C increments are used as an example. The best result for the root-mean-square error of temperature prediction in the test sample (0.45°C) was obtained by interval projection onto latent structures by a combination of moving windows. The use of methods for selecting spectral variables improved more than two times the accuracy of temperature calibration.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

TH-AB-202-01: Daily Lung Tumor Motion Characterization On EPIDs Using a Markerless Tiling Model

Purpose: Tracking lung tumor motion in real time allows for target dose escalation while simultaneously reducing dose to sensitive structures, thus increasing local control without increasing toxicity. We present a novel intra-fractional markerless lung tumor tracking algorithm using MV treatment beam images acquired during treatment delivery. Strong signals superimposed on the tumor significantly reduced the soft tissue resolution; while different imaging modalities involved introduce global imaging discrepancies. This reduced the comparison accuracies. A simple yet elegant Tiling algorithm is reported to overcome the aforementioned issues. Methods: MV treatment beam images were acquired continuously in beam’s eye view (BEV) by an electronic portal imaging device (EPID) during treatment and analyzed to obtain tumor positions on every frame. Every frame of the MV image was simulated by a composite of two components with separate digitally reconstructed radiographs (DRRs): all non-moving structures and the tumor. This Titling algorithm divides the global composite DRR and the corresponding MV projection into sub-images called tiles. Rigid registration is performed independently on tile-pairs in order to improve local soft tissue resolution. This enables the composite DRR to be transformed accurately to match the MV projection and attain a high correlation value through a pixel-based linear transformation. The highest cumulative correlation for all tile-pairs achieved over a user-defined search range indicates the 2-D coordinates of the tumor location on the MV projection. Results: This algorithm was successfully applied to cine-mode BEV images acquired during two SBRT plans delivered five times with different motion patterns to each of two phantoms. Approximately 15000 beam’s eye view images were analyzed and tumor locations were successfully identified on every projection with a maximum/average error of 1.8 mm / 1.0 mm. Conclusion: Despite the presence of strong anatomical signal overlapping with tumor images, this markerless detection algorithm accurately tracks intrafractional lung tumor motions. This project is partially supported by an Elekta research grant.

60 APPLIED LIFE SCIENCES↗

From square-well to Janus: Improved algorithm for integral equation theory and comparison with thermodynamic perturbation theory within the Kern-Frenkel model

Building upon past work on the phase diagram of Janus fluids [F. Sciortino, A. Giacometti, and G. Pastore, Phys. Rev. Lett. 103, 237801 (2009)], we perform a detailed study of integral equation theory of the Kern-Frenkel potential with coverage that is tuned from the isotropic square-well fluid to the Janus limit. An improved algorithm for the reference hypernetted-chain (RHNC) equation for this problem is implemented that significantly extends the range of applicability of RHNC. Results for both structure and thermodynamics are presented and compared with numerical simulations. Unlike previous attempts, this algorithm is shown to be stable down to the Janus limit, thus paving the way for analyzing the frustration mechanism characteristic of the gas-liquid transition in the Janus system. The results are also compared with Barker-Henderson thermodynamic perturbation theory on the same model. We then discuss the pros and cons of both approaches within a unified treatment. On balance, RHNC integral equation theory, even with an isotropic hard-sphere reference system, is found to be a good compromise between accuracy of the results, computational effort, and uniform quality to tackle self-assembly processes in patchy colloids of complex nature. Further improvement in RHNC however clearly requires an anisotropic reference bridge function.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Soft and transferable pseudopotentials from multi-objective optimization

Ab initio pseudopotentials are a linchpin of modern molecular and condensed matter electronic structure calculations. In this work, we employ multi-objective optimization to maximize pseudopotential softness while maintaining high accuracy and transferability. To accomplish this, we develop a formulation in which softness and accuracy are simultaneously maximized, with accuracy determined by the ability to reproduce all-electron energy differences between Bravais lattice structures, whereupon the resulting Pareto frontier is scanned for the softest pseudopotential that provides the desired accuracy in established transferability tests. We employ an evolutionary algorithm to solve the multi-objective optimization problem and apply it to generate a comprehensive table of optimized norm-conserving Vanderbilt (ONCV) pseudopotentials (https://github.com/SPARC-X/SPMS-psps). Here, we show that the resulting table is softer than existing tables of comparable accuracy, while more accurate than tables of comparable softness. The potentials thus afford the possibility to speed up calculations in a broad range of applications areas while maintaining high accuracy.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Degenerate variational integrators for magnetic field line flow and guiding center trajectories

Symplectic integrators offer many benefits for numerically approximating solutions to Hamiltonian differential equations, including bounded energy error and the preservation of invariant sets. Two important Hamiltonian systems encountered in plasma physics—the flow of magnetic field lines and the guiding center motion of magnetized charged particles—resist symplectic integration by conventional means because the dynamics are most naturally formulated in non-canonical coordinates. New algorithms were recently developed using the variational integration formalism; however, those integrators were found to admit parasitic mode instabilities due to their multistep character. This work eliminates the multistep character, and therefore the parasitic mode instabilities via an adaptation of the variational integration formalism that we deem “degenerate variational integration.” Both the magnetic field line and guiding center Lagrangians are degenerate in the sense that the resultant Euler-Lagrange equations are systems of first-order ordinary differential equations. We show that retaining the same degree of degeneracy when constructing discrete Lagrangians yields one-step variational integrators preserving a non-canonical symplectic structure. Lastly, numerical examples demonstrate the benefits of the new algorithms, including superior stability relative to the existing variational integrators for these systems and superior qualitative behavior relative to non-conservative algorithms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advanced Modeling of Ions in Solutions, on Surfaces, and in Biological Environments (Final Scientific/Technical Report)

The research supported by this grant focused on modeling liquid water from basic microscopic theory and on developing advanced methodologies for molecular simulation and electronic structure calculation of large and disordered systems. Water is arguably the most important molecule on earth: without it there would be no life, as we know it. Water does not behave as a simple liquid. Understanding its unique and anomalous properties at the molecular level has been the focus of intense study during the entire last century and still is a major goal of research today. To address the problem we adopted a multipronged approach that included methodological and algorithmic developments as well as simulations of important model systems. We made progress on several key issues. (i) We implemented accurate electronic structure schemes for modeling water from quantum mechanical theory that make accessible in simulations processes driven by formation and breaking of chemical bonds. We studied in this way neat bulk water and simple solvated ions. We could understand, in particular, why hydronium, i.e. the positive water ion, diffuses faster than its negative counterpart, the hydroxyl, solving a 200-year-old ionic mystery of water, as reported in a news article featuring our study on Chemistry World, the magazine of the Royal Society of Chemistry (U.K.). (ii) Using advanced statistical mechanical techniques we studied water in the deeply undercooled regime, which may hold the clue to understanding many of the water anomalies. These conditions are currently only accessible to simulations based on empirical force fields. We found that deeply undercooled water, as described by the popular force field ST2, possesses a secondary critical point, below which it would spontaneously separate into two liquids, one of low-density (LDL) and one of high-density (HDL), much in the same way in which water and oil phase-separate at room temperature. The secondary critical point is supported indirectly by many experiments, but rapid ice nucleation has so far hindered direct observation. In related studies we gained new insight on the connection of the two metastable liquids with the two corresponding amorphous ice phases, LDA and HDA, which are observed experimentally. (iii) We developed and implemented several new algorithms for computing the electronic structure of large systems and to accelerate the calculation of electron exchange energies. We applied these methodologies to model nanomaterials, such as nanoribbons and nanoflakes, and to study water absorption and splitting on nanomaterials. (iv) We developed new local order descriptors. (v) In the last year of the project we developed a methodology based on deep neural networks to construct model interatomic potentials that can accurately reproduce ab-initio quantum mechanical simulations at the computational cost of empirical force fields. These potentials will make possible to access the size and time scales that are currently only accessible with empirical force fields without loosing the predictive power of ab-initio simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantitative Uncertainty Analysis for Diffraction

Current software uses a least squares statistical method. For each model parameter, current software yields a point estimate and estimated standard error for each point estimate. In contrast, we have employed a Bayesian approach with sampling algorithm to provide a full posterior probability density function on each model parameter. This yields a different type of solution (probabilistic) with better fidelity. The Quantitative Uncertainty Analysis for Diffraction (QUAD) package returns a matrix of affect model parameters as a function of iteration through the MCMC analysis. QUAD is a Python code that allows for analysis of X-ray and neutron diffraction data to infer the structure of materials with quantifiable certainty. The code uses Bayesian statistics and Markov chain sampling algorithms to create posterior probability distributions on all material structure parameters that are modeled by a researcher. The statistical packages use the open source GSASII project as a library to calculate model diffraction patterns.

Fancher, ChristopherM↗

Unitary qubit lattice algorithm for three-dimensional vortex solitons in hyperbolic self-defocusing media

To obtain stable vortex structures in three-dimensional (3D) nonlinear optics, Efremidis et al. (2007) have introduced a generalized Nonlinear Schrodinger equation (NLS) in which the transverse quantum vortex components are stabilized by a longitudinal bright soliton: i.e., the elliptic operator ∇ 2 is replaced by its hyperbolic counterpart ∇ ⊥ 2 - ∂ 2 / ∂ z 2 . A new 3D mesoscopic qubit unitary lattice algorithm is developed for this generalized NLS. One introduces 2 qubits for each lattice site and entangles them with a local unitary collision operator. This entanglement is then spread throughout the lattice by nearest neighbor streaming. These interwined operators lead to an extremely well parallelized code on classical supcomputers while their unitary structure will permit encoding onto a quantum computer. Somewhat unexpectedly, the hyperbolic operator can be realized from variations in the collision operator, without introducing variations in the streaming operator. The initial line vortices are generated by Pade asymptotics. The energy constraint is conserved to 10 digit accuracy.

3D solitons↗

NEW SUNS IN THE COSMOS. III. MULTIFRACTAL SIGNATURE ANALYSIS

In the present paper, we investigate the multifractality signatures in hourly time series extracted from the CoRoT spacecraft database. Our analysis is intended to highlight the possibility that astrophysical time series can be members of a particular class of complex and dynamic processes, which require several photometric variability diagnostics to characterize their structural and topological properties. To achieve this goal, we search for contributions due to a nonlinear temporal correlation and effects caused by heavier tails than the Gaussian distribution, using a detrending moving average algorithm for one-dimensional multifractal signals (MFDMA). We observe that the correlation structure is the main source of multifractality, while heavy-tailed distribution plays a minor role in generating the multifractal effects. Our work also reveals that the rotation period of stars is inherently scaled by the degree of multifractality. As a result, analyzing the multifractal degree of the referred series, we uncover an evolution of multifractality from shorter to larger periods.

79 ASTRONOMY AND ASTROPHYSICS↗

Free Energy Landscapes of Membrane Transport Proteins

Molecular dynamics (MD) is now a widespread tool for investigating biochemical and biomolecular systems, its prevalence, in no small part, being due to significant advances in computational hardware over the last few decades. Even non-experts can now routinely use MD for protein and nucleic acid structure refinement, studying conformational switching events, and investigating solvation effects due to ligand/drug binding. Nonetheless, the vast majority of simulations being done today utilize only rudimentary algorithmic approaches – so-called “brute force” MD – which only permit access to a small fraction of what the approach has to offer. This is largely because the core algorithm is simple, while advanced techniques can require everything from more sophisticated models and data structures to complicated on-the-fly analysis. A core goal of this early science project is to bring one such advanced MD approach into the broader arena of high-performance computing.In particular, the powerful method of constant-pH MD has long been a relegated to experienced users and specialized model systems. In this work we develop and implement a constant-pH MD algorithm in the NAMD simulation engine making it suitable for deployment on large-scale, next-generation supercomputers as well as ambitious, cutting-edge biological applications. We report,for the first time, constant-pH simulations of a membrane transport protein and use the results to analyze its free energy landscape for ion-selectivity.

59 BASIC BIOLOGICAL SCIENCES↗

Automatic mesh adaptivity for hybrid Monte Carlo/deterministic neutronics modeling of difficult shielding problems

The CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques dramatically increase the efficiency of neutronics modeling, but their use in the accurate design analysis of very large and geometrically complex nuclear systems has been limited by the large number of processors and memory requirements for their preliminary deterministic calculations and final Monte Carlo calculation. Three mesh adaptivity algorithms were developed to reduce the memory requirements of CADIS and FW-CADIS without sacrificing their efficiency improvement. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility. Using these algorithms resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation and, additionally, increased the efficiency of the Monte Carlo simulation by a factor of at least 3.4. The three algorithms enabled this difficult calculation to be accurately solved using an FW-CADIS simulation on a regular computer cluster, eliminating the need for a world-class super computer.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗

Optimal Tool Design for Grinding Operations

An algorithm is outlined for the design of abrasive tools of optimal structure for a specific grinding operation, ensuring maximum productivity and minimum cost. Systems analysis is employed. Mathematical models for the design calculation are presented, and an example is given to illustrate the optimization of grinding tools.

42 ENGINEERING↗