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,117 records · Page 62

High-throughput ab initio design of atomic interfaces using InterMatch

Forming a hetero-interface is a materials-design strategy that can access an astronomically large phase space. However, the immense phase space necessitates a high-throughput approach for an optimal interface design. Here we introduce a high-throughput computational framework, InterMatch, for efficiently predicting charge transfer, strain, and superlattice structure of an interface by leveraging the databases of individual bulk materials. Specifically, the algorithm reads in the lattice vectors, density of states, and the stiffness tensors for each material in their isolated form from the Materials Project. From these bulk properties, InterMatch estimates the interfacial properties. We benchmark InterMatch predictions for the charge transfer against experimental measurements and supercell density-functional theory calculations. We then use InterMatch to predict promising interface candidates for doping transition metal dichalcogenide MoSe 2 . Finally, we explain experimental observation of factor of 10 variation in the supercell periodicity within a few microns in graphene/α-RuCl 3 by exploring low energy superlattice structures as a function of twist angle using InterMatch. We anticipate our open-source InterMatch algorithm accelerating and guiding ever-growing interfacial design efforts. Moreover, the interface database resulting from the InterMatch searches presented in this paper can be readily accessed online.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Aggregation and Solubility of a Model Conjugated Donor–Acceptor Polymer

In conjugated polymers, solution-phase structure and aggregation exert a strong influence on device morphology and performance, making understanding solubility crucial for rational design. Using atomistic molecular dynamics (MD) and free-energy sampling algorithms, we examine the aggregation and solubility of the polymer PTB7, studying how side-chain structure can be modified to control aggregation. We demonstrate that free-energy sampling can be used to effectively screen polymer solubility in a variety of solvents but that solubility parameters derived from MD are not predictive. We then study the aggregation of variants of PTB7 including those with linear (octyl), branched (2-ethylhexyl), and cleaved (methyl) side chains, in a selection of explicit solvents and additives. As a result, energetic analysis demonstrates that while side chains do disrupt polymer backbone stacking, solvent exclusion is a critical factor controlling polymer solubility.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Solving the Bernstein-Vazirani problem using Majorana-based topological quantum algorithms

Executing quantum algorithms using Majorana zero modes—a major milestone for the field of topological quantum computing—requires a platform that can be scaled to large quantum registers, can be controlled in real time and space, and a braiding protocol that uses the unique properties of these exotic particles. Here, we demonstrate the first successful simulation of a Majorana-based, fault-tolerant quantum algorithm to solve the Bernstein-Vazirani problem in two-dimensional magnet-superconductor hybrid structures from initialization to read-out of the final many-body state. Utilizing the Majorana zero modes’ topological properties, we introduce an optimized braiding protocol for the algorithm and a scalable architecture for its implementation with an arbitrary number of qubits. We visualize the algorithm protocol in real time and space by computing the non-equilibrium density of states, which is proportional to the time-dependent differential conductance, and the non-equilibrium charge density, which assigns a unique signature to each final state of the algorithm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Accurate frozen core approximation for all-electron density-functional theory

We implement and benchmark the frozen core approximation, a technique commonly adopted in electronic structure theory to reduce the computational cost by means of mathematically fixing the chemically inactive core electron states. The accuracy and efficiency of this approach are well controlled by a single parameter, the number of frozen orbitals. Explicit corrections for the frozen core orbitals and the unfrozen valence orbitals are introduced, safeguarding against seemingly minor numerical deviations from the assumed orthonormality conditions of the basis functions. A speedup of over twofold can be achieved for the diagonalization step in all-electron density-functional theory simulations containing heavy elements, without any accuracy degradation in terms of the electron density, total energy, and atomic forces. This is demonstrated in a benchmark study covering 103 materials across the Periodic Table and a large-scale simulation of CsPbBr3 with 2560 atoms. Our study provides a rigorous benchmark of the precision of the frozen core approximation (sub-meV per atom for frozen core orbitals below −200 eV) for a wide range of test cases and for chemical elements ranging from Li to Po. The algorithms discussed here are implemented in the open-source Electronic Structure Infrastructure software package.

Yu, Victor Wen-zhe↗

DES science portal: Computing photometric redshifts

We present the Dark Energy Survey (DES) Science Portal, an integratedweb-based data interface designed to facilitate scientific analysis. Wedemonstrate how the Portal can provide a reliable environment to accesscomplete data sets, provide validation algorithms and metrics in the case ofmultiple methods and training configurations, and maintain the provenancebetween the different steps of a complex calculation, while ensuringreproducibility of the results. We use the estimation of DES photometricredshifts (photo-$z$s) as an example. A significant challenge facingphotometric surveys for cosmological purposes, such as DES, is the need toproduce reliable redshift estimates. The choice between competing algorithmsand configurations and the maintenance of an up-to-date spectroscopic databaseto build training sets, for example, are complex tasks when dealing with largeamounts of data that are regularly updated and constantly growing. We show howthe DES Science Portal can be used to train and validate several photo-$z$algorithms using the DES first year (Y1A1) data. The photo-$z$s estimated inthe Portal are used to feed the creation of catalogs for scientific workflows.While the DES collaboration is still developing techniques to obtain precisephoto-$z$s, having a structured framework like the one presented here iscritical for the systematic vetting of DES algorithmic improvements and theconsistent production of photo-$z$s in future DES releases.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Q4FY20 Quarterly Report. LL20-AM-sensor

Tardigrade is an effort to create tunable thermal expansion materials for use in a ruggedized lens housing. This requires new computational algorithms to model and predict thermal performance of meta-materials composed of multiple structured base materials and void-space, along with matching and developing 3D print technology to demonstrate the housing. Project is 13 months into the 30 month on complete project plan. We are continuing effort on 3 main technical thrusts: algorithm development, multi-material additive manufacturing process exploration, and sensor/optics design and engineering. In FY20 we underspent the initial budget, partly due to work restrictions from Covid-19 pandemic, but are working to make up lost time

42 ENGINEERING↗

Tardigrade (NA-22 Quarterly Report)

Tardigrade is an effort to create tunable thermal expansion materials for use in a ruggedized lens housing. This requires new computational algorithms to model and predict thermal performance of meta-materials composed of multiple structured base materials and void-space, along with matching and developing 3D print technology to demonstrate the housing. The project is 24 months into the 36-month plan. We are continuing effort on 3 main technical thrusts: material design algorithm development (transitioning into full 3D design), multi-material additive manufacturing process exploration, and sensor/optics design and engineering. In the last quarter, we have focused on developing the code for 3D Topology Optimization, building data sets for 2D autoencoder training, and finishing lens housing engineering for the microbolometer based test sensor. We are exploring 2 potential multi-material AM technologies, a polymer-based technique in development at LLNL and a metal SLS system produced by Aconity, called the AeroSint deposition head.

36 MATERIALS SCIENCE↗

Tardigrade (Quarterly Report Q1 FY2022)

Tardigrade is an effort to create tunable thermal expansion materials for use in a ruggedized lens housing. This requires new computational algorithms to model and predict thermal performance of meta-materials composed of multiple structured base materials and void-space, along with matching and developing 3D print technology to demonstrate the housing. The project is 27 months into the 36-month plan. We are continuing effort on 3 main technical thrusts: material design algorithm development (transitioning into full 3D design), multi-material additive manufacturing process exploration, and sensor/optics design and engineering. In the last quarter, we have focused on developing the code for 3D Topology Optimization, building data sets for 2D autoencoder training, and finishing lens housing engineering for the microbolometer based test sensor. We are exploring 2 potential multi-material AM technologies, a polymer-based technique in development at LLNL and a metal SLS system produced by Aconity, called the AeroSint deposition head.

36 MATERIALS SCIENCE↗

Optimized aperiodic multilayer structures for use as narrow-angular absorbers

In this paper, we investigate aperiodic multilayer structures for use as narrow-angular absorbers. The layer thicknesses and materials are optimized using a genetic global optimization algorithm coupled to a transfer matrix code to maximize the angular selectivity in the absorptance at a single or multiple wavelengths. We first consider structures composed of alternating layers of tungsten and silicon or silica, and find that it is not possible to achieve angular selectivity in the absorptance with such structures. We next consider structures composed of alternating layers of silicon and silica, and show that when optimized they exhibit high angular selectivity in absorptance. In addition, as the angular selectivity in absorptance increases, the wavelength range of high angular selectivity also decreases. Optimizing the material composition of the multilayer structures, in addition to optimizing the layer thicknesses, leads to marginal improvement in angular selectivity. Finally, we show that by optimizing the absorptance of the multilayer structures at multiple wavelengths, we can obtain structures exhibiting almost perfect absorptance at normal incidence and narrow angular width in absorptance at these wavelengths. Similar to the structures optimized at a single wavelength, the wavelength range of high angularly selective absorptance is narrow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al ., npj Quantum Inf. 10 , 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. Here, in this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.

Algebraic structures↗

A numerical approach for simulating fluid structure interaction of flexible thin shells undergoing arbitrarily large deformations in complex domains

We present a new numerical methodology for simulating fluid–structure interaction (FSI) problems involving thin flexible bodies in an incompressible fluid. The FSI algorithm uses the Dirichlet–Neumann partitioning technique. The curvilinear immersed boundary method (CURVIB) is coupled with a rotation-free finite element (FE) model for thin shells enabling the efficient simulation of FSI problems with arbitrarily large deformation. Turbulent flow problems are handled using large-eddy simulation with the dynamic Smagorinsky model in conjunction with a wall model to reconstruct boundary conditions near immersed boundaries. The CURVIB and FE solvers are coupled together on the flexible solid–fluid interfaces where the structural nodal positions, displacements, velocities and loads are calculated and exchanged between the two solvers. Loose and strong coupling FSI schemes are employed enhanced by the Aitken acceleration technique to ensure robust coupling and fast convergence especially for low mass ratio problems. The coupled CURVIB-FE-FSI method is validated by applying it to simulate two FSI problems involving thin flexible structures: 1) vortex-induced vibrations of a cantilever mounted in the wake of a square cylinder at different mass ratios and at low Reynolds number; and 2) the more challenging high Reynolds number problem involving the oscillation of an inverted elastic flag. For both cases the computed results are in excellent agreement with previous numerical simulations and/or experiential measurements. Grid convergence tests/studies are carried out for both the cantilever and inverted flag problems, which show that the CURVIB-FE-FSI method provides their convergence. Finally, the capability of the new methodology in simulations of complex cardiovascular flows is demonstrated by applying it to simulate the FSI of a tri-leaflet, prosthetic heart valve in an anatomic aorta and under physiologic pulsatile conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New Layered Structures of Cuprous Chalcogenides as Thin Film Solar Cell Materials: Cu 2 Te and Cu 2 Se

The stable crystal structures of two cuprous chalcogenides of Cu 2 X (X = Te or Se) are predicted using an adaptive genetic algorithm in combination with first-principles density functional theory calculations. Both systems are found to prefer a unique and previously unrecognized layered structure, with the total energies much lower than all structures proposed in the literature so far. The newly discovered structures are further shown to be dynamically and mechanically stable, and possess electronic properties consistent with existing experimental observations. In particular, their layered nature is expected to prevail over other structural forms at the interfaces of thin-film solar cells, and knowledge about the precise atomic structures of the interfaces is a prerequisite for achieving long-term stability and high efficiency of CdTe and Cu(In; Ga)Se 2 solar cells.

14 SOLAR ENERGY↗

Discovery of Ternary Antimonides A–Al–Sb (A = Rb or Cs) with Desired Structural Motifs Guided by Machine Learning

Specific structural motifs in inorganic solids are often related to their targeted physical properties. For many classes of solids, such as Zintl phases and polar intermetallics, the crystal structures are diverse and not easy to predict. Various antimonides that are potential thermoelectric materials were proposed to be synthesizable on the basis of their estimated formation energies. Their structures were broadly classified as clathrate, channel, layered, or network through a machine learning model trained on existing ternary phases and features based on elemental properties using the sure independence screening and sparsifying operator algorithm. Through experimental validation, three new ternary antimonides were synthesized and confirmed to form layered structures: tetragonal RbAlSb 2 and CsAlSb 2 , which are isopointal but not isotypic to LiBSi 2 ; and monoclinic Rb 2 Al 2 Sb 3 , which adopts the Na 2 Al 2 Sb 3 -type structure. Finally, reinvestigation of the related compound Cs 2 In 2 Sb 3 revealed a low thermal conductivity and p-type semiconducting behavior.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗

Novel superconducting structures of BH 2 under high pressure

The crystal structures of boron hydrides in a pressure range of 50–400 GPa were studied using the genetic algorithm (GA) method combined with first-principles density functional theory calculations. BH 4 and BH 5 are predicted to be thermodynamically unstable. Two new BH 2 structures with Cmcm and C 2/ c space group symmetries, respectively, were predicted, in which the B atoms tend to form two-dimensional sheets. The calculated band structures showed that in the pressure range of 50–150 GPa, the Cmcm -BH 2 phase has very small gaps, while the C 2/ c -BH 2 phase at 200–400 GPa is metallic. In conclusion, the superconductivity of the C 2/ c -BH 2 structure was also investigated, and electron–phonon coupling calculations revealed that the estimated T c values of C 2/ c -BH 2 are about 28.18–37.31 K at 250 GPa.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗

Biolink Model: A universal schema for knowledge graphs in clinical, biomedical, and translational science

Abstract Within clinical, biomedical, and translational science, an increasing number of projects are adopting graphs for knowledge representation. Graph‐based data models elucidate the interconnectedness among core biomedical concepts, enable data structures to be easily updated, and support intuitive queries, visualizations, and inference algorithms. However, knowledge discovery across these “knowledge graphs” (KGs) has remained difficult. Data set heterogeneity and complexity; the proliferation of ad hoc data formats; poor compliance with guidelines on findability, accessibility, interoperability, and reusability; and, in particular, the lack of a universally accepted, open‐access model for standardization across biomedical KGs has left the task of reconciling data sources to downstream consumers. Biolink Model is an open‐source data model that can be used to formalize the relationships between data structures in translational science. It incorporates object‐oriented classification and graph‐oriented features. The core of the model is a set of hierarchical, interconnected classes (or categories) and relationships between them (or predicates) representing biomedical entities such as gene, disease, chemical, anatomic structure, and phenotype. The model provides class and edge attributes and associations that guide how entities should relate to one another. Here, we highlight the need for a standardized data model for KGs, describe Biolink Model, and compare it with other models. We demonstrate the utility of Biolink Model in various initiatives, including the Biomedical Data Translator Consortium and the Monarch Initiative, and show how it has supported easier integration and interoperability of biomedical KGs, bringing together knowledge from multiple sources and helping to realize the goals of translational science.

60 APPLIED LIFE SCIENCES↗

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗