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 505 records · Page 28

Solution of Third Computational Workshop Internal Propagation Problems using Low Order Schemes

The problems solved are propagation of sound waves through a transonic nozzle and shock-sound interaction. The first problem is solved using a MacCormack scheme. The second problem is solved by perturbation of a conservative Euler equation solution to the steady state. The problems are solved on evenly spaced grids. While solutions were found, the methods selected and not using stretched grids lead to solutions which do not compare well with those found using more accurate schemes. However, the perturbation of the mean flow scheme used to solve the second problem shows promise.

Miles, Jeffrey Hilton↗

QuakeSim and the Solid Earth Research Virtual Observatory

We are developing simulation and analysis tools in order to develop a solid Earth science framework for understanding and studying active tectonic and earthquake processes. The goal of QuakeSim and its extension, the Solid Earth Research Virtual Observatory (SERVO), is to study the physics of earthquakes using state-of-the-art modeling, data manipulation, and pattern recognition technologies. We are developing clearly defined accessible data formats and code protocols as inputs to simulations, which are adapted to high-performance computers. The solid Earth system is extremely complex and nonlinear resulting in computationally intensive problems with millions of unknowns. With these tools it will be possible to construct the more complex models and simulations necessary to develop hazard assessment systems critical for reducing future losses from major earthquakes. We are using Web (Grid) service technology to demonstrate the assimilation of multiple distributed data sources (a typical data grid problem) into a major parallel high-performance computing earthquake forecasting code. Such a linkage of Geoinformatics with Geocomplexity demonstrates the value of the Solid Earth Research Virtual Observatory (SERVO) Grid concept, and advances Grid technology by building the first real-time large-scale data assimilation grid.

virtual observatory↗

TQEA: Temporal Quantum Error Analysis

For the last few years quantum computers have captured researchers’ interest in solving complicated problems in finance, chemistry, machine learning, and many other NP problems. Quantum computing benefits from parallel computation, entanglement, and calculation speedup compared to classical computing. Even though the operations and number of qubits in quantum computers are limited, previous research showed that using quantum computers can be beneficial. These benefits gained researchers’ interest to work on the improvement of quantum computers and overcome the limitations by building more advanced quantum computers with fault tolerance capability, more physical qubits, and better operational gates. In practice, Quantum applications would be translated into Quantum Circuits and each circuit can contain one or many entanglements (s), single qubits operations, and readouts. The importance of running Quantum applications with controlled errors or without errors is critical to the desired result from Quantum readout. In this paper, we study the characteristics of superconducting quantum machines along with the previously proposed methods of Quantum error detection/correction and in order to build a better error model we propose a temporal method for analyzing the the behavior of qubits errors (T1 and T2), frequency of operation, entanglement errors, and readout errors. In order to detect and predict the behavior of each machine, we use simple exponential smoothing analysis on heuristic calibration data. Finally, based on observation, we show that based on frequency, qubits, readout and single operation errors we can build a temporal based model to study and predict the outcome of runs on each Quantum machine.

Baheri, Betis↗

Ion Coulomb Crystals in Storage Rings for Quantum Information Science

Quantum information science is a growing field that promises to take computing into a new age of higher performance and larger scale computing as well as being capable of solving problems classical computers are incapable of solving. The outstanding issue in practical quantum computing today is scaling up the system while maintaining interconnectivity of the qubits and low error rates in qubit operations to be able to implement error correction and fault-tolerant operations. Trapped ion qubits offer long coherence times that allow error correction. However, error correction algorithms require large numbers of qubits to work properly. We can potentially create many thousands (or more) of qubits with long coherence states in a storage ring. For example, a circular radio-frequency quadrupole, which acts as a large circular ion trap and could enable larger scale quantum computing. Such a Storage Ring Quantum Computer (SRQC) would be a scalable and fault tolerant quantum information system, composed of qubits with very long coherence lifetimes. With computing demands potentially outpacing the supply of high-performance systems, quantum computing could bring innovation and scientific advances to particle physics and other DOE supported programs. Increased support of R$\&$D in large scale ion trap quantum computers would allow the timely exploration of this exciting new scalable quantum computer. The R$\&$D program could start immediately at existing facilities and would include the design and construction of a prototype SRQC. We invite feedback from and collaboration with the particle physics and quantum information science communities.

43 PARTICLE ACCELERATORS↗

ELAS: A general-purpose computer program for the equilibrium problems of linear structures. Volume 2: Documentation of the program

A general purpose digital computer program for the in-core solution of linear equilibrium problems of structural mechanics is documented. The program requires minimum input for the description of the problem. The solution is obtained by means of the displacement method and the finite element technique. Almost any geometry and structure may be handled because of the availability of linear, triangular, quadrilateral, tetrahedral, hexahedral, conical, triangular torus, and quadrilateral torus elements. The assumption of piecewise linear deflection distribution insures monotonic convergence of the deflections from the stiffer side with decreasing mesh size. The stresses are provided by the best-fit strain tensors in the least squares at the mesh points where the deflections are given. The selection of local coordinate systems whenever necessary is automatic. The core memory is used by means of dynamic memory allocation, an optional mesh-point relabelling scheme and imposition of the boundary conditions during the assembly time.

Utku, S.↗

Grid Optimization Competition Challenge 3 Problem Formulation

This report contains the problem formulation for the Grid Optimization (GO) Competition Challenge 3. The Grid Optimization Competition is run by a team of researchers from a number of organizations, including the sponsor Advanced Research Projects Agency - Energy (ARPA-E), lead organization Pacific Northwest National Laboratory (PNNL), and technical contributors from Los Alamos National Laboratory (LANL), National Renewable Energy Laboratory (NREL), Texas A&M University (TAMU), Georgia Institute of Technology (GT), University of Wisconsin (UW), and others. The GO Competition poses challenge problems in the field of power grid management, invites entrants to develop solvers for these problems, invokes the solvers on a set of problem instances using common hardware, ranks the solvers according to their performance, and awards prizes according to the rankings. The overall goal of the GO Competition is to spur innovative research on high impact and computationally challenging problems in power grid management from initial development through commercial deployment. Complete information about the GO Competition can be found online at [2]. The webpage covers previous Challenges, rules, timeline, registration information, data formats, scoring methods, computational platform information, information on supported solvers and languages, sponsor information, frequently asked questions, administrator contact information, publicly available problem instances, computer code for reading and evaluating problem and solution data, a sandbox for testing solvers, and a solver submission interface, results, and publications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Experimental Flight Validation of the Prandtl 1933 Bell Spanload

This report describes the validation of the 1933 Prandtl bell spanload. This spanload is the minimum induced drag of a wing for a given structural weight with properties that eliminate adverse yaw. Aircraft using the Prandtl bell spanload were flown and investigated. The results of this research show that many previously held assumptions should be rethought, and the creation of aircraft using the Prandtl bell spanload will require considerable new techniques. Part of this work centered on the use of inverse methods. The usual first-step approach to a computational fluids problem is to create a geometry of the aircraft. Once this geometry exists, the computational fluids solution has been solved; however, the problem of creating the geometry still exists. A very small segment of the computational fluids world has concentrated on inverse solutions. This design approach begins with an end result - the computational fluids solution; from this end result, the geometry is sought. A more generic inverse tool was desired that would allow for the design of wings - specifically Prandtl bell spanload wings. Such a tool has been developed and allows for variable taper, aspect ratio, sweep, airfoils, and design-lift coefficients; output from the tool results in twist distribution of wings.

Albion H. Bowers↗

Domain decomposition algorithms and computational fluid dynamics

Some of the new domain decomposition algorithms are applied to two model problems in computational fluid dynamics: the two-dimensional convection-diffusion problem and the incompressible driven cavity flow problem. First, a brief introduction to the various approaches of domain decomposition is given, and a survey of domain decomposition preconditioners for the operator on the interface separating the subdomains is then presented. For the convection-diffusion problem, the effect of the convection term and its discretization on the performance of some of the preconditioners is discussed. For the driven cavity problem, the effectiveness of a class of boundary probe preconditioners is examined.

Chan, Tony F.↗

A simple three-component mixing problem for the evaluation of a new reaction rate model

A simple computational mixing problem is presented which can be utilized to assess the behavior of Reynolds-averaged reaction rate models in a problem with temporally varying mixedness. In this problem, three mixing components are homogeneously distributed but initially separated in a triply periodic domain. Further, these components are initialized within a Taylor–Green-like velocity field, which creates a mixing history evolving from the so-called “no-mix limit” to a well-mixed state. Large-eddy simulation results from this problem in configurations involving both premixed and nonpremixed reactants are then compared with zero-dimensional Reynolds-averaged Navier–Stokes results utilizing a new model for multicomponent reacting mixtures. The new model is shown to appropriately respect the no-mix limit and outperforms an earlier model (Morgan, 2022), particularly at early times when components are near the no-mix limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Formal Estimation of Errors in Computed Absolute Interaction Energies of Protein-Ligand Complexes

A largely unsolved problem in computational biochemistry is the accurate prediction of binding affinities of small ligands to protein receptors. We present a detailed analysis of the systematic and random errors present in computational methods through the use of error probability density functions, specifically for computed interaction energies between chemical fragments comprising a protein-ligand complex. An HIV-II protease crystal structure with a bound ligand (indinavir) was chosen as a model protein-ligand complex. The complex was decomposed into 21 interacting fragment pairs, which were studied using a number of computational methods. The chemically accurate complete basis set coupled cluster theory (CCSD(T)/CBS) interaction energies were used as reference values to generate our error estimates. In our analysis, we observed significant systematic and random errors in most methods, which was surprising, especially for parametrized classical and semiempirical quantum mechanical calculations. After propagating these fragment-based error estimates over the entire protein-ligand complex, our total error estimates for many methods are large compared to the experimentally determined free energy of binding. Thus, we conclude that statistical error analysis is a necessary addition to any scoring function attempting to produce reliable binding affinity predictions.

Chemistry↗

Cross-Modal Guidance for Fast Diffusion-Based Computed Tomography

Diffusion models have emerged as powerful priors for solving inverse problems in computed tomography (CT). In certain applications, such as neutron CT, it can be expensive to collect large amounts of measurements even for a single scan leading to sparse data sets from which it is challenging to obtain high quality reconstructions even with diffusion models. One strategy to mitigate this challenge is to leverage a complementary, easily available imaging modality; however, such approaches typically require retraining the diffusion model with large datasets. In this work, we propose incorporating an additional modality without retraining the diffusion prior, enabling accelerated imaging of costly modalities. We further examine the impact of imperfect side modalities on cross-modal guidance. Our method is evaluated on sparse-view neutron computed tomography, where reconstruction quality is substantially improved by incorporating X-ray computed tomography of the same samples.

Efimov, Timofey [ORNL] (ORCID:000900090098471X)↗

Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints (SHEBO) v1.0

SHEBO (surrogate optimization of problems with hidden constraints and expensive black-box objectives) is an efficient optimization algorithm that employs surrogate models to solve computationally expensive black-box simulation optimization problems that have hidden constraints. Hidden constraints are encountered when the objective function evaluation does not return a value for a parameter vector. These constraints are often encountered in optimization problems in which the objective function is computed by a black-box simulation code. SHEBO uses a combination of local and global search strategies together with an evaluability prediction function and a dynamically adjusted evaluability threshold to iteratively select new sample points.

Mueller, Juliane↗