Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Complexity”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A parallel hierarchical blocked adaptive cross approximation algorithm

This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The proposed algorithm first computes rank-revealing decompositions of submatrices with a blocked adaptive cross approximation (BACA) algorithm, and then applies a hierarchical merge operation via truncated singular value decompositions (H-BACA). The proposed algorithm significantly improves the convergence of the baseline ACA algorithm and achieves reduced computational complexity compared to the traditional decompositions such as rank-revealing QR. Numerical results demonstrate the efficiency, accuracy, and parallel scalability of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Reduction of the molecular hamiltonian matrix using quantum community detection

Abstract Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1993

Design and control of a macro-micro robot for precise force applications

Creating a robot which can delicately interact with its environment has been the goal of much research. Primarily two difficulties have made this goal hard to attain. The execution of control strategies which enable precise force manipulations are difficult to implement in real time because such algorithms have been too computationally complex for available controllers. Also, a robot mechanism which can quickly and precisely execute a force command is difficult to design. Actuation joints must be sufficiently stiff, frictionless, and lightweight so that desired torques can be accurately applied. This paper describes a robotic system which is capable of delicate manipulations. A modular high-performance multiprocessor control system was designed to provide sufficient compute power for executing advanced control methods. An 8 degree of freedom macro-micro mechanism was constructed to enable accurate tip forces. Control algorithms based on the impedance control method were derived, coded, and load balanced for maximum execution speed on the multiprocessor system. Delicate force tasks such as polishing, finishing, cleaning, and deburring, are the target applications of the robot.

Wang, Yulun↗
DOE OSTI2021

Algebraic Algorithms for Betweenness and Percolation Centrality

Abstract In this paper, we explored different ways to write the algebraic version of betweenness centrality algorithm. Particularly, we focused on Brandes' algorithm. We aimed for algebraic betweenness centrality that can be parallelized easily. We proposed 3-tuple geodetic semiring as an extension to the usual geodetic semiring with 2-tuples. Using the 3-tuple geodetic semiring, Dijkstra's and Brandes' algorithm, we wrote more concise and general algebraic betweenness centrality (ABC) algorithm which is valid for weighted and directed graphs. We also proposed an alternative version of ABC using the usual geodetic semiring with 2-tuple where we used a simple way to construct shortest path tree after computing shortest path distances in the usual geodetic semiring. This allows us to avoid computational complexity of ABC implementation using 3-tuple geodetic semiring. We used numba to optimize and parallelize ABC. We evaluated the performance of ABC using 2-tuple geodetic semiring as compared to NetworkX, a common python package for graph algorithms. We did scalability experiments on parallel ABC and showed its total speedup. We also showed that with small modification, ABC can be adapted to algebraicly compute other centrality measures such as percolation centrality.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Deep Learning Emulation of Atmospheric Correction for Geostationary Sensors

New generation geostationary satellites make reflectance observations available at a continental scale with unprecedented spatiotemporal resolution and spectral range. Generating Earth monitoring products from these observations requires retrieval of the basic parameter, surface reflectance (SR), by atmospheric correction (AC). Algorithms for atmospheric correction, including Multi-Angle Implementation of Atmospheric Correction (MAIAC), are adapted for each sensor and are too computationally complex to be run in real time, relying instead on look-up tables with precomputed values. Machine learning methods, including convolutional neural networks, have demonstrated performance in learning complex, nonlinear mappings and extracting insight from high-dimensional remote sensing data. In this work, we present a deep learning emulator of MAIAC to retrieve both SR and cloud products. Using this adaptation of deep learning-based emulation to remote sensing, we demonstrate stable SR retrieval over a variety of land covers and viewing conditions and accurate cloud detection. Further, a comparison of computation time suggests emulation as a compelling alternative for expensive physical simulation, especially for applications benefited by near-real time data, such as agricultural management and disaster response.

Duffy, Kate↗
DOE OSTI2023

Logical quantum processor based on reconfigurable atom arrays

Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction (QEC) for large-scale processing. However, the overhead in the realization of error-corrected ‘logical’ qubits, in which information is encoded across many physical qubits for redundancy, poses substantial challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Using logical-level control and a zoned architecture in reconfigurable neutral-atom arrays, our system combines high two-qubit gate fidelities, arbitrary connectivity, as well as fully programmable single-qubit rotations and mid-circuit readout. Operating this logical processor with various types of encoding, we demonstrate improvement of a two-qubit logic gate by scaling surface-code distance from d = 3 to d = 7, preparation of colour-code qubits with break-even fidelities, fault-tolerant creation of logical Greenberger–Horne–Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colour-code qubits. Finally, using 3D [[8,3,2]] code blocks, we realize computationally complex sampling circuits with up to 48 logical qubits entangled with hypercube connectivity with 228 logical two-qubit gates and 48 logical CCZ gates. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling. These results herald the advent of early error-corrected quantum computation and chart a path towards large-scale logical processors.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS1986

Efficient numerical techniques for complex fluid flows

The central feature in any flow prediction method is the treatment of the coupling between the momentum and continuity equations. In natural-convection flows, the energy equation also becomes strongly coupled with the momentum equations. Because of the nonlinear nature of the coupling, these equations are solved iteratively. Iterative methods are often prone to slow convergence, divergence, and extreme sensitivity to underrelaxation factors. The aim of the present research is to develop more efficient and reliable solution schemes for the coupled flow equations. Such schemes will significantly reduce the expense of computing complex flows encountered in combustion chambers, gas turbines, heat exchangers, and other practical equipment. In the work completed so far, a technique employing norm reduction in conjunction with the successive-substitution and Newton-Raphson techniques was developed. Also, a block-correction procedure for the flow equations is currently being formulated and tested.

Patankar, Suhas V.↗
DOE OSTI2016

Prime factorization using magnonic holographic devices

Determining the prime factors of a given number $N$ is a problem that requires super-polynomial time for conventional digital computers. A polynomial-time algorithm was invented by Shor for quantum computers. In this paper, we present experimental data that demonstrate prime factorization using spin-wave interference but without quantum entanglement. Prime factorization includes three major steps. First, a general-type computer calculates the sequence of numbers m k mod($N$), where $N$ is the number to be factorized, m is a randomly chosen positive integer, and k = 1, 2, 3, 4, 5, 6…. Next, the period of the calculated sequence $r$ is determined by exploiting spin-wave interference. Finally, the general-type computer determines the primes based on the obtained $r$. The experiment for period finding was conducted on a six-terminal Y 3 Fe 2 (FeO 4 ) 3 device. We chose number 15 for testing and determined its primes using a sequence of measurements. The obtained experimental data for a micrometer-sized prototype aimed to demonstrate the benefits of using spin-wave devices to solve complex computational problems. Scalability is one of the major strengths inherent in this type of wave-based device, which may provide a route to nanometer-sized logic circuits. We discuss the physical and technological limitations of this approach, which define the maximum size of N and the computational speed. Although this classical approach cannot compete with the quantum algorithm in terms of efficiency, magnonic holographic devices can potentially be used as complementary logic units aimed at speeding up prime factorization for classical computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Adaptive Generation of Training Data for ML Reduced Model Creation

Machine learning proxy models are often used to speed up or completely replace complex computational models. The greatly reduced and deterministic computational costs enable new use cases such as digital twin control systems and global optimization. The challenge of building these proxy models is generating the training data. A naive uniform sampling of the input space can result in a non-uniform sampling of the output space of a model. This can cause gaps in the training data coverage that can miss finer scale details resulting in poor accuracy. While larger and larger data sets could eventually fill in these gaps, the computational burden of full-scale simulation codes can make this prohibitive. In this paper, we present an adaptive data generation method that utilizes uncertainty estimation to identify regions where training data should be augmented. By targeting data generation to areas of need, representative data sets can be generated efficiently. The effectiveness of this method will be demonstrated on a simple one-dimensional function and a complex multidimensional physics model.

Cianciosa, Mark↗
DOE OSTI2022

A Tanks-in-Series Approach to Estimate Parameters for Lithium-Ion Battery Models

Advanced Battery Management Systems (BMS) play a vital role in monitoring, predicting, and controlling the performance of lithium-ion batteries. BMS employing sophisticated electrochemical models can help increase battery cycle life and minimize charging time. However, in order to realize the full potential of electrochemical model-based BMS, it is critical to ensure accurate predictions and proper model parameterization. The accuracy of the predictions of an electrochemical model is dependent on the accuracy of its parameters, the values of which might change with battery cycling and aging. Parameter estimation for an electrochemical model is generally challenging due to the nonlinear nature and computational complexity of the model equations. To this end, this work utilizes the recently proposed Tanks-in-Series model for Li-ion batteries (J.Electrochem. Soc., 167, 013534 (2020)) to perform parameter estimation. The Tanks-in-Series approach allows for substantially faster parameter estimation compared to the original pseudo two-dimensional (p2D) model. The objective of this work is thus to demonstrate the gain in computational efficiency from the Tanks-in-Series approach. A sensitivity analysis of model parameters is also performed to benchmark the fidelity of the Tanks-in-Series model.

25 ENERGY STORAGE↗
DOE OSTI2019

An Eigenvector-Based Method of Radio Array Calibration and Its Application to the Tianlai Cylinder Pathfinder

We propose an eigenvector-based formalism for the calibration of radio interferometer arrays. In the presence of a strong dominant point source, the complex gains of the array can be obtained by taking the first eigenvector of the visibility matrix. We use the stable principle component analysis method to help separate outliers and noise from the calibrator signal to improve the performance of the method. This method can be applied with poorly known beam model of the antenna, is insensitive to outliers or imperfections in the data, and has low computational complexity. It thus is particularly suitable for the initial calibration of the array, which can serve as the initial point for more accurate calibrations. We demonstrate this method by applying it to the cylinder pathfinder of the Tianlai experiment, which aims to measure the dark energy equation of state using the baryon acoustic oscillation features in the large-scale structure by making intensity mapping observation of the redshifted 21 cm emission of the neutral hydrogen (H i). The complex gain of the array elements and the beam profile in the east–west direction (short axis of the cylinder) are successfully obtained by applying this method to the transit data of bright radio sources.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1990

Visualization of fluid dynamics at NASA Ames

Some of the hardware and software tools and techniques in use at NASA's numerical aerodynamic simulation facility for the analysis of computational fluid dynamics are described. The visualization process can be illustrated by video tapes and stereo pictures. Although these visualization tools have dramatically improved the ability to conduct research in fluid dynamics, a comparison of the current environment for analysis with an 'ideal' environment illustrates that there are still major improvements that should be made. The most time-consuming task in future analyses of the increasingly complex computer simulations will be the extraction and clear display of the key features. In addition, the interface between the workstation and the scientist should be improved significantly. Current research on techniques for creating these improvements is described.

Watson, V.↗
DOE OSTI2017

Bayesian K-SVD Using Fast Variational Inference

Recent work in signal processing in general and image processing in particular deals with sparse representation related problems. Two such problems are of paramount importance: an overriding need for designing a well-suited overcomplete dictionary containing a redundant set of atoms— i.e., basis signals—and how to find a sparse representation of a given signal with respect to the chosen dictionary. Dictionary learning techniques, among which we find the popular K-singular value decomposition algorithm, tackle these problems by adapting a dictionary to a set of training data. A common drawback of such techniques is the need for parameter-tuning. In order to overcome this limitation, we propose a fullyautomated Bayesian method that considers the uncertainty of the estimates and produces a sparse representation of the data without prior information on the number of non-zeros in each representation vector. We follow a Bayesian approach that uses a three-tiered hierarchical prior to enforce sparsity on the representations and develop an efficient variational inference framework that reduces computational complexity. Furthermore, we describe a greedy approach that speeds up the whole process. Lastly, we present experimental results that show superior performance on two different applications with real images: denoising and inpainting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Zonal wavefront reconstruction in quadrilateral geometry for phase measuring deflectometry

There are wide applications for zonal reconstruction methods in slope-based metrology due to its good capability of reconstructing the local details on surface profile. It was noticed in the literature that large reconstruction errors occur when using zonal reconstruction methods designed for rectangular geometry to process slopes in a quadrilateral geometry, which is a more general geometry with phase measuring deflectometry. In this paper, we present a new idea for the zonal methods for quadrilateral geometry. Instead of employing the intermediate slopes to set up height-slope equations, we consider the height increment as a more general connector to establish the height-slope relations for least-squares regression. The classical zonal methods and interpolation-assisted zonal methods are compared with our proposal. Results of both simulation and experiment demonstrate the effectiveness of the proposed idea. In implementation, the modification on the classical zonal methods is addressed. Finally, the new methods preserve many good aspects of the classical ones, such as the ability to handle a large incomplete slope dataset in an arbitrary aperture, and the low computational complexity comparable with the classical zonal method. Of course, the accuracy of the new methods is much higher when integrating the slopes in quadrilateral geometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Compressing branch-and-bound trees

A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB tree T that certifies a dual bound, can we obtain a smaller tree with the same (or stronger) bound by either (1) applying a different disjunction at some node in T or (2) removing leaves from T? Here we believe such post-hoc analysis of BB trees may assist in identifying helpful general disjunctions in BB algorithms. We initiate our study by considering computational complexity and limitations of TCP. We then conduct experiments to evaluate the compressibility of realistic branch-and-bound trees generated by commonly-used branching strategies, using both an exact and a heuristic compression algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Quantum Computational Advantage with String Order Parameters of One-Dimensional Symmetry-Protected Topological Order

Nonlocal games with advantageous quantum strategies give arguably the most fundamental demonstration of the power of quantum resources over their classical counterparts. Recently, certain multiplayer generalizations of nonlocal games have been used to prove unconditional separations between limited computational complexity classes of shallow-depth circuits. Here, we show advantageous strategies for these nonlocal games for generic ground states of one-dimensional symmetry-protected topological orders (SPTOs), when a discrete invariant of a SPTO known as a twist phase is nontrivial and -1. Finally, our construction demonstrates that sufficiently large string order parameters of such SPTOs are indicative of globally constrained correlations useful for the unconditional computational separation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

An Eigenvector-based Method of Radio Array Calibration and Its Application to the Tianlai Cylinder Pathfinder

We propose an eigenvector-based formalism for the calibration of radio interferometer arrays. In the presence of a strong dominant point source, the complex gains of the array can be obtained by taking the first eigenvector of the visibility matrix. We use the stable principle component analysis (SPCA) method to help separate outliers and noise from the calibrator signal to improve the performance of the method. This method can be applied with poorly known beam model of the antenna, and is insensitive to outliers or imperfections in the data, and has low computational complexity. It thus is particularly suitable for the initial calibration of the array, which can serve as the initial point for more accurate calibrations. We demonstrate this method by applying it to the cylinder pathfinder of the Tianlai experiment, which aims to measure the dark energy equation of state using the baryon acoustic oscillation (BAO) features in the large scale structure by making intensity mapping observation of the redshifted 21~cm emission of the neutral hydrogen (HI). The complex gain of the array elements and the beam profile in the East-West direction (short axis of the cylinder) are successfully obtained by applying this method to the transit data of bright radio sources.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗