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,369 records · Page 76

Gravitational Many-Body Problem

In this paper, we briefly review some aspects of the gravitational many-body problem, which is one of the oldest problems in the modern mathematical science. Then we review our GRAPE project to design computers specialized to this problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗

The design, development, and flight testing of a modern-control-designed autoland system

This paper discusses the design, development, and flight test results of a full-state feedback modern-controls-designed autoland system - the Digital Integrated Automatic Landing System (DIALS). The lateral and longitudinal control laws were designed by formulating a linear quadratic regulator with disturbances problem. Although the designs were independent of each other, in implementation cross-coupling of the lateral and longitudinal variables does occur. A brief discussion of the control modes - localizer capture, localizer track, decrab, glideslope capture, glideslope track, and flare - and the modifications made to the basic design during the simulation phase to achieve desired performance is given. Some of the efforts required to implement the system in the flight computers and some problems encountered in the ground hardware simulation checkout are discussed. Finally, flight test data is presented for this system which performed 10 'hands off' automatic landings. The flight test data includes the performance of the aircraft in mild, gust, and wind shear conditions.

Hueschen, R. M.↗

Scalable tuning of building models to hourly data

Energy models of existing buildings are unreliable unless calibrated so they correlate well with actual energy usage. Manual tuning requires a skilled professional, is prohibitively expensive for small projects, imperfect, non-repeatable, non-transferable, and not scalable to the dozens of sensor channels that smart meters, smart appliances, and cheap/ubiquitous sensors are beginning to make available today. A scalable, automated methodology is needed to quickly and intelligently calibrate building energy models to all available data, increase the usefulness of those models, and facilitate speed-and-scale penetration of simulation-based capabilities into the marketplace for actualized energy savings. The "Autotune'' project is a novel, model-agnostic methodology which leverages supercomputing, large simulation ensembles, and big data mining with multiple machine learning algorithms to allow automatic calibration of simulations that match measured experimental data in a way that is deployable on commodity hardware. This paper shares several methodologies employed to reduce the combinatorial complexity to a computationally tractable search problem for hundreds of input parameters. Furthermore, accuracy metrics are provided which quantify model error to measured data for either monthly or hourly electrical usage from a highly-instrumented, emulated-occupancy research home.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

B-spline Method in Fluid Dynamics

B-spline functions are bases for piecewise polynomials that possess attractive properties for complex flow simulations : they have compact support, provide a straightforward handling of boundary conditions and grid nonuniformities, and yield numerical schemes with high resolving power, where the order of accuracy is a mere input parameter. This paper reviews the progress made on the development and application of B-spline numerical methods to computational fluid dynamics problems. Basic B-spline approximation properties is investigated, and their relationship with conventional numerical methods is reviewed. Some fundamental developments towards efficient complex geometry spline methods are covered, such as local interpolation methods, fast solution algorithms on cartesian grid, non-conformal block-structured discretization, formulation of spline bases of higher continuity over triangulation, and treatment of pressure oscillations in Navier-Stokes equations. Application of some of these techniques to the computation of viscous incompressible flows is presented.

Botella, Olivier↗

Performance of a parallel code for the Euler equations on hypercube computers

The performance of hypercubes were evaluated on a computational fluid dynamics problem and the parallel environment issues were considered that must be addressed, such as algorithm changes, implementation choices, programming effort, and programming environment. The evaluation focuses on a widely used fluid dynamics code, FLO52, which solves the two dimensional steady Euler equations describing flow around the airfoil. The code development experience is described, including interacting with the operating system, utilizing the message-passing communication system, and code modifications necessary to increase parallel efficiency. Results from two hypercube parallel computers (a 16-node iPSC/2, and a 512-node NCUBE/ten) are discussed and compared. In addition, a mathematical model of the execution time was developed as a function of several machine and algorithm parameters. This model accurately predicts the actual run times obtained and is used to explore the performance of the code in interesting but yet physically realizable regions of the parameter space. Based on this model, predictions about future hypercubes are made.

Barszcz, Eric↗

Deterministic methods for numerical simulation of high-energy runaway electron avalanches

The possibilities of two deterministic methods for describing the kinetics of high-energy runaway electrons (REs) are analyzed as alternatives to stochastic methods requiring unrealistically large computing resources in problems of numerical simulation of electric discharges in dense gases involving REs. One of the methods being developed in recent years is based on multigroup equations for the moments of the electron distribution function, while the second method, which is conventionally used to solve problems in gas discharges, is based on the diffusion-drift equation. The modern method of multigroup equations allows one to calculate the RE energy distribution and the spatial RE distribution along the electric force, which are close to these distributions obtained by the Monte Carlo method if the number N of energy groups is chosen properly. The diffusion-drift equation does not give the energy distribution, but its advantage is the possibility of obtaining spatial RE distributions using small computing resources not only along but also perpendicular to the electric force, which are close to those calculated by the Monte Carlo method. To simulate discharges by the method of multigroup equations, it is necessary to know a priori the number N of groups providing good accuracy, the characteristic RE multiplication time t{sub e}, and the energy runaway threshold {epsilon}{sub th} as functions of the electric-field overvoltage. The diffusion-drift equation requires the specification, along with t{sub e}, of the directed RE velocity and longitudinal and transverse diffusion coefficients calculated by the Monte Carlo method.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Benchmarking Mixed Mode Failure in Progressive Damage and Failure Analysis Methods

The verification and validation of progressive-damage-analysis finite element methods are difficult but critical tasks to undertake during their development. Verification exercises assess whether a predictive analysis tool produces results that are consistent with the fundamental concepts and assumptions of the tool under evaluation. Ideally, closed-form analytical solutions can be derived for which method verification results can be compared. Problems selected for computational tool verification are often simple and isolate individual features of the tool. In the case of progressive damage finite element methods, verifications should be performed to evaluate the ability of the model to predict the initiation of damage and its growth through the finite element mesh under a variety of conditions. Mabson et al. proposed a test case of a unidirectional, fiber-reinforced plate with a center crack subjected to tensile loads to evaluate matrix crack propagation predictions. The problem was modeled using the Abaqus Hashin continuum damage mechanics (CDM) model for fiber-reinforced composites. Different combinations of matrix strengths and element sizes were used in the simulations, and the results were compared to a closed-form solution based on linear elastic fracture mechanics (LEFM). It was determined that the Abaqus CDM model could predict the LEFM solution of Mode I cracks only when the finite element mesh density met specific requirements based on the material properties. This paper presents closed-form LEFM solutions for a center notch mixed mode (CNMM) verification problem. Parametric finite element analyses were developed using progressive damage analysis methods of both the Discrete Damage Mechanics (DDM) and CDM classes. The progressive damage analysis methods applied in the analyses of the CNMM problem include CompDam and the Floating Node Method. Analyses were conducted with various mode mixities and element sizes to verify that the damage models were working as intended and to identify any limits of applicability.

Leone, Frank↗

On a numerical solution of the plastic buckling problem of structures

An automated digital computer procedure is presented for the accurate and efficient solution of the plastic buckling problem of structures. This is achieved by a Sturm sequence method employing a bisection strategy, which eliminates the need for having to solve the buckling eigenvalue problem at each incremental (decremental) loading stage that is associated with the usual solution techniques. The plastic buckling mode shape is determined by a simple inverse iteration process, once the buckling load has been established. Numerical results are presented for plate problems with various edge conditions. The resulting computer program written in FORTRAN V for the JPL UNIVAC 1108 machine proves to be most economical in comparison with other existing methods of such analysis.

Gupta, K. K.↗

Network Reconfiguration for Enhanced Operational Resilience Using Reinforcement Learning

This paper proposes a reinforcement learning-based approach for distribution network reconfiguration(DNR) to enhance the resilience of the electric power supply. Resilience enhancements usually require solving large-scale stochastic optimization problems that are computationally expensive and sometimes infeasible. The exceptional performance of reinforcement learning techniques has encouraged their adoption in various power system control studies, specifically resilience-based real-time applications. In this paper, a single agent framework is developed using an Actor-Critic algorithm (ACA) to determine statuses of tie-switches in a distribution feeder impacted by an extreme weather event. The proposed approach provides a fast-acting control algorithm that reconfigures the feeder topology to reduce or even avoid load shedding. The problem is formulated as a discrete Markov decision process in such a way that a system state captures the system topology and its operational characteristics. An action is made to open or close a specific set of tie-switches after which a reward is calculated to evaluate the practicality and advantage of that action. The iterative Markov process is used to train the proposed ACA under diverse failure scenarios and is demonstrated on the 33-node distribution feeder system. Results show the capability of the proposed ACA to determine proper switching action of tie-switches with accuracy exceeding 93%.

actor critic↗

Quantum Optimization and Approximation Algorithms

Shor's groundbreaking quantum algorithm for integer factoring provides an exponential speedup over the best-known classical algorithms. In the 20 years since Shor's algorithm was conceived, only a handful of fundamental quantum algorithmic kernels, generally providing modest polynomial speedups over classical algorithms, have been invented. To better understand the potential advantage quantum resources provide over their classical counterparts, one may consider other resources than execution time of algorithms. Quantum Approximation Algorithms direct the power of quantum computing towards optimization problems where quantum resources provide higher-quality solutions instead of faster execution times. We provide a new rigorous analysis of the recent Quantum Approximate Optimization Algorithm, demonstrating that it provably outperforms the best known classical approximation algorithm for special hard cases of the fundamental Maximum Cut graph-partitioning problem. We also develop new types of classical approximation algorithms for finding near-optimal low-energy states of physical systems arising in condensed matter by extending seminal discrete optimization techniques. Our interdisciplinary work seeks to unearth new connections between discrete optimization and quantum information science.

97 MATHEMATICS AND COMPUTING↗

Programmable simulations of molecules and materials with reconfigurable quantum processors

Simulations of quantum chemistry and quantum materials are believed to be among the most important applications of quantum information processors. However, realizing practical quantum advantage for such problems is challenging because of the prohibitive computational cost of programming typical problems into quantum hardware. Here we introduce a simulation framework for strongly correlated quantum systems represented by model spin Hamiltonians that uses reconfigurable qubit architectures to simulate real-time dynamics in a programmable way. Our approach also introduces an algorithm for extracting chemically relevant spectral properties via classical co-processing of quantum measurement results. We develop a digital–analogue simulation toolbox for efficient Hamiltonian time evolution using digital Floquet engineering and hardware-optimized multi-qubit operations to accurately realize complex spin–spin interactions. As an example, we propose an implementation based on Rydberg atom arrays. In addition, we show how detailed spectral information can be extracted from the dynamics through snapshot measurements and single-ancilla control, enabling the evaluation of excitation energies and finite-temperature susceptibilities from a single dataset. To illustrate the approach, we show how to use the method to compute key properties of a polynuclear transition-metal catalyst and two-dimensional magnetic materials.

74 ATOMIC AND MOLECULAR PHYSICS↗

Performance analysis of parallel branch and bound search with the hypercube architecture

With the availability of commercial parallel computers, researchers are examining new classes of problems which might benefit from parallel computing. This paper presents results of an investigation of the class of search intensive problems. The specific problem discussed is the Least-Cost Branch and Bound search method of deadline job scheduling. The object-oriented design methodology was used to map the problem into a parallel solution. While the initial design was good for a prototype, the best performance resulted from fine-tuning the algorithm for a specific computer. The experiments analyze the computation time, the speed up over a VAX 11/785, and the load balance of the problem when using loosely coupled multiprocessor system based on the hypercube architecture.

Mraz, Richard T.↗

ParMOO: A Python library for parallel multiobjective simulation optimization

A multiobjective optimization problem (MOOP) is an optimization problem in which multiple objectives are optimized simultaneously. The goal of a MOOP is to find solutions that describe the tradeoff between these (potentially conflicting) objectives. Such a tradeoff surface is called the Pareto front. Real-world MOOPs may also involve constraints – additional hard rules that every solution must adhere to. In a multiobjective simulation optimization problem, the objectives are derived from the outputs of one or more computationally expensive simulations. Such problems are ubiquitous in science and engineering.

97 MATHEMATICS AND COMPUTING↗

Numerical solution of the compressible Navier-Stokes equations using density gradients as additional dependent variables

Numerical solution of two dimensional, time dependent, compressible viscous Navier-Stokes equations about arbitrary bodies was treated using density gradients as additional dependent variables. Thus, six dependent variables were computed with the SOR iteration method. Besides formulation for pressure gradient terms, a formulation for computing the body density was presented. To approximate the governing equations, an implicit finite difference method was employed. In computing the solution for the flow about a circular cylinder, a problem arose near the wall at both stagnation points. Thus, computations with various conditions were tried to examine the problem. Also, computations with and without formulations are compared. The flow variables were computed on 37 by 40 field first, then on an 81 by 40 field.

Kwon, J. H.↗

Real-time characterization of partially observed epidemics using surrogate models.

We present a statistical method, predicated on the use of surrogate models, for the 'real-time' characterization of partially observed epidemics. Observations consist of counts of symptomatic patients, diagnosed with the disease, that may be available in the early epoch of an ongoing outbreak. Characterization, in this context, refers to estimation of epidemiological parameters that can be used to provide short-term forecasts of the ongoing epidemic, as well as to provide gross information on the dynamics of the etiologic agent in the affected population e.g., the time-dependent infection rate. The characterization problem is formulated as a Bayesian inverse problem, and epidemiological parameters are estimated as distributions using a Markov chain Monte Carlo (MCMC) method, thus quantifying the uncertainty in the estimates. In some cases, the inverse problem can be computationally expensive, primarily due to the epidemic simulator used inside the inversion algorithm. We present a method, based on replacing the epidemiological model with computationally inexpensive surrogates, that can reduce the computational time to minutes, without a significant loss of accuracy. The surrogates are created by projecting the output of an epidemiological model on a set of polynomial chaos bases; thereafter, computations involving the surrogate model reduce to evaluations of a polynomial. We find that the epidemic characterizations obtained with the surrogate models is very close to that obtained with the original model. We also find that the number of projections required to construct a surrogate model is O(10)-O(10{sup 2}) less than the number of samples required by the MCMC to construct a stationary posterior distribution; thus, depending upon the epidemiological models in question, it may be possible to omit the offline creation and caching of surrogate models, prior to their use in an inverse problem. The technique is demonstrated on synthetic data as well as observations from the 1918 influenza pandemic collected at Camp Custer, Michigan.

59 BASIC BIOLOGICAL SCIENCES↗

Artificial Boundary Conditions Based on the Difference Potentials Method

While numerically solving a problem initially formulated on an unbounded domain, one typically truncates this domain, which necessitates setting the artificial boundary conditions (ABC's) at the newly formed external boundary. The issue of setting the ABC's appears to be most significant in many areas of scientific computing, for example, in problems originating from acoustics, electrodynamics, solid mechanics, and fluid dynamics. In particular, in computational fluid dynamics (where external problems present a wide class of practically important formulations) the proper treatment of external boundaries may have a profound impact on the overall quality and performance of numerical algorithms. Most of the currently used techniques for setting the ABC's can basically be classified into two groups. The methods from the first group (global ABC's) usually provide high accuracy and robustness of the numerical procedure but often appear to be fairly cumbersome and (computationally) expensive. The methods from the second group (local ABC's) are, as a rule, algorithmically simple, numerically cheap, and geometrically universal; however, they usually lack accuracy of computations. In this paper we first present a survey and provide a comparative assessment of different existing methods for constructing the ABC's. Then, we describe a relatively new ABC's technique of ours and review the corresponding results. This new technique, in our opinion, is currently one of the most promising in the field. It enables one to construct such ABC's that combine the advantages relevant to the two aforementioned classes of existing methods. Our approach is based on application of the difference potentials method attributable to V. S. Ryaben'kii. This approach allows us to obtain highly accurate ABC's in the form of certain (nonlocal) boundary operator equations. The operators involved are analogous to the pseudodifferential boundary projections first introduced by A. P. Calderon and then also studied by R. T. Seeley. The apparatus of the boundary pseudodifferential equations, which has formerly been used mostly in the qualitative theory of integral equations and PDE'S, is now effectively employed for developing numerical methods in the different fields of scientific computing.

Tsynkov, Semyon V.↗

Quantum Testbeds Stakeholder Workshop (QTSW) Report meeting purpose and agenda.

Quantum computing (QC) is a promising early-stage technology with the potential to provide scientific computing capabilities far beyond what is possible with even an Exascale computer in specific problems of relevance to the Office of Science. These include (but are not limited to) materials modeling, molecular dynamics, and quantum chromodynamics. However, commercial QC systems are not yet available and the technical maturity of current QC hardware, software, algorithms, and systems integration is woefully incomplete. Thus, there is a significant opportunity for DOE to define the technology building blocks, and solve the system integration issues to enable a revolutionary tool. Once realized, QC will have world changing impact on economic competitiveness, the scientific enterprise, and citizen well-being. Prior to this workshop, DOE / Office of Advanced Scientific Computing Research (ASCR) hosted a workshop in 2015 to explore QC scientific applications. The goal of that workshop was to assess the viability of QC technologies to meet the computational requirements in support of DOE’s science and energy mission and to identify the potential impact of these technologies.

97 MATHEMATICS AND COMPUTING↗