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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

Shuttle mission simulator baseline definition report, volume 2

The baseline definition report for the space shuttle mission simulator is presented. The subjects discussed are: (1) the general configurations, (2) motion base crew station, (3) instructor operator station complex, (4) display devices, (5) electromagnetic compatibility, (6) external interface equipment, (7) data conversion equipment, (8) fixed base crew station equipment, and (9) computer complex. Block diagrams of the supporting subsystems are provided.

Dahlberg, A. W.↗
NASA NTRS1987

Navier-Stokes simulation of real gas flows in nozzles

Air flow in a hypersonic nozzle causes real gas effects due to reaction among the species constituting air. Such reactions may be in chemical equilibrium or in chemical nonequilibrium. Here using the CSCM upwind scheme for the compressible Navier-Stokes equations, the real gas flowfield in an arcjet nozzle is computed for both the equilibrium case and the nonequilibrium case. A hypersonic nozzle flow arising from a pebble bed heated plenum is also computed for the equilibrium situation. Between the equilibrium cases, the chemistry is treated by two different schemes and comments are made as to computational complexity. For the nonequilibrium case, a full set of seventeen reactions and full implicit coupling of five species with gasdynamics is employed to compute the flowfield. For all cases considered here the gas is assumed to be a calorically imperfect mixture of ideal gases in thermal equilibrium.

Nagaraj, N.↗
NASA NTRS1990

Constructing an advanced software tool for planetary atmospheric modeling

Scientific model building can be an intensive and painstaking process, often involving the development of large and complex computer programs. Despite the effort involved, scientific models cannot be easily distributed and shared with other scientists. In general, implemented scientific models are complex, idiosyncratic, and difficult for anyone but the original scientist/programmer to understand. We believe that advanced software techniques can facilitate both the model building and model sharing process. In this paper, we describe a prototype for a scientific modeling software tool that serves as an aid to the scientist in developing and using models. This tool includes an interactive intelligent graphical interface, a high level domain specific modeling language, a library of physics equations and experimental datasets, and a suite of data display facilities. Our prototype has been developed in the domain of planetary atmospheric modeling, and is being used to construct models of Titan's atmosphere.

Keller, Richard M.↗
NASA NTRS1990

Proposal for constructing an advanced software tool for planetary atmospheric modeling

Scientific model building can be a time intensive and painstaking process, often involving the development of large and complex computer programs. Despite the effort involved, scientific models cannot easily be distributed and shared with other scientists. In general, implemented scientific models are complex, idiosyncratic, and difficult for anyone but the original scientist/programmer to understand. We believe that advanced software techniques can facilitate both the model building and model sharing process. We propose to construct a scientific modeling software tool that serves as an aid to the scientist in developing and using models. The proposed tool will include an interactive intelligent graphical interface and a high level, domain specific, modeling language. As a testbed for this research, we propose development of a software prototype in the domain of planetary atmospheric modeling.

Keller, Richard M.↗
NASA NTRS1992

Artificial intelligence support for scientific model-building

Scientific model-building can be a time-intensive and painstaking process, often involving the development of large and complex computer programs. Despite the effort involved, scientific models cannot easily be distributed and shared with other scientists. In general, implemented scientific models are complex, idiosyncratic, and difficult for anyone but the original scientific development team to understand. We believe that artificial intelligence techniques can facilitate both the model-building and model-sharing process. In this paper, we overview our effort to build a scientific modeling software tool that aids the scientist in developing and using models. This tool includes an interactive intelligent graphical interface, a high-level domain specific modeling language, a library of physics equations and experimental datasets, and a suite of data display facilities.

Keller, Richard M.↗
DOE OSTI2019

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

DiaMonD is a multi-institutional DOE MMICC effort that aims to address the challenges of end-to-end, data-to-decisions modeling and simulation for complex computational science and engineering problems in a unified, systematic, and integrated fashion. Institutions involved are Colorado State, Florida State, Los Alamos, MIT, Oak Ridge, Stanford, and UT-Austin. The goals of DiaMonD are (1) to develop advanced mathematical methods and analysis for multimodel, multiphysics, multiscale model problems driven by frontier DOE applications, including those in subsurface energy and environmental flows, materials for energy storage and conversion, and ice sheet dynamics; (2) to create theory and algorithms for integrated inversion, optimization, and uncertainty quantification for these complex problems; and (3) to disseminate the philosophy of an integrated end-to-end, data-to-decisions approach to modeling and simulation of complex problems to the broader applied math and computational science communities through workshops and other outreach.

42 ENGINEERING↗
DOE OSTI2015

Foundational Principles for Large-Scale Inference: Illustrations Through Correlation Mining

When can reliable inference be drawn in the ‘‘Big Data’’ context? This article presents a framework for answering this fundamental question in the context of correlation mining, with implications for general large-scale inference. In large-scale data applications like genomics, connectomics, and eco-informatics, the data set is often variable rich but sample starved: a regime where the number n of acquired samples (statistical replicates) is far fewer than the number p of observed variables (genes, neurons, voxels, or chemical constituents). Much of recent work has focused on understanding the computational complexity of proposed methods for ‘‘Big Data.’’ Sample complexity, however, has received relatively less attention, especially in the setting when the sample size n is fixed, and the dimension p grows without bound. To address this gap, we develop a unified statistical framework that explicitly quantifies the sample complexity of various inferential tasks. Sampling regimes can be divided into several categories: 1) the classical asymptotic regime where the variable dimension is fixed and the sample size goes to infinity; 2) the mixed asymptotic regime where both variable dimension and sample size go to infinity at comparable rates; and 3) the purely high-dimensional asymptotic regime where the variable dimension goes to infinity and the sample size is fixed. Each regime has its niche but only the latter regime applies to exa-scale data dimension. We illustrate this high-dimensional framework for the problem of correlation mining, where it is the matrix of pairwise and partial correlations among the variables that are of interest. Correlation mining arises in numerous applications and subsumes the regression context as a special case. We demonstrate various regimes of correlation mining based on the unifying perspective of high-dimensional learning rates and sample complexity for different structured covariance models and different inference tasks.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2007

Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

Shaykhian, Gholam Ali↗
DOE OSTI2016

Random phase approximation with second-order screened exchange for current-carrying atomic states

The direct random phase approximation (RPA) and RPA with second-order screened exchange (SOSEX) have been implemented with complex orbitals as a basis for treating open-shell atoms. Both RPA and RPA+SOSEX are natural implicit current density functionals because the paramagnetic current density implicitly is included through the use of complex orbitals. We confirm that inclusion of the SOSEX correction improves the total energy accuracy substantially compared to RPA, especially for smaller-Z atoms. Computational complexity makes post self-consistent-field (post-SCF) evaluation of RPA-type expressions commonplace, so orbital basis origins and properties become important. Sizable differences are found in correlation energies, total atomic energies, and ionization energies for RPA-type functionals evaluated in the post-SCF fashion with orbital sets obtained from different schemes. Reference orbitals from Kohn-Sham calculations with semi-local functionals are more suitable for RPA+SOSEX to generate accurate total energies, but reference orbitals from exact exchange (non-local) yield essentially energetically degenerate open-shell atom ground states. RPA+SOSEX correlation combined with exact exchange calculated from a hybrid reference orbital set (half the exchange calculated from exact-exchange orbitals, the other half of the exchange from orbitals optimized for the Perdew-Burke-Ernzerhof (PBE) exchange functional) gives the best overall performance. Finally, numerical results show that the RPA-like functional with SOSEX correction can be used as a practical implicit current density functional when current effects should be included.

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

Efficient numerical techniques for complex fluid flows

The aim of the present research program is the development of more efficient and reliable calculation schemes for the coupled momentum and continuity equations. The resulting schemes would significantly reduce the expense of computing complex flows such as those in combustion chambers, gas turbines, and heat exchangers.

Patankar, Suhas V.↗
DOE OSTI2016

DEEP WIDEBAND SINGLE POINTINGS AND MOSAICS IN RADIO INTERFEROMETRY: HOW ACCURATELY DO WE RECONSTRUCT INTENSITIES AND SPECTRAL INDICES OF FAINT SOURCES?

Many deep wideband wide-field radio interferometric surveys are being designed to accurately measure intensities, spectral indices, and polarization properties of faint source populations. In this paper, we compare various wideband imaging methods to evaluate the accuracy to which intensities and spectral indices of sources close to the confusion limit can be reconstructed. We simulated a wideband single-pointing (C-array, L-Band (1–2 GHz)) and 46-pointing mosaic (D-array, C-Band (4–8 GHz)) JVLA observation using a realistic brightness distribution ranging from 1 μ Jy to 100 mJy and time-, frequency-, polarization-, and direction-dependent instrumental effects. The main results from these comparisons are (a) errors in the reconstructed intensities and spectral indices are larger for weaker sources even in the absence of simulated noise, (b) errors are systematically lower for joint reconstruction methods (such as Multi-Term Multi-Frequency-Synthesis (MT-MFS)) along with A-Projection for accurate primary beam correction, and (c) use of MT-MFS for image reconstruction eliminates Clean-bias (which is present otherwise). Auxiliary tests include solutions for deficiencies of data partitioning methods (e.g., the use of masks to remove clean bias and hybrid methods to remove sidelobes from sources left un-deconvolved), the effect of sources not at pixel centers, and the consequences of various other numerical approximations within software implementations. This paper also demonstrates the level of detail at which such simulations must be done in order to reflect reality, enable one to systematically identify specific reasons for every trend that is observed, and to estimate scientifically defensible imaging performance metrics and the associated computational complexity of the algorithms/analysis procedures.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Efficient Computation Of Surface Sunlit Fractions In Urban-Scale Building Modeling Using Ray-Tracing Techniques

For building energy simulation at an urban-scale, solar shading calculations can be significantly slow when a large number of shading surfaces are considered in the solar shading calculations, due to the computational complexity of the geometry calculations. We developed a new algorithm using the ray-tracing technique to pre-calculate the sunlit fractions of all exterior surfaces in an urban district altogether. The ray tracing-based calculator is accelerated using General Purpose Graphics Processing Units (GPGPUs) and the Optix ray tracing library, and provides an efficient, flexible, and robust means for computing the sunlit fraction of large numbers of urban surfaces of complex geometries.

Luo, Xuan↗
DOE OSTI2018

Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces

To compute the non-oscillating mutual interaction for a systems with N points, the fast multipole method (FMM) has an efficiency that scales linearly with the number of points. Specifically, for Coulomb interaction, FMM can be constructed using either the spherical harmonic functions or the totally symmetric Cartesian tensors. In this paper, we will present that the effciency of the Cartesian tensor-based FMM for the Coulomb interaction can be significantly improved by implementing the traces of the Cartesian tensors in calculation to reduce the independent elements of the n-th rank totally symmetric Cartesian tensor from (n + 1)(n + 2)=2 to 2n + 1. The computation complexity for the operations in FMM are analyzed and expressed as polynomials of the highest rank of the Cartesian tensors. For most operations, the complexity is reduced by one order. Numerical examples regarding the convergence and the effciency of the new algorithm are demonstrated. As a result, a reduction of computation time up to 50% has been observed for a moderate number of points and rank of tensors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A divergence-free constrained magnetic field interpolation method for scattered data

An interpolation method to evaluate magnetic fields, given its unstructured and scattered magnetic data, is presented. The method is based on the reconstruction of the global magnetic field using a superposition of orthogonal functions. The coefficients of the expansion are obtained by minimizing a cost function defined as the L2 norm of the difference between the ground truth and the reconstructed magnetic field evaluated on the training data. The divergence-free condition is incorporated as a constraint in the cost function, allowing the method to achieve arbitrarily small errors in the magnetic field divergence. An exponential decay of the approximation error is observed and compared with the less favorable algebraic decay of local splines. Compared to local methods involving computationally expensive search algorithms, the proposed method exhibits a significant reduction of the computational complexity of the field evaluation, while maintaining a small error in the divergence even in the presence of magnetic islands and stochasticity. Finally, applications to the computation of Poincaré sections using data obtained from numerical solutions of the magnetohydrodynamic equations in toroidal geometry are presented and compared with local methods currently in use.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Physically regularized machine learning emulators of aerosol activation

Abstract. The activation of aerosol into cloud droplets is an important step in the formation of clouds and strongly influences the radiative budget of the Earth. Explicitly simulating aerosol activation in Earth system models is challenging due to the computational complexity required to resolve the necessary chemical and physical processes and their interactions. As such, various parameterizations have been developed to approximate these details at reduced computational cost and accuracy. Here, we explore how machine learning emulators can be used to bridge this gap in computational cost and parameterization accuracy. We evaluate a set of emulators of a detailed cloud parcel model using physically regularized machine learning regression techniques. We find that the emulators can reproduce the parcel model at higher accuracy than many existing parameterizations. Furthermore, physical regularization tends to improve emulator accuracy, most significantly when emulating very low activation fractions. This work demonstrates the value of physical constraints in machine learning model development and enables the implementation of improved hybrid physical and machine learning models of aerosol activation into next-generation Earth system models.

58 GEOSCIENCES↗
NASA NTRSDate not supplied

A Comparison of Model Predictive Control Architectures for Application to Electrified Aircraft Propulsion Systems

As electrified aircraft propulsion (EAP) systems continue to mature, more sophisticated hardware and software are being developed to balance operations among electric machines and gas-turbine engines. In hybrid-electric propulsion systems, the increased complexity resulting from integrating turbine-engine shafts with electric machines necessitates control methodologies to account for various physical domains. Ideal controllers for hybrid-electric engines manage systems, subsystems, and their interactions in a coordinated fashion, able to account for safety and performance goals while being computationally efficient. In a previous work, linear model predictive control (MPC) schemes were implemented in centralized and distributed frameworks on a nonlinear turbofan engine model as a proof of concept. However, these schemes were not evaluated for computational complexity, prompting further study. The research presented here develops hierarchical MPC schemes to reduce the computational burden of the previous MPC schemes. A two-tier framework is implemented, where a slower sampling MPC controls electric machines and determines fan-speed tracking goals for a faster sampling controller, which is either a MPC or a proportional-integral (PI) controller. The proposed designs are compared to the centralized MPC investigated previously, and performance is measured via fan speed tracking error, energy storage state-of-charge, and computation time. Results reveal that the hierarchical MPC scheme employing a lower-level PI controller improves computation time while maintaining comparable tracking and state-of-charge regulation to the centralized scheme.

model predictive control↗
NASA NTRSDate not supplied

A Comparison of Model Predictive Control Architectures for Application to Electrified Aircraft Propulsion Systems

As electrified aircraft propulsion (EAP) systems continue to mature, more sophisticated hardware and software are being developed to balance operations among electric machines and gas-turbine engines. In hybrid-electric propulsion systems, the increased complexity resulting from integrating turbine-engine shafts with electric machines necessitates control methodologies to account for various physical domains. Ideal controllers for hybrid-electric engines manage systems, subsystems, and their interactions in a coordinated fashion, able to account for safety and performance goals while being computationally efficient. In a previous work, linear model predictive control (MPC) schemes were implemented in centralized and distributed frameworks on a nonlinear turbofan engine model as a proof of concept. However, these schemes were not evaluated for computational complexity, prompting further study. The research presented here develops hierarchical MPC schemes to reduce the computational burden of the previous MPC schemes. A two-tier framework is implemented, where a slower sampling MPC controls electric machines and determines fan-speed tracking goals for a faster sampling controller, which is either a MPC or a proportional-integral (PI) controller. The proposed designs are compared to the centralized MPC investigated previously, and performance is measured via fan speed tracking error, energy storage state-of-charge, and computation time. Results reveal that the hierarchical MPC scheme employing a lower-level PI controller improves computation time while maintaining comparable tracking and state-of-charge regulation to the centralized scheme.

model predictive control↗
DOE OSTI2024

Enabling HPC Scientific Workflows for Serverless

The convergence of edge computing, big data analytics, and AI with traditional scientific calculations is increasingly being adopted in HPC workflows. Workflow management systems are crucial for managing and orchestrating these complex computational tasks. However, it is difficult to identify patterns within the growing population of HPC workflows. Serverless has emerged as a novel computing paradigm, offering dynamic resource allocation, quick response time, fine-grained resource management and auto-scaling. In this paper, we propose a framework to enable HPC scientific workflows on serverless. Our approach integrates a widely used traditional HPC workflow generator with an HPC serverless workflow management system to create benchmark suites of scientific workflows with diverse characteristics. These workflows can be executed on different serverless platforms. We comprehensively compare executing workflows on traditional local containers and serverless computing platforms. Our results show that serverless can reduce CPU and memory usage respectively by 78.11% and 73.92% without compromising performance.

Andrei da silva, Anderson↗