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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Optimizing group structures using hierarchical division

Creating group structures with few groups that give low errors is a difficult problem in reactor analysis. In recent years, automated optimization techniques have been applied to this task. We continue this trend by applying the hierarchical division algorithm to generate optimized group structures that minimize a cost function. At each stage, the algorithm adds a single group boundary to an existing group structure, dividing one group into two to increase the resolution of the group structure. The location of the added boundary is the one that gives the lowest error over all possible new boundary locations. Our implementation requires a beginning group structure, a set of candidate new boundary locations, and a set of reference reaction rates. As a proof of concept, we used WIMS-69 as the initial group structure, XMAS-172 as the ending group structures, and a 344-group reference group structure. Testing on two simple, homogenized reactor problems, we found that hierarchical division was able to reduce the error by a factor of around 5 with an increase of only 15% in the number of groups. Because hierarchical division can get stuck in local minima, it often reaches a plateau in its error reduction capability as many groups are added. Nevertheless, we find hierarchical division has strong potential to make good group structures into great group structures at a modest increase in computational cost. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1982

A general algorithm for solving the algebraic Riccati equation

The generalized eigenvalue problem provides a suitable framework for reliable solutions of many system theoretic, control, and estimation problems. A general algorithm for solving the matrix algebraic Riccati equation (ARE) which utilizes a pencil structure is described here. This algorithm avoids unnecessary inversion of cost or transition matrices, making it a numerically sound way to solve for the gains and/or ARE with singular quadratic costs, for cases satisfying detectability and stabilizability conditions. Examples are solution with discrete dead-beat control, noiseless measurements in Kalman filters and time-delays in discrete-time systems, which cause difficulties in the Hamiltonian standard eigenvalue problem formulation. The ARE algorithm implementatiton and numerical examples are shown.

Walker, R. A.↗
NASA NTRS1984

Development of numerical procedures for analysis of complex structures

The paper is concerned with the development of novel numerical procedures for the solution of static, stability, free vibration and dynamic response analysis of large, complex practical structures. Thus, details of numerical algorithms evolved for dynamic analysis of usual non-rotating and also rotating structures as well as finite dynamic elements are presented in the paper. Furthermore, the article provides some description of a general-purpose computer program STARS specifically developed for efficient analysis of complex practical structures.

Gupta, K. K.↗
DOE OSTI2021

Neuroevolutionary Learning of Particles and Protocols for Self-Assembly

Within simulations of molecules deposited on a surface we show that neuroevolutionary learning can design particles and time-dependent protocols to promote self-assembly, without input from physical concepts such as thermal equilibrium or mechanical stability and without prior knowledge of candidate or competing structures. Furthermore, the learning algorithm is capable of both directed and exploratory design: it can assemble a material with a user-defined property, or search for novelty in the space of specified order parameters. In the latter mode it explores the space of what can be made, rather than the space of structures that are low in energy but not necessarily kinetically accessible.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS1986

Dynamic compensator design for robust stability of linear uncertain systems

This paper presents a robust linear dynamic compensator design algorithm for linear uncertain systems whose parameters vary within given bounded sets. The algorithm explicitly incorporates the structure of the uncertainty into the design procedure and utilizes the elemental perturbation bounds developed recently. The special cases of linear state feedback and measurement feedback controllers are considered and the relative trade offs are discussed. The design algorithm is illustrated with the help of a simple example.

Yedavalli, R. K.↗
DOE OSTI2020

Finite-Temperature Structures of Supported Subnanometer Catalysts Inferred via Statistical Learning and Genetic Algorithm-Based Optimization

Single-atom catalysts (SACs) minimize noble metal utilization and can alter the activity and selectivity of supported metal nanoparticles. However, the morphology of active centers, including single atoms and subnanometer clusters of a few atoms, remains elusive due to experimental challenges. The computational cost to describe numerous cluster shapes and sizes makes direct first-principles calculations impractical. We present a computational framework to enable structure determination for single-atom and subnanometer cluster catalysts. As a case study, we obtained the low energy structures of Pd n (n = 1-21) clusters supported on CeO 2 (111), which are critical components of automobile three-way catalysts. Trained on density functional theory data, a three-dimensional cluster expansion is established using statistical learning to describe the Hamiltonian and predict energies of supported Pdn clusters of any structure. Low energy stable and metastable structures are identified using a Metropolis Monte Carlo-based genetic algorithm in the canonical ensemble at 300 K. We observe that supported single atoms sinter to form bilayer clusters and large cluster isomers share similarities in both shape and energy, and elucidate the significance of the support and microstructure on cluster stability. We discovered a simple surrogate structure-energy model, where the energy per atom scales with the square root of the average first coordination number, which can be used to estimate energies and compare the stability of clusters. Our framework, applicable to any metal/support system, fills an important methodological gap to predict the stability of supported metal catalysts in the subnanometer regime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

Ice Load Project Final Technical Report

As interest and investment in offshore wind projects increase worldwide, some turbines will be installed in locations where ice of significant thickness forms on the water surface. This ice moves under the driving forces of wind, current, and thermal effects and may result in substantial forces on bottom-fixed support structures. The North and Baltic Seas in Europe have begun to see significant wind energy development and the Great Lakes of the United States and Canada may host wind energy development in the near future. Design of the support structures for these projects is best performed through the use of an integrated tool that can calculate the cumulative effects of forces due to turbine operations, wind, waves, and floating ice. The dynamic nature of ice forces requires that these forces be included in the design simulations, rather than added as static forces to simulation results. The International Electrotechnical Commission (IEC) standard[2] for offshore wind turbine design and the International Organization for Standardization (ISO) standard[3] for offshore structures provide requirements and algorithms for the calculation of forces induced by surface ice; however, currently none of the major wind turbine dynamic simulation codes provides the ability to model ice loads. The scope of work of the project described in this report includes the development of a suite of subroutines, collectively named IceFloe, that meet the requirements of the IEC and ISO standards and couples with four of the major wind turbine dynamic simulation codes. The mechanisms by which ice forces impinge on offshore structures generally include the forces required for crushing of the ice against vertical-sided structures and the forces required to fracture the ice as it rides up on conical-sided structures. Within these two broad categories, the dynamic character of the forces with respect to time is also dependent on other factors such as the velocity and thickness of the moving ice and the response of the structure. In some cases, the dynamic effects are random and in other cases they are deterministic, such as the effect of structural resonance and coupling of the ice forces with the defection of the support structure. The initial versions of the IceFloe routines incorporate modules that address these varied force and dynamic phenomena with seven alternative algorithms that can be specified by the user. The IceFloe routines have been linked and tested with four major wind turbine aeroelastic simulation codes: FAST, a tool developed under the management of the National Renewable Energy Laboratory (NREL) and available free of charge from its web site; Bladed[4], a widely-used commercial package available from DNV GL; ADAMS[5], a general purpose multi-body simulation code used in the wind industry and available from MSC Software; and HAWC2[6], a code developed by and available for purchase from Danmarks Tekniske Universitet (DTU). Interface routines have been developed and tested with full wind turbine simulations for each of these codes and the source code and example inputs and outputs are available from the NREL website.

17 WIND ENERGY↗
NASA NTRS1986

COFS 1: Beam dynamics and control technology overview

The Control of Flexible Structures (COFS) 1 Project provides the invaluable opportunity to test, validate, and measure the effectiveness of theories, structural concepts, control systems, and flight certification processes for future missions through a research program focusing on multiple issues in large flexible structures, dynamics, and controls. The COFS 1 Project consists of a series of ground and flight activities building progressively from modeling and dynamic characterization of large space systems to the more complex issues of flexible-body control. The program objectives are to: determine the degree to which theory and ground testing can predict flight performance of next-generation low-frequency structures; evaluate structural fidelity of representative next-generation large deployable precision structure; assess math modeling requirements for large lightweight complex systems on which ground test results are questionable; determine degree to which scale model analysis and tests can be correlated to full-scale performance; evaluate system identification and state estimation algorithms on complex lightweight structures in the space environment; evaluate and verify controls/structures modeling capability; evaluate control laws and control systems; and evaluate damping effects in micro-g environment.

Allen, John L.↗
DOE OSTI2016

An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes

In current computer architectures, data movement (from die to network) is by far the most energy consuming part of an algorithm (≈20pJ/word on-die to ≈10,000 pJ/word on the network). To increase memory locality at the hardware level and reduce energy consumption related to data movement, future exascale computers tend to use many-core processors on each compute nodes that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD register length is expected to double every four years. As a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage of these upcoming architectures. In this paper, we present a new algorithm that allows for efficient and portable SIMD vectorization of current/charge deposition routines that are, along with the field gathering routines, among the most time consuming parts of the PIC algorithm. Our new algorithm uses a particular data structure that takes into account memory alignment constraints and avoids gather/scat;ter instructions that can significantly affect vectorization performances on current CPUs. The new algorithm was successfully implemented in the 3D skeleton PIC code PICSAR and tested on Haswell Xeon processors (AVX2-256 bits wide data registers). Results show a factor of ×2 to ×2.5 speed-up in double precision for particle shape factor of orders 1–3. The new algorithm can be applied as is on future KNL (Knights Landing) architectures that will include AVX-512 instruction sets with 512 bits register lengths (8 doubles/16 singles). Program summary Program Title: vec_deposition Program Files doi:http://dx.doi.org/10.17632/nh77fv9k8c.1 Licensing provisions: BSD 3-Clause Programming language: Fortran 90 External routines/libraries: OpenMP > 4.0 Nature of problem: Exascale architectures will have many-core processors per node with long vector data registers capable of performing one single instruction on multiple data during one clock cycle. Data register lengths are expected to double every four years and this pushes for new portable solutions for efficiently vectorizing Particle-In-Cell codes on these future many-core architectures. One of the main hotspot routines of the PIC algorithm is the current/charge deposition for which there is no efficient and portable vector algorithm. Solution method: Here we provide an efficient and portable vector algorithm of current/charge deposition routines that uses a new data structure, which significantly reduces gather/scatter operations. Vectorization is controlled using OpenMP 4.0 compiler directives for vectorization which ensures portability across different architectures. Restrictions: Here we do not provide the full PIC algorithm with an executable but only vector routines for current/charge deposition. These scalar/vector routines can be used as library routines in your 3D Particle-In-Cell code. However, to get the best performances out of vector routines you have to satisfy the two following requirements: (1) Your code should implement particle tiling (as explained in the manuscript) to allow for maximized cache reuse and reduce memory accesses that can hinder vector performances. The routines can be used directly on each particle tile. (2) You should compile your code with a Fortran 90 compiler (e.g Intel, gnu or cray) and provide proper alignment flags and compiler alignment directives (more details in README file).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantifying patterns in optical micrographs of one- and two-dimensional ellipsoidal particle assemblies

Current developments in colloidal science include the assembly of anisotropic colloids with broad geometric diversity. As the complexity of particle assemblies increases, the need for ubiquitous algorithms that quantitatively analyze images of the assemblies to deliver key information such as quantification of crystal structures becomes more urgent. This contribution describes algorithms capable of image analysis for classifying colloidal structures based on abstracted interparticle relationship information and quantitatively analyzing the abundance of each structure in mixed pattern assemblies. The algorithm parameters can be adjusted, allowing for the algorithms to be adapted for different image analyses. Three different ellipsoidal particle assembly images are presented to demonstrate the effectiveness of the algorithms: a one-dimensional (1D) particle chain assembly and two two-dimensional (2D) polymorphic crystals each consisting of assemblies of two distinct plane symmetry groups. Angle relationships between neighbouring particles are calculated and neighbour counts of each particle are determined. Combining these two parameters as rules for classification criteria allows for the labeling and quantification of each particle into a defined symmetry class within an assembly. The algorithms provide a labelled image comprising classification results and particle counts of each defined class. For multiple images or individual frames from a video, the script can be looped to achieve automatic processing. The yielded classification data allow for more in-depth image analysis of mixed pattern particle assemblies. Finally, we envision that these algorithms will have utility in quantitative analysis of images comprising ellipsoidal colloidal materials, nanoparticles, or biological matter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Quantum Simulation of Molecular Electronic States with a Transcorrelated Hamiltonian: Higher Accuracy with Fewer Qubits

Simulation of electronic structure is one of the most promising applications on noisy intermediate-scale quantum (NISQ) era devices. However, NISQ devices suffer from a number of challenges like limited qubit connectivity, short coherence times, and sizable gate error rates. Thus, desired quantum algorithms should require shallow circuit depths and low qubit counts to take advantage of these devices. Here, we attempt to reduce quantum resource requirements for molecular simulations on a quantum computer while maintaining the desired accuracy with the help of classical quantum chemical theories of canonical transformation and explicit correlation. In this work, compact ab initio Hamiltonians are generated classically, in the second quantized form, through an approximate similarity transformation of the Hamiltonian with (a) an explicitly correlated two-body unitary operator with generalized pair excitations that remove the Coulombic electron–electron singularities from the Hamiltonian and (b) a unitary one-body operator to efficiently capture the orbital relaxation effects required for accurate description of the excited states. The resulting transcorrelated Hamiltonians are able to describe both the ground and the excited states of molecular systems in a balanced manner. Using the variational quantum eigensolver (VQE) method based on the unitary coupled cluster with singles and doubles (UCCSD) ansatz and only a minimal basis set (ANO-RCC-MB), we demonstrate that the transcorrelated Hamiltonians can produce ground state energies comparable to the reference CCSD energies with the much larger cc-pVTZ basis set. This leads to a reduction in the number of required CNOT gates by more than 3 orders of magnitude for the chemical species studied in this work. Furthermore, using the quantum equation of motion (qEOM) formalism in conjunction with the transcorrelated Hamiltonian, we are able to reduce the deviations in the excitation energies from the reference EOM-CCSD/cc-pVTZ values by an order of magnitude. In conclusion, the transcorrelated Hamiltonians developed here are Hermitian and contain only one- and two-body interaction terms and thus can be easily combined with any quantum algorithm for accurate electronic structure simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Variational quantum eigensolver with reduced circuit complexity

Abstract The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenstates of a given Hamiltonian on noisy intermediate-scale quantum devices (NISQ). The practical realization is limited by the complexity of quantum circuits. Here we present an approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our ClusterVQE algorithm splits the initial qubit space into clusters which are further distributed on individual (shallower) quantum circuits. The clusters are obtained based on mutual information reflecting maximal entanglement between qubits, whereas inter-cluster correlation is taken into account via a new “dressed” Hamiltonian. ClusterVQE therefore allows exact simulation of the problem by using fewer qubits and shallower circuit depth at the cost of additional classical resources, making it a potential leader for quantum chemistry simulations on NISQ devices. Proof-of-principle demonstrations are presented for several molecular systems based on quantum simulators as well as IBM quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Quantum-classical hybrid algorithm using an error-mitigating N -representability condition to compute the Mott metal-insulator transition

Quantum algorithms for molecular electronic structure have been developed with lower computational scaling than their classical counterparts, but emerging quantum hardware is far from being capable of the coherence, connectivity, and gate errors required for their experimental realization. Here we propose a class of quantumclassical hybrid algorithms that computes the energy from a two-electron reduced density matrix (2-RDM). The 2-RDM is constrained by $N$-representability conditions, constraints for representing an $N$-electron wave function, which mitigate noise from the quantum circuit. We compute the strongly correlated dissociation of doublet H 3 into three hydrogen atoms. The hybrid quantum-classical computer matches the energies from full configuration interaction to 0.1 kcal/mol, one-tenth of “chemical accuracy,” even in the strongly correlated limit of dissociation. Furthermore, the spatial locality of the computed one-electron RDM reveals that the quantum computer accurately predicts the Mott metal-insulator transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1982

Development of advanced acreage estimation methods

The development of an accurate and efficient algorithm for analyzing the structure of MSS data, the application of the Akaiki information criterion to mixture models, and a research plan to delineate some of the technical issues and associated tasks in the area of rice scene radiation characterization are discussed. The AMOEBA clustering algorithm is refined and documented.

Guseman, L. F., Jr.↗
NASA NTRS2016

Automated Segmentation and Classification of Coral using Fluid Lensing from Unmanned Airborne Platforms

In recent years, there has been a growing interest among biologists in monitoring the short and long term health of the world's coral reefs. The environmental impact of climate change poses a growing threat to these biologically diverse and fragile ecosystems, prompting scientists to use remote sensing platforms and computer vision algorithms to analyze shallow marine systems. In this study, we present a novel method for performing coral segmentation and classification from aerial data collected from small unmanned aerial vehicles (sUAV). Our method uses Fluid Lensing algorithms to remove and exploit strong optical distortions created along the air-fluid boundary to produce cm-scale resolution imagery of the ocean floor at depths up to 5 meters. A 3D model of the reef is reconstructed using structure from motion (SFM) algorithms, and the associated depth information is combined with multidimensional maximum a posteriori (MAP) estimation to separate organic from inorganic material and classify coral morphologies in the Fluid-Lensed transects. In this study, MAP estimation is performed using a set of manually classified 100 x 100 pixel training images to determine the most probable coral classification within an interrogated region of interest. Aerial footage of a coral reef was captured off the coast of American Samoa and used to test our proposed method. 90 x 20 meter transects of the Samoan coastline undergo automated classification and are manually segmented by a marine biologist for comparison, leading to success rates as high as 85%. This method has broad applications for coastal remote sensing, and will provide marine biologists access to large swaths of high resolution, segmented coral imagery.

algorithms segments classifications↗
NASA NTRS2015

Automated Segmentation and Classification of Coral Using Fluid Lensing from Unmanned Airborne Platforms

In recent years, there has been a growing interest among biologists in monitoring the short and long term health of the worlds coral reefs. The environmental impact of climate change poses a growing threat to these biologically diverse and fragile ecosystems, prompting scientists to use remote sensing platforms and computer vision algorithms to analyze shallow marine systems. In this study, we present a novel method for performing coral segmentation and classification from aerial data collected from small unmanned aerial vehicles (sUAV). Our method uses Fluid Lensing algorithms to remove and exploit strong optical distortions created along the air-fluid boundary to produce cm-scale resolution imagery of the ocean floor at depths up to 5 meters. A 3D model of the reef is reconstructed using structure from motion (SFM) algorithms, and the associated depth information is combined with multidimensional maximum a posteriori (MAP) estimation to separate organic from inorganic material and classify coral morphologies in the Fluid-Lensed transects. In this study, MAP estimation is performed using a set of manually classified 100 x 100 pixel training images to determine the most probable coral classification within an interrogated region of interest. Aerial footage of a coral reef was captured off the coast of American Samoa and used to test our proposed method. 90 x 20 meter transects of the Samoan coastline undergo automated classification and are manually segmented by a marine biologist for comparison, leading to success rates as high as 85. This method has broad applications for coastal remote sensing, and will provide marine biologists access to large swaths of high resolution, segmented coral imagery.

algorithms segments classifications↗
NASA NTRS1978

A critical evaluation of the minimization techniques as applied to nonlinear structural analyses

This paper identifies the potential for unconstrained minimization algorithms of mathematical programming to be cost-effective with other conventional techniques of transient nonlinear structural analysis. With this in mind the authors have attempted to critically evaluate a few of the most commonly used algorithms for their effectiveness in solving structural problems involving geometric and material nonlinearities. The algorithms have been categorized as being zeroth order, first order and second order depending upon the order of the derivative of the function called for by the algorithm. The sensitivity of these algorithms to the accuracy of derivatives derived on the basis of finite difference operations clearly suggest using analytically derived derivatives to obtain better control on the number of minimizations required for convergence to the exact solution.

Kamat, M. P.↗
NASA NTRS1994

Active Narrow-Band Vibration Isolation of Large Engineering Structures

We present a narrow-band tracking control method using a variant of the Least Mean Squares (LMS) algorithm to isolate slowly changing periodic disturbances from engineering structures. The advantage of the algorithm is that it has a simple architecture and is relatively easy to implement while it can isolate disturbances on the order of 40-50 dB over decades of frequency band. We also present the results of an experiment conducted on a flexible truss structure. The average disturbance rejection achieved is over 40 dB over the frequency band of 5 Hz to 50 Hz.

algorithm engineering structures noise vibration↗