Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex computing”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Numerical computation of complex multi-body Navier-Stokes flows with applications for the integrated Space Shuttle launch vehicle

An enhanced grid system for the Space Shuttle Orbiter was built by integrating CAD definitions from several sources and then generating the surface and volume grids. The new grid system contains geometric components not modeled previously plus significant enhancements on geometry that has been modeled in the old grid system. The new orbiter grids were then integrated with new grids for the rest of the launch vehicle. Enhancements were made to the hyperbolic grid generator HYPGEN and new tools for grid projection, manipulation, and modification, Cartesian box grid and far field grid generation and post-processing of flow solver data were developed.

Chan, William M.↗
NASA NTRS2000

Atmospheric Flux Computations in Complex Terrain

The greatest challenges in applying atmospheric water budget expressions are in determining the divergence and evapotranspiration terms. The evapotranspiration problem is ubiquitous, and critical issues of spatial and temporal resolution commonly arise in establishing the divergence term. In complex terrain, further difficulties crop up in using typical data on atmospheric profiles of water vapor and wind to estimate the divergence term. Those difficulties are the subject of this paper; considerations related to topographic variations both along and normal to the flow direction are treated.

Smith, Paul L.↗
NASA NTRS1986

Queueing Network Models for Parallel Processing of Task Systems: an Operational Approach

Computer performance modeling of possibly complex computations running on highly concurrent systems is considered. Earlier works in this area either dealt with a very simple program structure or resulted in methods with exponential complexity. An efficient procedure is developed to compute the performance measures for series-parallel-reducible task systems using queueing network models. The procedure is based on the concept of hierarchical decomposition and a new operational approach. Numerical results for three test cases are presented and compared to those of simulations.

Mak, Victor W. K.↗
DOE OSTI2023

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1970

Automated validation of a computer operating system

Programs apply selected input/output loads to complex computer operating system and measure performance of that system under such loads. Technique lends itself to checkout of computer software designed to monitor automated complex industrial systems.

Dervage, M. M.↗
DOE OSTI2023

A Conceptual Architecture for a Quantum-HPC Middleware

Abstract-Quantum computing promises potential for science and industry by solving certain computationally complex problems faster than classical computers. Quantum computing systems evolved from coupled to classical computing nodes (HPC). With the increasing monolithic systems towards modular architectures comprising multiple quantum processing units (QPUs) scale, middleware systems that facilitate the efficient coupling of quantum-classical computing are becoming critical. Through an in-depth analysis of quantum applications, integration patterns and systems, we identified a gap in understanding Quantum HPC middleware systems. We present a conceptual middleware to facilitate reasoning about quantum-classical integration and serve as the basis for a future middleware system. An essential contribution of this paper lies in leveraging well-established high performance computing abstractions for managing workloads, tasks, and resources to integrate quantum computing into HPC systems seamlessly

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1971

Skylab RTCC mass properties system requirements

The computation equations and flow charts are presented for the Real Time Computer Complex mass properties system for computing and maintaining weight and centers of gravity for the CSM and orbital assembly, and SPS engine trim angles.

Hischke, E. R.↗
DOE OSTI2022

Simultaneous stoquasticity

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Furthermore, solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Complexity Phase Diagram for Interacting and Long-Range Bosonic Hamiltonians

Here, we classify phases of a bosonic lattice model based on the computational complexity of classically simulating the system. We show that the system transitions from being classically simulable to classically hard to simulate as it evolves in time, extending previous results to include on-site number-conserving interactions and long-range hopping. Specifically, we construct a complexity phase diagram with easy and hard “phases” and derive analytic bounds on the location of the phase boundary with respect to the evolution time and the degree of locality. We find that the location of the phase transition is intimately related to upper bounds on the spread of quantum correlations and protocols to transfer quantum information. Remarkably, although the location of the transition point is unchanged by on-site interactions, the nature of the transition point does change. Specifically, we find that there are two kinds of transitions, sharp and coarse, broadly corresponding to interacting and noninteracting bosons, respectively. Our Letter motivates future studies of complexity in many-body systems and its interplay with the associated physical phenomena.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2006

Less-Complex Method of Classifying MPSK

An alternative to an optimal method of automated classification of signals modulated with M-ary phase-shift-keying (M-ary PSK or MPSK) has been derived. The alternative method is approximate, but it offers nearly optimal performance and entails much less complexity, which translates to much less computation time. Modulation classification is becoming increasingly important in radio-communication systems that utilize multiple data modulation schemes and include software-defined or software-controlled receivers. Such a receiver may "know" little a priori about an incoming signal but may be required to correctly classify its data rate, modulation type, and forward error-correction code before properly configuring itself to acquire and track the symbol timing, carrier frequency, and phase, and ultimately produce decoded bits. Modulation classification has long been an important component of military interception of initially unknown radio signals transmitted by adversaries. Modulation classification may also be useful for enabling cellular telephones to automatically recognize different signal types and configure themselves accordingly. The concept of modulation classification as outlined in the preceding paragraph is quite general. However, at the present early stage of development, and for the purpose of describing the present alternative method, the term "modulation classification" or simply "classification" signifies, more specifically, a distinction between M-ary and M'-ary PSK, where M and M' represent two different integer multiples of 2. Both the prior optimal method and the present alternative method require the acquisition of magnitude and phase values of a number (N) of consecutive baseband samples of the incoming signal + noise. The prior optimal method is based on a maximum- likelihood (ML) classification rule that requires a calculation of likelihood functions for the M and M' hypotheses: Each likelihood function is an integral, over a full cycle of carrier phase, of a complicated sum of functions of the baseband sample values, the carrier phase, the carrier-signal and noise magnitudes, and M or M'. Then the likelihood ratio, defined as the ratio between the likelihood functions, is computed, leading to the choice of whichever hypothesis - M or M'- is more likely. In the alternative method, the integral in each likelihood function is approximated by a sum over values of the integrand sampled at a number, 1, of equally spaced values of carrier phase. Used in this way, 1 is a parameter that can be adjusted to trade computational complexity against the probability of misclassification. In the limit as 1 approaches infinity, one obtains the integral form of the likelihood function and thus recovers the ML classification. The present approximate method has been tested in comparison with the ML method by means of computational simulations. The results of the simulations have shown that the performance (as quantified by probability of misclassification) of the approximate method is nearly indistinguishable from that of the ML method (see figure).

Hamkins, Jon↗
DOE OSTI2024

On the hardness of learning ground state entanglement of geometrically local Hamiltonians

Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main result is that to show it is cryptographically hard to determine if the ground state of a geometrically local, polynomially gapped Hamiltonian on qudits (d=O(1)) has near-area law vs near-volume law entanglement. This improves prior work of Bouland et al. (arXiv:2311.12017) showing this for non-geometrically local Hamiltonians. In particular we show this problem is roughly factoring-hard in 1D, and LWE-hard in 2D. Our proof works by constructing a novel form of public-key pseudo-entanglement which is highly space-efficient, and combining this with a modification of Gottesman and Irani's quantum Turing machine to Hamiltonian construction. Our work suggests that the problem of learning so-called "gapless" quantum phases of matter might be intractable.

Computational Complexity (cs.CC)↗
NASA NTRS1982

Advances in information extraction techniques

Sundry recent developments are presented which show some potential for affecting the automatic extraction of information from remotely sensed data. Pattern representations more abstract than Euclidean vector spaces offer some hope of unifying structural and decision theoretical approaches. The estimation of expected classification error rates is becoming more sophisticated and rigorous, but useful finite-sample results for nonparametric distributions appear unobtainable. Focus on computational complexity allows comparison of algorithms, while software engineering techniques reduce the effort necessary to develop and maintain complex image processing systems. Advances in computer systems architecture, commercial database technology, and man-machine communications should be closely monitored by the remote sensing community. A NASA-sponsored recommendation for research directions in mathematical pattern recognition are offered.

Nagy, G.↗
DOE OSTI2021

Complexity and near extremal charged black branes

Highlights: • Trying to explore a remedy to overcome the puzzle in holographic complexity by assuming a cutoff behind the horizon and the corresponding boundary term. • Holographic complexity growth obtained by the WDW patch on shell action is insensitive to the UV cutoff at the late time. Therefore one may conclude that either on shell action does not compute complexity, or the late time is not given by the physical charges, or in our computations we have missed something! • We find that one needs to carefully compute on shell action taking into account the behind the horizon and the corresponding boundary term. Doing so, one arrives at a consistent picture. • We check this consistency by evaluating the late time complexity growth for near horizon limit of the near extremal black hole using two different methods. We would have obtained non-consistent picture, if we had not considered the behind the horizon cutoff as well as the corresponding boundary term. We compute holographic complexity of charged black brane solutions in arbitrary dimensions for the near horizon limit of near extremal case using two different methods. The corresponding complexity may be obtained either by taking the limit from the complexity of the charged black brane, or by computing the complexity for near horizon limit of near extremal solution. One observes that these results coincide if one assumes to have a cutoff behind horizon whose value is fixed by UV cutoff and also taking into account a proper counterterm evaluated on this cutoff. We also consider the situation for Vaidya charged black branes too.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Learning of networked spreading models from noisy and incomplete data

Recent years have seen a lot of progress in algorithms for learning parameters of spreading dynamics from both full and partial data. Some of the remaining challenges include model selection under the scenarios of unknown network structure, noisy data, missing observations in time, as well as an efficient incorporation of prior information to minimize the number of samples required for an accurate learning. Here, in this work, we introduce a universal learning method based on a scalable dynamic message-passing technique that addresses these challenges often encountered in real data. The algorithm leverages available prior knowledge on the model and on the data, and reconstructs both network structure and parameters of a spreading model. We show that a linear computational complexity of the method with the key model parameters makes the algorithm scalable to large network instances.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

One-shot omnidirectional pressure integration through matrix inversion

In this work, we present a method to perform 2D and 3D omnidirectional pressure integration from velocity measurements with a single-iteration matrix inversion approach. This work builds upon our previous work, where the rotating parallel ray approach was extended to the limit of infinite rays by taking continuous projection integrals of the ray paths and recasting the problem as an iterative matrix inversion problem. This iterative matrix equation is now 'fast-forwarded' to the 'infinity' iteration, leading to a different matrix equation that can be solved in a single step, thereby presenting the same computational complexity as the Poisson equation. We observe computational speedups of ~10 6 when compared to brute-force omnidirectional integration methods, enabling the treatment of grids of ~10 9 points and potentially even larger in a desktop setup at the time of publication. Further examination of the boundary conditions of our one-shot method shows that omnidirectional pressure integration implements a boundary condition where the boundary points are treated as interior points to the extent that information is available. Finally, we show how the method can be extended from the regular grids typical of particle image velocimetry to the unstructured meshes characteristic of particle tracking velocimetry data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

SPIKANs: separable physics-informed Kolmogorov–Arnold networks

Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) in scientific computing. While PINNs typically use multilayer perceptrons (MLPs) as their underlying architecture, recent advancements have explored alternative neural network structures. One such innovation is the Kolmogorov–Arnold Network (KAN), which has demonstrated benefits over traditional MLPs, including faster neural scaling and better interpretability. The application of KANs to physics-informed learning has led to the development of Physics-Informed KANs (PIKANs), enabling the use of KANs to solve PDEs. However, despite their advantages, KANs often suffer from slower training speeds, particularly in higher-dimensional problems where the number of collocation points grows exponentially with the dimensionality of the system. To address this challenge, we introduce Separable Physics-Informed Kolmogorov–Arnold Networks (SPIKANs). This novel architecture applies the principle of separation of variables to PIKANs, decomposing the problem such that each dimension is handled by an individual KAN. This approach drastically reduces the computational complexity of training without sacrificing accuracy, facilitating their application to higher-dimensional PDEs. Through a series of benchmark problems, we demonstrate the effectiveness of SPIKANs, showcasing their superior scalability and performance compared to PIKANs and highlighting their potential for solving complex, high-dimensional PDEs in scientific computing.

Kolmogorov-Arnold networks↗