Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 1,009 records · Page 56

Development of computational fluid dynamics at NASA Ames Research Center

Ames Research Center has the lead role among NASA centers to conduct research in computational fluid dynamics. The past, the present, and the future prospects in this field are reviewed. Past accomplishments include pioneering computer simulations of fluid dynamics problems that have made computers valuable in complementing wind tunnels for aerodynamic research. The present facilities include the most powerful computers built in the United States. Three examples of viscous flow simulations are presented: an afterbody with an exhaust plume, a blunt fin mounted on a flat plate, and the Space Shuttle. The future prospects include implementation of the Numerical Aerodynamic Simulation Processing System that will provide the capability for solving the viscous flow field around an aircraft in a matter of minutes.

Inouye, M.↗

Development of computational fluid dynamics at NASA Ames Research Center

Ames Research Center has the lead role among NASA centers to conduct research in computational fluid dynamics. The past, the present, and the future prospects in this field are reviewed. Past accomplishments include pioneering computer simulations of fluid dynamics problems that have made computers valuable in complementing wind tunnels for aerodynamic research. The present facilities include the most powerful computers built in the United States. Three examples of viscous flow simulations are presented: an afterbody with an exhaust plume, a blunt fin mounted on a flat plate, and the space shuttle. The future prospects include implementation of the Numerical Aerodynamic Simulation Processing System that will provide the capability for solving the viscous flow field around an aircraft in a matter of minutes.

Inouye, M.↗

2019 Budget Request for the DOE Computational Science Graduate Fellowship (CSGF) Grant

The Department of Energy Computational Science Graduate Fellowship (DOE CSGF) is necessary to meet the continual challenging national workforce needs that arise as computational science and engineering problems continue to grow in scope and complexity. Computational science and engineering (CSE) is a multidisciplinary approach that uses scientific computing to solve practical problems methods and to supply technical tools across the scientific discovery spectrum. In particular, the DOE CSGF emphasizes high-performance computing (HPC) that enables CSE that advances science and engineering in directions important to the DOE and the economy in general. Over the past half-century, HPC has been an essential tool for DOE’s success. During this period, important missions, such as nuclear stockpile stewardship, have turned to HPC as an essential technology. Entire science disciplines, such as biology and cosmology, have been transformed through the augmentation of scientific observation via HPC. At government laboratories and in industry, DOE CSGF alumni are helping push traditional HPC boundaries while contributing to discoveries in high-energy physics, renewable energy, fusion-reactor design, additive manufacturing, nanomaterials for next-generation batteries and transistors, and turbine and advanced nuclear reactor modeling. In addition, HPC is used to address national health needs that will eventually point to cures both by helping cancer researchers manage and analyze huge troves of data, by simulating biological mechanisms, and by accelerating drug development — including continuing to rise to the challenge of pandemic-related research. A 2023 report from the ASCAC Subcommittee on American Competitiveness and Innovation to the ASCR office, “Can the United States Maintain Its Leadership in High-Performance Computing?” says of the Program, “The CSGF program provides a barometer for disciplines that will be of interest to future DOE computing.” An explosion in scientific and technological data has driven the need for increasingly sophisticated HPC to transform those data into scientific understanding. With access to more and more data and the proliferation of HPC, Machine Learning and Artificial Intelligence are experiencing a renaissance, complementing the now well-established use of computational simulation. Indeed, in its September 2020 subcommittee report on “AI/ML, Data Intensive Science and High-Performance Computing”, the DOE Advanced Scientific Computing Advisory Committee (ASCAC) explicitly called for a fellowship program to train computational and data scientists to tackle exascale and data-intensive computing challenges. This collaboration of empirical and theory-based modeling will increasingly inform federal policymakers whose decisions affect American society and future generations, and it requires highly skilled and intellectually agile computational scientists who can support the fast-moving DOE National Laboratory research environment. In fact, the DOE CSGF program has explicitly and consistently addressed this need.

97 MATHEMATICS AND COMPUTING↗

Application of computational fluid mechanics to atmospheric pollution problems

One of the most noticeable effects of air pollution on the properties of the atmosphere is the reduction in visibility. This paper reports the results of investigations of the fluid dynamical and microphysical processes involved in the formation of advection fog on aerosols from combustion-related pollutants, as condensation nuclei. The effects of a polydisperse aerosol distribution, on the condensation/nucleation processes which cause the reduction in visibility are studied. This study demonstrates how computational fluid mechanics and heat transfer modeling can be applied to simulate the life cycle of the atmosphereic pollution problems.

Hung, R. J.↗

Conservative boundary conditions for 3D gas dynamics problems

A method is described for 3D-gas dynamics computer simulation in regions of complicated shape by means of nonadjusted rectangular grids providing unified treatment of various problems. Some test problem computation results are given.

Gerasimov, B. P.↗

An interactive computer approach to performing resource analysis for a multi-resource/multi-project problem

New planning techniques and supporting computer tools are needed for the optimization of resources and costs for space transportation and payload systems. Heavy emphasis on cost effective utilization of resources has caused NASA program planners to look at the impact of various independent variables that affect procurement buying. A description is presented of a category of resource planning which deals with Spacelab inventory procurement analysis. Spacelab is a joint payload project between NASA and the European Space Agency and will be flown aboard the Space Shuttle starting in 1980. In order to respond rapidly to the various procurement planning exercises, a system was built that could perform resource analysis in a quick and efficient manner. This system is known as the Interactive Resource Utilization Program (IRUP). Attention is given to aspects of problem definition, an IRUP system description, questions of data base entry, the approach used for project scheduling, and problems of resource allocation.

Schlagheck, R. A.↗

The complexity of NISQ

Abstract The recent proliferation of NISQ devices has made it imperative to understand their power. In this work, we define and study the complexity class , which encapsulates problems that can be efficiently solved by a classical computer with access to noisy quantum circuits. We establish super-polynomial separations in the complexity among classical computation, , and fault-tolerant quantum computation to solve some problems based on modifications of Simon’s problems. We then consider the power of for three well-studied problems. For unstructured search, we prove that cannot achieve a Grover-like quadratic speedup over classical computers. For the Bernstein-Vazirani problem, we show that only needs a number of queries logarithmic in what is required for classical computers. Finally, for a quantum state learning problem, we prove that is exponentially weaker than classical computers with access to noiseless constant-depth quantum circuits.

42 ENGINEERING↗

A locally refined rectangular grid finite element method - Application to computational fluid dynamics and computational physics

The present FEM technique addresses both linear and nonlinear boundary value problems encountered in computational physics by handling general three-dimensional regions, boundary conditions, and material properties. The box finite elements used are defined by a Cartesian grid independent of the boundary definition, and local refinements proceed by dividing a given box element into eight subelements. Discretization employs trilinear approximations on the box elements; special element stiffness matrices are included for boxes cut by any boundary surface. Illustrative results are presented for representative aerodynamics problems involving up to 400,000 elements.

Young, David P.↗

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗

On the generalized VIP time integral methodology for transient thermal problems

The paper describes the development and applicability of a generalized VIrtual-Pulse (VIP) time integral method of computation for thermal problems. Unlike past approaches for general heat transfer computations, and with the advent of high speed computing technology and the importance of parallel computations for efficient use of computing environments, a major motivation via the developments described in this paper is the need for developing explicit computational procedures with improved accuracy and stability characteristics. As a consequence, a new and effective VIP methodology is described which inherits these improved characteristics. Numerical illustrative examples are provided to demonstrate the developments and validate the results obtained for thermal problems.

Mei, Youping↗

Physics-Informed Neural Network Method for Forward and Backward Advection-Dispersion Equations

Advection-dispersion equations (ADEs) are commonly used to describe transport phenomena in porous media. Even though mature discretization-based numerical methods for ADEs exist, some challenges still remain, especially when it comes to solving advection-dominated forward ADEs and diffusion-dominated backward ADEs. The latter problem usually arises in the source identification context and leads to numerically unstable grid-based solutions that require a form of regularization or should be treated as an inverse problem that is computationally more expensive because it requires solving the forward problem multiple times. In this study, we propose a discretization-free approach based on the physics-informed neural network (PINN) method for solving coupled ADE and Darcy flow equations with space-dependent hydraulic conductivity. In this approach, the hydraulic conductivity, hydraulic head, and concentration fields are approximated with deep neural networks (DNNs). We assume that the conductivity field is given by its values on a grid, and we use these values to train the conductivity DNN. The head and concentration DNNs are trained by minimizing the residuals of the flow equation and ADE and using the initial and boundary conditions as additional constraints. The PINN method is applied to one- and two-dimensional forward ADE problems, where its performance for various P\'{e}clet numbers ($Pe$) is compared with the analytical and numerical solutions. We find that the PINN method is accurate with errors of less than 1\% and outperforms some conventional discretization-based methods for $Pe$ larger that 100. Next, we demonstrate that the PINN method remains accurate for the backward ADEs, with the relative errors in most cases staying under 5\% compared to the reference concentration field. Finally, we show that when available, the concentration measurements can be easily incorporated in the PINN method and significantly improve (by more than 50\% in the considered cases) the accuracy of the PINN solution of the backward ADE.

He, Qizhi↗

QuGAN: A Quantum State Fidelity based Generative Adversarial Network

In the recent years, Generative Adversarial Networks (GANs) have been arguably one of the largest strides forward in Deep Learning. Many papers illustrate the use of GANs to accomplish extremely impressive goals, such as text-to-image or image augmentation. Specifically, GANs have seen this success in the computer vision domain. However, GANs are not without their own set of problems. GANs are computationally expensive, sometimes computationally prohibitive, and can suffer a multitude of convergence problems. As research on classical GANs continues to push the topic further, a branch of GANs, namely Quantum GANs, has seen research interest in the past years. In this work, we intend to push this research further with an illustration of a Quantum GAN architecture that provide stable convergence of the model and is extended onto real data sets. Furthermore, unlike many other Quantum GANs out there, our model's GAN architecture runs the discriminator and the generator primarily on Quantum hardware through the use of a Quantum-based similarity metric. When compared to the very few other Quantum GAN papers, our architecture leads to significantly better results in almost all aspects.

Stein, Samuel A.↗

NASTRAN: User experience with four example problems

Four different structural problems are solved to gain familiarity with the NASTRAN computer program. The problems are: (1) a simply-supported beam subjected to lateral loads, (2) a rotating filamentary composite bar under the action of centrifugal forces, (3) a missile body with aerodynamic, gravitational, and inertial forces, and (4) a square simply-supported plate with in-plane temperature changes capable of buckling the plate. Input and output data are given for each problem. The results are compared with those obtained by other methods. However, except for the examples employing beam elements in which the agreement is excellent, the element breakup chosen for convenience in obtaining program familiarity is too coarse to draw conclusions regarding the program accuracy. The example problems disclosed errors in the plotting and thermal-buckling routines of the program.

Rivello, R. M.↗

Dynamic Flow Management Problems in Air Transportation

In 1995, over six hundred thousand licensed pilots flew nearly thirty-five million flights into over eighteen thousand U.S. airports, logging more than 519 billion passenger miles. Since demand for air travel has increased by more than 50% in the last decade while capacity has stagnated, congestion is a problem of undeniable practical significance. In this thesis, we will develop optimization techniques that reduce the impact of congestion on the national airspace. We start by determining the optimal release times for flights into the airspace and the optimal speed adjustment while airborne taking into account the capacitated airspace. This is called the Air Traffic Flow Management Problem (TFMP). We address the complexity, showing that it is NP-hard. We build an integer programming formulation that is quite strong as some of the proposed inequalities are facet defining for the convex hull of solutions. For practical problems, the solutions of the LP relaxation of the TFMP are very often integral. In essence, we reduce the problem to efficiently solving large scale linear programming problems. Thus, the computation times are reasonably small for large scale, practical problems involving thousands of flights. Next, we address the problem of determining how to reroute aircraft in the airspace system when faced with dynamically changing weather conditions. This is called the Air Traffic Flow Management Rerouting Problem (TFMRP) We present an integrated mathematical programming approach for the TFMRP, which utilizes several methodologies, in order to minimize delay costs. In order to address the high dimensionality, we present an aggregate model, in which we formulate the TFMRP as a multicommodity, integer, dynamic network flow problem with certain side constraints. Using Lagrangian relaxation, we generate aggregate flows that are decomposed into a collection of flight paths using a randomized rounding heuristic. This collection of paths is used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for individual flights. The algorithm, termed the Lagrangian Generation Algorithm, is used to solve practical problems in the southwestern portion of United States in which the solutions are within 1% of the corresponding lower bounds.

Patterson, Sarah Stock↗

Measures and Models for Estimating and Predicting Cognitive Fatigue

We analyzed EEG and ERPs in a fatiguing mental task and created statistical models for single subjects. Seventeen subjects (4 F, 18-38 y) viewed 4-digit problems (e.g., 3+5-2+7=15) on a computer, solved the problems, and pressed keys to respond (intertrial interval = 1 s). Subjects performed until either they felt exhausted or three hours had elapsed. Re- and post-task measures of mood (Activation Deactivation Adjective Checklist, Visual Analogue Mood Scale) confirmed that fatigue increased and energy decreased over time. We tested response times (RT); amplitudes of ERP components N1, P2, P300, readiness potentials; and amplitudes of frontal theta and parietal alpha rhythms for change as a function of time. For subjects who completed 3 h (n=9) we analyzed 12 15-min blocks. For subjects who completed at least 1.5 h (n=17), we analyzed the first-, middle-, and last 100 error-free trials. Mean RT rose from 6.7 s to 8.5 s over time. We found no changes in the amplitudes of ERP components. In both analyses, amplitudes of frontal theta and parietal alpha rose by 30% or more over time. We used 30-channel EEG frequency spectra to model the effects of time in single subjects using a kernel partial least squares classifier. We classified 3.5s EEG segments as being from the first 100 or the last 100 trials, using random sub-samples of each class. Test set accuracies ranged from 63.9% to 99.6% correct. Only 2 of 17 subjects had mean accuracies lower than 80%. The results suggest that EEG accurately classifies periods of cognitive fatigue in 90% of subjects.

Trejo, Leonard J.↗

BEYONDPLANCK II. CMB mapmaking through Gibbs sampling

We present a Gibbs sampling solution to the mapmaking problem for cosmic microwave background (CMB) measurements that builds on existing destriping methodology. Gibbs sampling breaks the computationally heavy destriping problem into two separate steps: noise filtering and map binning. Considered as two separate steps, both are computationally much cheaper than solving the combined problem. This provides a huge performance benefit as compared to traditional methods and it allows us, for the first time, to bring the destriping baseline length to a single sample. Here, we applied the Gibbs procedure to simulated Planck 30 GHz data. We find that gaps in the time-ordered data are handled efficiently by filling them in with simulated noise as part of the Gibbs process. The Gibbs procedure yields a chain of map samples, from which we are able to compute the posterior mean as a best-estimate map. The variation in the chain provides information on the correlated residual noise, without the need to construct a full noise covariance matrix. However, if only a single maximum-likelihood frequency map estimate is required, we find that traditional conjugate gradient solvers converge much faster than a Gibbs sampler in terms of the total number of iterations. The conceptual advantages of the Gibbs sampling approach lies in statistically well-defined error propagation and systematic error correction. This methodology thus forms the conceptual basis for the mapmaking algorithm employed in the BEYONDPLANCK framework, which implements the first end-to-end Bayesian analysis pipeline for CMB observations.

79 ASTRONOMY AND ASTROPHYSICS↗

On‐site surrogates for large‐scale calibration

Abstract Motivated by a computer model calibration problem from the oil and gas industry, involving the design of a honeycomb seal, we develop a new Bayesian methodology to cope with limitations in the canonical apparatus stemming from several factors. We propose a new strategy of on‐site design and surrogate modeling for a computer simulator acting on a high‐dimensional input space that, although relatively speedy, is prone to numerical instabilities, missing data, and nonstationary dynamics. Our aim is to strike a balance between data‐faithful modeling and computational tractability in a calibration framework—tailoring the computer model to a limited field experiment. Situating our on‐site surrogates within the canonical calibration apparatus requires updates to that framework. We describe a novel yet intuitive Bayesian setup that carefully decomposes otherwise prohibitively large matrices by exploiting the sparse blockwise structure. Empirical illustrations demonstrate that this approach performs well on toy data and our motivating honeycomb example.

Huang, Jiangeng↗

Improved computed torque control for industrial robots

The authors examine the computed torque control problem for a robot arm with flexible, geared, joint drive systems which are typical in many industrial robots. The standard computed torque algorithm is not directly applicable to this class of manipulators due to the dynamics introduced by the joint drive systems. The proposed approach overcomes this problem by combining a novel computed torque algorithm with simple torque controllers at each joint of the robot. The control scheme is applied to a seven degree-of-freedom industrial manipulator, and the system performance in standard tasks is evaluated using both dynamic simulation and actual experiments. The results show that the proposed controller leads to improved tracking performance over a conventional PD (proportional plus derivative) controller.

Uebel, Mark↗