Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 289 records · Page 16

Monte Carlo simulation of a biological object with optical coherent tomography structural images using a voxel-based geometry of a medium

We describe a Monte Carlo algorithm for simulating an interference signal and constructing a structural image of a biological object using optical coherent tomography (OCT). The algorithm is specific in that the object geometry is described by using a three-dimensional array of voxels combined into parallelograms, and the border cross checking is carried out by using an improved Smith algorithm. The geometry of the simulated object is reconstructed based on the structure of real biological tissues obtained by OCT. The algorithm efficiency is estimated by comparing experimental and corresponding simulated images of a subcutaneous blood vessel and upper layer of human skin in vivo . (biophotonics)

60 APPLIED LIFE SCIENCES↗

Assessing decision boundaries under uncertainty

In order to make design decisions, engineers may seek to identify regions of the design domain that are acceptable in a computationally efficient manner. A design is typically considered acceptable if its reliability with respect to parametric uncertainty exceeds the designer’s desired level of confidence. Despite major advancements in reliability estimation and in design classification via decision boundary estimation, the current literature still lacks a design classification strategy that incorporates parametric uncertainty and desired design confidence. To address this gap, this paper offers a novel interpretation of the acceptance region by defining the decision boundary as the hypersurface which isolates the designs that exceed a user-defined level of confidence given parametric uncertainty. This work addresses the construction of this novel decision boundary using computationally efficient algorithms that were developed for reliability analysis and decision boundary estimation. The approach proposed in this paper is verified on two physical examples from structural and thermal analysis using Support Vector Machines and Efficient Global Optimization-based contour estimation.

97 MATHEMATICS AND COMPUTING↗

A variational eigenvalue solver on a photonic quantum processor

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansa¨tze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H þ . The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exercises in high-dimensional sampling: maximal poisson-disk sampling and k -d darts

In this paper, we review our recent progress on efficient algorithms for generating well-spaced samples of high dimensional data, and for exploring and characterizing these data, the underlying domain, and functions over the domain. To our knowledge, these techniques have not yet been applied to computational topology, but the possible connections are worth considering. In particular, computational topology problems often have difficulty in scaling efficiently, and these sampling techniques have the potential to drastically reduce the size of the data over which these computational topology algorithms must operate. Lastly, we summarize the definition of these sample distributions; algorithms for generating them in low, moderate, and high dimensions; and applications in mesh generation, rendering, motion planning and simulation.

97 MATHEMATICS AND COMPUTING↗

Parallel processing environment for multi-flexible body dynamics

The implementation of a dynamics solution algorithm with inherent parallelism which is applicable to the dynamics of large flexible space structures is described. The algorithm is unique in that parts of the solution can be computed simultaneously by working with different branches of its tree topology. The algorithm exhibits close to 0(n) type behavior. The data flow within the solution algorithm is discussed along with results from its implementation in a multiprocessing environment. A model of the United States Space Station is used as an example. The results show that, with fast multiple scalar processors, an efficient algorithm, and symbolically generated equations of motion, real-time performance can be achieved with present-day hardware technology, even with complex dynamical models.

Venugopal, Ravi↗

Experiments on Supervised Learning Algorithms for Text Categorization

Modern information society is facing the challenge of handling massive volume of online documents, news, intelligence reports, and so on. How to use the information accurately and in a timely manner becomes a major concern in many areas. While the general information may also include images and voice, we focus on the categorization of text data in this paper. We provide a brief overview of the information processing flow for text categorization, and discuss two supervised learning algorithms, viz., support vector machines (SVM) and partial least squares (PLS), which have been successfully applied in other domains, e.g., fault diagnosis [9]. While SVM has been well explored for binary classification and was reported as an efficient algorithm for text categorization, PLS has not yet been applied to text categorization. Our experiments are conducted on three data sets: Reuter's- 21578 dataset about corporate mergers and data acquisitions (ACQ), WebKB and the 20-Newsgroups. Results show that the performance of PLS is comparable to SVM in text categorization. A major drawback of SVM for multi-class categorization is that it requires a voting scheme based on the results of pair-wise classification. PLS does not have this drawback and could be a better candidate for multi-class text categorization.

Namburu, Setu Madhavi↗

Fast algorithms for visualizing fluid motion in steady flow on unstructured grids

The plotting of streamlines is an effective way of visualizing fluid motion in steady flows. Additional information about the flowfield, such as local rotation and expansion, can be shown by drawing in the form of a ribbon or tube. In this paper, we present efficient algorithms for the construction of streamlines, streamribbons and streamtubes on unstructured grids. A specialized version of the Runge-Kutta method has been developed to speed up the integration of particle paths. We have also derived closed-form solutions for calculating angular rotation rate and radius to construct streamribbons and streamtubes, respectively. According to our analysis and test results, these formulations are two to four times better in performance than previous numerical methods. As a large number of traces are calculated, the improved performance could be significant.

Ueng, S. K.↗

The Feasibility of Incorporating a 3D Velocity Model Into Earthquake Location Around Salt Lake City, UT Using a Physics Informed Neural Network

Earthquake location algorithms typically require travel time calculation. Doing this calculation in 3D, despite advances in algorithm efficiency and computational power, can still be prohibitively expensive in terms of resources and storage. Implementation of high-resolution 3D models in routine earthquake location would be a significant step forward in most of the world. Machine learning algorithms have potential to act as substitutes for travel time calculation algorithms or stored travel time tables. We investigate EikoNet - a physics informed neural network machine learning model that estimates travel times very quickly and comes with negligible memory-overhead. Specifically, we apply EikoNet to the Wasatch Fault Community Velocity Model (WFCVM), a highly detailed and complex 3D velocity model of the Salt Lake City, UT region. While routine locations in the area and studies of the 2020 Magna, UT earthquake sequence used a 1D velocity model, a 3D model may help better our understanding the structure of the major fault in the region. Our primary goal was to test the speed, memory requirements, and accuracy of EikoNet compared to a reference eikonal solver. We find that while the EikoNet is exceedingly fast and requires little memory overhead, achieving acceptable accuracy in estimated travel times is difficult and requires extensive computational resources.

58 GEOSCIENCES↗

Arithmetic in large GF(2(exp n))

The decoding of Reed Solomon (BCH) codes usually requires large numbers of calculations using GF(2(exp n)) arithmetic. Though efficient algorithms and corresponding circuits for performing basic Galois field arithmetic are known, many of these techniques either become very slow or else require an inordinate amount of circuitry to implement when the size of the Galois field becomes much larger than GF(2(exp 8)). Consequently, most currently available Reed-Solomon decoders are built using small fields, such as GF(2(exp 8)) or GF(2(exp 10)), even though significant coding efficiencies could often be obtained if larger symbol sizes, such as GF(2(exp 16)) or GF(2(exp 32)), were used. Algorithms for performing the basic arithmetic required to decode Reed-Solomon codes have been developed explicitly for use in these large fields. They are discussed in detail.

Cameron, Kelly↗

A Multireference Quantum Krylov Algorithm for Strongly Correlated Electrons

We introduce a multireference selected quantum Krylov (MRSQK) algorithm suitable for quantum simulation of many-body problems. MRSQK is a low-cost alternative to the quantum phase estimation algorithm that generates a target state as a linear combination of non-orthogonal Krylov basis states. This basis is constructed from a set of reference states via real-time evolution; thus, avoiding the numerical optimization of parameters. An efficient algorithm for the evaluation of the off-diagonal matrix elements of the overlap and Hamiltonian matrices is discussed and a selection procedure is introduced to identify a basis of orthogonal references that ameliorates the linear dependency problem. Preliminary benchmarks on linear H 6 , H 8 , and BeH 2 indicate that MRSQK can predict the energy of these systems accurately using very compact Krylov bases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Kinetic Simulation of Collisional Magnetized Plasmas with Semi-implicit Time Integration

Plasmas with varying collisionalities occur in many applications, such as tokamak edge regions, where the flows are characterized by significant variations in density and temperature. While a kinetic model is necessary for weakly-collisional high-temperature plasmas, high collisionality in colder regions render the equations numerically stiff due to disparate time scales. In this study, we propose an implicit–explicit algorithm for such cases, where the collisional term is integrated implicitly in time, while the advective term is integrated explicitly in time, thus allowing time step sizes that are comparable to the advective time scales. This partitioning results in a more efficient algorithm than those using explicit time integrators, where the time step sizes are constrained by the stiff collisional time scales. Finally, we implement semi-implicit additive Runge–Kutta methods in COGENT, a high-order finite-volume gyrokinetic code and test the accuracy, convergence, and computational cost of these semi-implicit methods for test cases with highly-collisional plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computational strategies for three-dimensional flow simulations on distributed computer systems

An increasing amount of research activity in computational fluid dynamics has been devoted to the development of efficient algorithms for parallel computing systems. The increasing performance to price ratio of engineering workstations has led to research to development procedures for implementing a parallel computing system composed of distributed workstations. This thesis proposal outlines an ongoing research program to develop efficient strategies for performing three-dimensional flow analysis on distributed computing systems. The PVM parallel programming interface was used to modify an existing three-dimensional flow solver, the TEAM code developed by Lockheed for the Air Force, to function as a parallel flow solver on clusters of workstations. Steady flow solutions were generated for three different wing and body geometries to validate the code and evaluate code performance. The proposed research will extend the parallel code development to determine the most efficient strategies for unsteady flow simulations.

Weed, Richard Allen↗

Evolving HPC and Application Design Toward a Coupled Data Assimilation System at NASA Suitable for Emerging Exascale Platforms

The prediction capabilities of global models have continuously evolved from the traditional medium-range global weather prediction application to span scales in support of hourly prediction of convective scale storms to seasonal Earth system prediction. This evolution has increased the demands on the system infrastructure design and workflow to achieve the required performance on modern high-performance computing (HPC) platforms. The planned evolution of the Goddard Earth Observing System (GEOS) modeling and assimilation system will stress the capabilities of conventional HPC overwhelming the available compute cycles at the NASA Center for Climate Simulation (NCCS) at the NASA Goddard Space Flight Center in the coming 5-10 years. This has led to the re-design of key elements of the assimilation and modeling systems to achieve significant gains in performance on anticipated Exacale platforms. The transition of the assimilation system to the Joint Effort for Data assimilation Integration (JEDI) framework has positioned GEOS to exploit new efficient algorithms for data assimilation (DA) in a fully-coupled Earth system context. The suitability of the GEOS model to leverage a domain specific language (DSL) approach and artificial intelligence (AI) is being explored to accelerate computational performance and data exchange efficiency of the coupled Earth system model. The storage and processing of large data volumes produced by these advance systems is being redesigned with a data-centric cloud-based approach. We will highlight the recent efforts in these areas and emphasize the demand for further development and re-design to achieve the science objectives in support of NASA's Earth system modeling and assimilation missions.

Putman, Bill↗

Nonadiabatic dynamics with intersystem crossings: A time-dependent density functional theory implementation

In this work, we derive a method to perform trajectory-based nonadiabatic dynamics that is able to describe both nonadiabatic transitions and intersystem crossing events (transitions between states of different spin-multiplicity) at the same level of theory, namely, time-dependent density functional theory (TDDFT). To this end, we combined our previously developed TDDFT-based trajectory surface hopping scheme with an accurate and efficient algorithm for the calculation of the spin-orbit coupling (SOC) matrix elements. More specifically, we designed two algorithms for the calculation of intersystem crossing transitions, one based on an extended Tully’s surface hopping scheme including SOC and the second based on a Landau-Zener approximation applied to the spin sector of the electronic Hilbert space. This development allows for the design of an efficient on-the-fly nonadiabatic approach that can handle, on an equal footing, nonadiabatic and intersystem crossing transitions. The method is applied to the study of the photophysics of sulfur dioxide (SO{sub 2}) in gas and liquid phases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Simulation studies of time-control procedures for the advanced air traffic control system

The problem of mixing aircraft equipped with time-controlled guidance systems and unequipped aircraft in the terminal area has been investigated via a real-time air traffic control simulation. These four-dimensional (4D) guidance systems can predict and control the touchdown time of an aircraft to an accuracy of a few seconds throughout the descent. The objectives of this investigation were to (1) develop scheduling algorithms and operational procedures for various traffic mixes that ranged from 25% to 75% 4D-equipped aircraft; (2) examine the effect of time errors at 120 n. mi. from touchdown on touchdown time scheduling of the various mix conditions; and (3) develop efficient algorithms and procedures to null the initial time errors prior to reaching the final control sector, 30 n. mi. from touchdown. Results indicate substantial reduction in controller workload and an increase in orderliness when more than 25% of the aircraft are equipped with 4D guidance systems; initial random errors of up to + or - 2 min can be handled via a single speed advisory issued in the arrival control sector, thus avoiding disruption of the time schedule.

Tobias, L.↗

Enriched immersed finite element and isogeometric analysis: algorithms and data structures

Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their implementation remains a major challenge due to, among other things, the need to apply nontrivial stabilization schemes and generate custom quadrature rules. This article introduces the robust and computationally efficient algorithms and data structures comprising an immersed finite element preprocessing framework. The input to the preprocessor consists of a background mesh and one or more geometries defined on its domain. The output is structured into groups of elements with custom quadrature rules formatted such that common finite element assembly routines may be used without or with only minimal modifications. The key to the preprocessing framework is the construction of material topology information, concurrently with the generation of a quadrature rule, which is then used to perform enrichment and generate stabilization rules. While the algorithmic framework applies to a wide range of immersed finite element methods using different types of meshes, integration, and stabilization schemes, the preprocessor is presented within the context of the extended isogeometric analysis. This method utilizes a structured B-spline mesh, a generalized Heaviside enrichment strategy considering the material layout within individual basis functions’ supports, and face-oriented ghost stabilization. Using a set of examples, the effectiveness of the enrichment and stabilization strategies is demonstrated alongside the preprocessor’s robustness in geometric edge cases. Additionally, the performance and parallel scalability of the implementation are evaluated.

Computer implementation↗

An algorithm for obtaining the minimal realization of a linear time-invariant system and determining if a system is stabilizable-detectable

A definition of centralized fixed modes of a system, which is an adoption of the definition of fixed modes for a decentralized system is made. It is shown that the centralized fixed modes of a system can be easily and efficiently calculated in terms of the eigenvalues of the system, and that the calculation of such fixed modes enables one to determine, in a numerically efficient way, whether a system is controllable, observable, stabilizable, or detectable. An efficient algorithm for reducing a system to minimal realization form is then given. The algorithms have been effectively used on systems of order up to 100.

Davison, E. J.↗

Particle track classification using quantum associative memory

Pattern recognition algorithms are commonly employed to simplify the challenging and necessary step of track reconstruction in sub-atomic physics experiments. Aiding in the discrimination of relevant interactions, pattern recognition seeks to accelerate track reconstruction by isolating signals of interest. In high collision rate experiments, such algorithms can be particularly crucial for determining whether to retain or discard information from a given interaction even before the data is transferred to tape. As data rates, detector resolution, noise, and inefficiencies increase, pattern recognition becomes more computationally challenging, motivating the development of higher efficiency algorithms and techniques. Quantum associative memory is an approach that seeks to exploits quantum mechanical phenomena to gain advantage in learning capacity, or the number of patterns that can be stored and accurately recalled. Here, we study quantum associative memory based on quantum annealing and apply it to the particle track classification. We focus on discrimination models based on Ising formulations of quantum associative memory model (QAMM) recall and quantum content-addressable memory (QCAM) recall. We characterize classification performance of these approaches as a function detector resolution, pattern library size, and detector inefficiencies, using the D-Wave 2000Q processor as a testbed. Discrimination criteria is set using both solution-state energy and classification labels embedded in solution states. We find that energy-based QAMM classification performs well in regimes of small pattern density and low detector inefficiency. In contrast, state-based QCAM achieves reasonably high accuracy recall for large pattern density and the greatest recall accuracy robustness to a variety of detector noise sources.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗