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,081 records · Page 60

Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration

Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale using highperformance computing. To address this challenge, recent work has introduced distributed hierarchical contour trees for distributed computation and storage of contour trees. However, effective use of these distributed structures in analysis and visualization requires subsequent computation of geometric properties and branch decomposition to support contour extraction and exploration. In this work, we introduce distributed algorithms for augmentation, hypersweeps, and branch decomposition that enable parallel computation of geometric properties, and support the use of distributed contour trees as query structures for scientific exploration. Finally, we evaluate the parallel performance of these algorithms and apply them to identify and extract important contours for scientific visualization.

97 MATHEMATICS AND COMPUTING↗

A Preprocessing Tool for Enhanced Ion Mobility–Mass Spectrometry-Based Omics Workflows

The ability to improve the data quality of ion mobility–mass spectrometry (IM-MS) measurements is of great importance for enabling modular and efficient computational workflows and gaining better qualitative and quantitative insights from complex biological and environmental samples. We developed the PNNL PreProcessor, a standalone and user-friendly software housing various algorithmic implementations to generate new MS-files with enhanced signal quality and in the same instrument format. Different experimental approaches are supported for IM-MS based on Drift-Tube (DT) and Structures for Lossless Ion Manipulations (SLIM), including liquid chromatography (LC) and infusion analyses. The algorithms extend the dynamic range of the detection system, while reducing file sizes for faster and memory-efficient downstream processing. Specifically, multidimensional smoothing improves peak shapes of poorly defined low-abundance signals, and saturation repair reconstructs the intensity profile of high-abundance peaks from various analyte types. Further, other functionalities are data compression and interpolation, IM demultiplexing, noise filtering by low intensity threshold and spike removal, and exporting of acquisition metadata. Several advantages of the tool are illustrated, including an increase of 19.4% in lipid annotations and a two-times faster processing of LC-DT IM-MS data-independent acquisition spectra from a complex lipid extract of a standard human plasma sample. The software is freely available at https://omics.pnl.gov/software/pnnl-preprocessor.

59 BASIC BIOLOGICAL SCIENCES↗

Development of the DIFFRACALC program for analyzing the phase composition of alloys

The DiffraCalc software package is developed for automatic indexing of electron diffraction patterns. The program can operate with the existing base of X-ray diffraction data, containing information about the crystal structures of more than 100 thousands of materials. This information has been extracted from open sources. A compatibility with standard crystallographic files is implemented. In the indexing mode, the program automatically analyzes an experimental diffraction pattern, implementing a search for an appropriate phase from the list compiled by a user proceeding from the crystallographic database. The indexing mode algorithm is constructed using the method of pair reflections. In the simulation mode, the program calculates the electron diffraction pattern for a specified material, which is an additional way to verify the indexing results.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

Automatic mesh adaptivity for CADIS and FW-CADIS 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 macro-material 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 de-couples 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, obviating the need for a world-class super computer. (authors)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Many-fermion simulation from the contracted quantum eigensolver without fermionic encoding of the wave function

Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding—a mapping by which the qubits are encoded with fermion statistics. Here we generalize the contracted quantum eigensolver (CQE) to avoid fermionic encoding of the wave function. In contrast to the variational quantum eigensolver, the CQE solves for a many-fermion stationary state by minimizing the contraction (projection) of the Schrödinger equation onto two fermions. We avoid fermionic encoding of the wave function by contracting the Schrödinger equation onto an unencoded pair of particles. Solution of the resulting contracted equation by a series of unencoded two-body exponential transformations generates an unencoded wave function from which the energy and two-fermion reduced density matrix (2-RDM) can be computed. We apply the unencoded and the encoded CQE algorithms to the hydrogen fluoride molecule, the dissociation of oxygen O 2 , and a series of hydrogen chains. Both algorithms show comparable convergence towards the exact ground-state energies and 2-RDMs, but the unencoded algorithm has computational advantages in terms of state preparation and tomography.

74 ATOMIC AND MOLECULAR PHYSICS↗

Higher-order factorization machine for accurate surrogate modeling in material design

Efficient and robust optimization is important in material science for identifying optimal structural parameters and enhancing material performance. Surrogate-based active learning algorithms have recently gained great attention for their ability to efficiently navigate large, high-dimensional design spaces. Among surrogate models, 2 nd -order factorization machine (FM) models are widely employed as the surrogate model in active learning algorithms due to their balance between simplicity and effectiveness. However, their quadratic nature limits their capacity to capture complex, higher-order interactions among variables, often leading to suboptimal solutions. To overcome this limitation, we propose an active learning scheme integrating a 3 rd -order FM model, capable of modeling three-variable interactions and more intricate relationships in material systems. We comprehensively evaluate the surrogate modeling performance of the 3 rd -order FM case using various objective functions. Furthermore, we examine the optimization reliability and efficiency of the 3 rd -order FM-based active learning in a real-world material design task (e.g., nanophotonic structures for transparent radiative cooling). Our study shows that the 3 rd -order FM outperforms the 2 nd -order model in both surrogate accuracy and optimization performance, highlighting higher-order models’ promises for material design and optimization problems.

Factorization machine↗

Antiferromagnetic character of the quantum phase transition in the Hubbard model on the honeycomb lattice

In this work we provide a unified, comprehensive treatment of all operators that contribute to the antiferromagnetic, ferromagnetic, and charge-density-wave structure factors and order parameters of the hexagonal Hubbard Model. We use the Hybrid Monte Carlo algorithm to perform a systematic, carefully controlled analysis in the temporal Trotter error and of the thermodynamic limit. We expect our findings to improve the consistency of Monte Carlo determinations of critical exponents. We perform a data collapse analysis and determine the critical exponent β = 0.898 (37) for the semimetal-Mott insulator transition in the hexagonal Hubbard Model. Our methods are applicable to a wide range of lattice theories of strongly correlated electrons.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A group finder algorithm optimised for the study of local galaxy environments

Context. The majority of galaxy group catalogues available in the literature use the popular friends-of-friends algorithm which links galaxies using a linking length. One potential drawback to this approach is that clusters of points can be linked with thin bridges which may not be desirable. In order to study galaxy groups, it is important to obtain realistic group structures. Aim. Here, in this study, we present a new simple group finder algorithm, TD-ENCLOSER, that finds the group that encloses a target galaxy of interest. Methods. TD-ENCLOSER is based on the kernel density estimation method which treats each galaxy, represented by a zero-dimensional particle, as a two-dimensional circular Gaussian. The algorithm assigns galaxies to peaks in the density field in order of density in descending order (‘top down’) so that galaxy groups ‘grow’ around the density peaks. Outliers in under-dense regions are prevented from joining groups by a specified hard threshold, while outliers at the group edges are clipped below a soft (blurred) interior density level. Results. The group assignments are largely insensitive to all free parameter variations apart from the hard density threshold and the kernel standard deviation, although this is a known feature of density-based group finder algorithms and it operates with a computing speed that increases linearly with the size of the input sample. In preparation for a companion paper, we also present a simple algorithm to select unique representative groups when duplicates occur. Conclusions. TD-ENCLOSER is tested on a mock galaxy catalogue using a smoothing scale of 0.3 Mpc and is found to be able to recover the input group distribution with sufficient accuracy to be applied to observed galaxy distributions.

79 ASTRONOMY AND ASTROPHYSICS↗

Speed vs Accuracy: Effect on Ligand Pose Accuracy of Varying Box Size and Exhaustiveness in AutoDock Vina

Abstract Structure‐based virtual high‐throughput screening involves docking chemical libraries to targets of interest. A parameter pertinent to the accuracy of the resulting pose is the root mean square deviation (RMSD) from a known crystallographic structure, i. e., the ‘docking power’. Here, using a popular algorithm, Autodock Vina, as a model program, we evaluate the effects of varying two common docking parameters: the box size (the size of docking search space) and the exhaustiveness of the global search (the number of independent runs starting from random ligand conformations) on the RMSD from the PDBbind v2017 refined dataset of experimental protein‐ligand complexes. Although it is clear that exhaustiveness is an important parameter, there is wide variation in the values used, with variation between 1 and >100. We, therefore, evaluated a combination of cubic boxes of different sizes and five exhaustiveness values (1, 8, 25, 50, 75, 100) within the range of those commonly adopted. The results show that the default exhaustiveness value of 8 performs well overall for most box sizes. In contrast, for all box sizes, but particularly for large boxes, an exhaustiveness value of 1 led to significantly higher median RMSD (mRMSD) values. The docking power was slightly improved with an exhaustiveness of 25, but the mRMSD changes little with values higher than 25. Therefore, although low exhaustiveness is computationally faster, the results are more likely to be far from reality, and, conversely, values >25 led to little improvement at the expense of computational resources. Overall, we recommend users to use at least the default exhaustiveness value of 8 for virtual screening calculations.

Agarwal, Rupesh↗

Toward Discord : Code for Simulating Continuous Spin Systems

A new computational tool to simulate classical spin systems with frustrated crystal structures is presented. Complementary single- and cluster-spin flip algorithms are implemented to calculate the diffuse scattering patterns, spin-pair correlations, and thermodynamic quantities. Test cases of geometrically frustrated kagome, pyrochlore, and cubic systems are detailed. Two recent scientific cases are also shown here. This new method, together with recent developments of the rmc-discord package (https://github.com/zjmorgan/rmc-discord), represent integrated and strategic step in a complete forward and reverse Monte Carlo framework discord.

36 MATERIALS SCIENCE↗

OpenRBC: A Fast Simulator of Red Blood Cells at Protein Resolution

We present OpenRBC, a coarse-grained molecular dynamics code, which is capable of performing an unprecedented in silico experiment—simulating an entire mammal red blood cell lipid bilayer and cytoskeleton as modeled by multiple millions of mesoscopic particles—using a single shared memory commodity workstation. To achieve this, we invented an adaptive spatial-searching algorithm to accelerate the computation of short-range pairwise interactions in an extremely sparse three-dimensional space. The algorithm is based on a Voronoi partitioning of the point cloud of coarse-grained particles, and is continuously updated over the course of the simulation. The algorithm enables the construction of the key spatial searching data structure in our code, i.e., a lattice-free cell list, with a time and space cost linearly proportional to the number of particles in the system. The position and the shape of the cells also adapt automatically to the local density and curvature. The code implements OpenMP parallelization and scales to hundreds of hardware threads. It outperforms a legacy simulator by almost an order of magnitude in time-to-solution and >40 times in problem size, thus providing, to our knowledge, a new platform for probing the biomechanics of red blood cells.

Biophysics↗

Protonation Dynamics of Confined Ethanol–Water Mixtures in H-ZSM-5 from Machine Learning-Driven Metadynamics

Zeolites are indispensable heterogeneous catalysts in industrial chemical processes, valued for their strong Brønsted acidity, well-defined microporous frameworks, and tunable pore structures. Their catalytic activity arises primarily from Brønsted acid sites (BAS), typically present as bridging hydroxyl groups (Si–OH–Al). Under aqueous reaction conditions, these protons interact dynamically with water and alcohol molecules, leading to complex solvation and protonation behavior within confined pores. In this study, we investigate the protonation equilibrium occurring between ethanol and water at the BAS of acidic zeolites under varying hydration levels, i.e., C2H5OH–(H2O)n, n=1–4. Local structure was analyzed through an adaptive-learning global optimization algorithm, while enhanced sampling molecular dynamics simulations with Well-Tempered Metadynamics (WMetaD) and machine learning interatomic potentials (MLPs) provide free-energy surfaces (FES) at variable hydration levels. The results reveal a strong dependence of proton localization on the degree of hydration. At low hydration (1 water molecule), the proton resides predominantly on ethanol; with 2 water molecules, it shifts toward water, and at higher hydration (3 or more water molecules), it becomes extensively delocalized over the water cluster. These findings underscore the critical role of solvation in modulating acid site behavior and suggest that a minimum of three water molecules is necessary to fully stabilize the proton on water within the zeolite framework. This solvation threshold has significant implications for catalytic processes, particularly in biomass conversion reactions where alcohol protonation is a key step in dehydration mechanisms.

machine learning↗

Coherent diffraction study of calcite crystallization during the hydration of tricalcium silicate

The aim of this work is using Bragg coherent X-ray diffraction imaging (BCDI) to study the calcite crystallization during carbonation of hydrated tricalcium silicate (C 3 S). Portland cement is a very complex synthesized product whose 50–70% mass is composed of C 3 S, which is the most important phase to produce calcium silicate hydrates and calcium hydroxide. Hence, its hydration contributes greatly to the hydration of cement and later to the carbonation of cement products when it reacts with CO 2 , often from the air, to form calcium carbonates. BCDI has emerged in the last decade as a promising high-resolution lens-less imaging approach for characterization of various samples. It has made significant progress with the development of X-ray sources and phase-retrieval algorithms. BCDI allows for imaging the whole three-dimensional structure of micro- and sub-micro- crystalline materials and can show the strain distribution at the nanometer spatial resolution. Finally, results show that calcite crystallization follows a through-solution reaction and the growth model of the calcite crystal can be explained by using “phase domain” theory. In conclusion, during carbonation, calcite crystals grow by increasing the number of phase domains within them while the domain size remains at about 200–300 nm.

36 MATERIALS SCIENCE↗

Density Matrix Implementation of the Fermi–Löwdin Orbital Self-Interaction Correction Method

The Fermi–Löwdin orbital self-interaction correction (FLOSIC) method effectively provides a transformation from canonical orbitals to localized Fermi–Löwdin orbitals which are used to remove the self-interaction error in the Perdew–Zunger (PZ) framework. This transformation is solely determined by a set of points in space, called Fermi–Löwdin descriptors (FODs), and the occupied canonical orbitals or the density matrix. In this work, we provide a detailed workflow for the implementation of the FLOSIC method for removal of self-interaction error in DFT calculations in an orbital-by-orbital basis that takes advantage of the unitary invariant nature of the FLOSIC method. In this way, it is possible to cast the self-consistent energy minimization at fixed FODs in the same manner than standard Kohn–Sham with one additional term in the Kohn–Sham Hamiltonian that introduces the PZ self-interaction correction. Each energy minimization iteration is divided in two substeps, one for the density matrix and one for the FODs. Expressions for the effective Kohn–Sham matrix and FOD gradients are provided such that its implementation is suitable for most electronic structure codes. Here, we analyze the convergence characteristics of the algorithm and present applications for the evaluation of NMR shielding constants and real-time time-dependent DFT simulations based on the Liouville–von Neumann equation to calculate excitation energies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Imaging antiferromagnetic antiphase domain boundaries using magnetic Bragg diffraction phase contrast

Manipulating magnetic domains is essential for many technological applications. Recent breakthroughs in Antiferromagnetic Spintronics brought up novel concepts for electronic device development. Imaging antiferromagnetic domains is of key importance to this field. Unfortunately, some of the basic domain types, such as antiphase domains, cannot be imaged by conventional techniques. Herein, we present a new domain projection imaging technique based on the localization of domain boundaries by resonant magnetic diffraction of coherent X rays. Contrast arises from reduction of the scattered intensity at the domain boundaries due to destructive interference effects. We demonstrate this approach by imaging antiphase domains in a collinear antiferromagnet Fe 2 Mo 3 O 8 , and observe evidence of domain wall interaction with a structural defect. Here, this technique does not involve any numerical algorithms. It is fast, sensitive, produces large-scale images in a single-exposure measurement, and is applicable to a variety of magnetic domain types.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Turnpike solutions of control problems in quantum systems

The model of a quantum system of interacting spins based on the Shrödinger equation with unbounded linear control is transformed to an equivalent derived system (known from the degenerate problems theory). It consists of a regular differential system with new control and description of impulse control modes. This reveals the general turnpike structure of control processes and allows to propose some effective algorithms of their investigation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-driven modeling and control of an X-ray bimorph adaptive mirror

Adaptive X-ray mirrors are being adopted on high-coherent-flux synchrotron and X-ray free-electron laser beamlines where dynamic phase control and aberration compensation are necessary to preserve wavefront quality from source to sample, yet challenging to achieve. Additional difficulties arise from the inability to continuously probe the wavefront in this context, which demands methods of control that require little to no feedback. In this work, a data-driven approach to the control of adaptive X-ray optics with piezo-bimorph actuators is demonstrated. This approach approximates the non-linear system dynamics with a discrete-time model using random mirror shapes and interferometric measurements as training data. For mirrors of this type, prior states and voltage inputs affect the shape-change trajectory, and therefore must be included in the model. Without the need for assumed physical models of the mirror's behavior, the generality of the neural network structure accommodates drift, creep and hysteresis, and enables a control algorithm that achieves shape control and stability below 2 nm RMS. Using a prototype mirror and ex situ metrology, it is shown that the accuracy of our trained model enables open-loop shape control across a diverse set of states and that the control algorithm achieves shape error magnitudes that fall within diffraction-limited performance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗