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,585 records · Page 88

DSMC analysis in a heterogeneous parallel computing environment

A methodology for implementing parallel DSMC codes in a heterogeneous computing environment is described. The methodology involves the use of a common message-passing software library together with recently developed software that handles the actual interprocessor communications in a standard manner across a variety of computing platforms. Benchmark tests using a simple DSMC model problem were performed on an Intel iPSC/860, a Cray-YMP and a group of Sun workstations. The approach was found to give speedups that scaled linearly with problem size on all the computing platforms tested. This methodology was then incorporated into a production-type DSMC code to allow the simulation of problems that would not otherwise have been practical. The application of this production code to simulations of hypersonic shear flows and shock-lip interactions under near-continuum conditions is described. Synchronous and asynchronous models for implementing parallelism into DSMC simulations are also described and both models are shown to produce the same steady-state result.

Wilmoth, R. G.↗

Machine learning visualization tool for exploring parameterized hydrodynamics

We are interested in the computational study of shock hydrodynamics, i.e. problems involving compressible solids, liquids, and gases that undergo large deformation. These problems are dynamic and nonlinear and can exhibit complex instabilities. Due to advances in high performance computing it is possible to parameterize a hydrodynamic problem and perform a computational study yielding $\mathscr{O} (TB)$ of simulation state data. We present an interactive machine learning tool that can be used to compress, browse, and interpolate these large simulation datasets. This tool allows computational scientists and researchers to quickly visualize 'what-if' situations, perform sensitivity analyses, and optimize complex hydrodynamic experiments.

97 MATHEMATICS AND COMPUTING↗

ISMB Conference Funding to Support Attendance of Early Researchers and Students

ISMB Conference Funding for Students and Young Scientists Historical Description The Intelligent Systems for Molecular Biology (ISMB) conference has provided a general forum for disseminating the latest developments in bioinformatics on an annual basis for the past 22 years. ISMB is a multidisciplinary conference that brings together scientists from computer science, molecular biology, mathematics and statistics. The goal of the ISMB meeting is to bring together biologists and computational scientists in a focus on actual biological problems, i.e., not simply theoretical calculations. The combined focus on “intelligent systems” and actual biological data makes ISMB a unique and highly important meeting. 21 years of experience in holding the conference has resulted in a consistently well-organized, well attended, and highly respected annual conference. "Intelligent systems" include any software which goes beyond straightforward, closed-form algorithms or standard database technologies, and encompasses those that view data in a symbolic fashion, learn from examples, consolidate multiple levels of abstraction, or synthesize results to be cognitively tractable to a human, including the development and application of advanced computational methods for biological problems. Relevant computational techniques include, but are not limited to: machine learning, pattern recognition, knowledge representation, databases, combinatorics, stochastic modeling, string and graph algorithms, linguistic methods, robotics, constraint satisfaction, and parallel computation. Biological areas of interest include molecular structure, genomics, molecular sequence analysis, evolution and phylogenetics, molecular interactions, metabolic pathways, regulatory networks, developmental control, and molecular biology generally. Emphasis is placed on the validation of methods using real data sets, on practical applications in the biological sciences, and on development of novel computational techniques. The ISMB conferences are distinguished from many other conferences in computational biology or artificial intelligence by an insistence that the researchers work with real molecular biology data, not theoretical or toy examples; and from many other biological conferences by providing a forum for technical advances as they occur, which otherwise may be shunned until a firm experimental result is published. The resulting intellectual richness and cross-disciplinary diversity provides an important opportunity for both students and senior researchers. ISMB has become the premier conference series in this field with refereed, published proceedings, establishing an infrastructure to promote the growing body of research.

60 APPLIED LIFE SCIENCES↗

Paracousti-UQ: A Stochastic 3-D Acoustic Wave Propagation Algorithm.

Acoustic full waveform algorithms, such as Paracousti, provide deterministic solutions in complex, 3-D variable environments. In reality, environmental and source characteristics are often only known in a statistical sense. Thus, to fully characterize the expected sound levels within an environment, this uncertainty in environmental and source factors should be incorporated into the acoustic simulations. Performing Monte Carlo (MC) simulations is one method of assessing this uncertainty, but it can quickly become computationally intractable for realistic problems. An alternative method, using the technique of stochastic partial differential equations (SPDE), allows computation of the statistical properties of output signals at a fraction of the computational cost of MC. Paracousti-UQ solves the SPDE system of 3-D acoustic wave propagation equations and provides estimates of the uncertainty of the output simulated wave field (e.g., amplitudes, waveforms) based on estimated probability distributions of the input medium and source parameters. This report describes the derivation of the stochastic partial differential equations, their implementation, and comparison of Paracousti-UQ results with MC simulations using simple models.

97 MATHEMATICS AND COMPUTING↗

Investigation of the epoch state filter

A navigation filtering technique has been formulated using as state variables the initial or epoch position and velocity of the spacecraft. The estimate of this initial state is then improved by filtering new measurements. The current state may be obtained by a conic extrapolation of the epoch state. Results of a digital computer simulation of the epoch state filter show that this formulation of the navigational problem results in less computer run time and less computer storage space than conventional techniques. The errors produced by this technique have been demonstrated to be comparable to those obtained by conventional maximum-likelihood filtering.

Edwards, J. A.↗

Nonstationary homogeneous nucleation

The theory of homogeneous condensation is reviewed and equations describing this process are presented. Numerical computer solutions to transient problems in nucleation (relaxation to steady state) are presented and compared to a prior computation.

Harstad, K. G.↗

Development of an orthotropic hole element

A finite element was developed which adequately represents the state of stress in the region around a circular hole in orthotropic material experiencing reasonably general loading. This was achieved with a complementary virtual work formulation of the stiffness and stress matrices for a square element with center circular hole. The assumed stress state provides zero shearing stress on the hole boundary, so the element is suitable for problems involving load transfer without friction. The element has been implemented in the NASTRAN computer program, and sample problem results are presented.

Smith, C. V.↗

The appliation of potential CFD methods to helicopter hover flows

Fixed-wing code development is now aimed primarily at the solution of problems dominated by separation--based on the assumptions that the ability to solve such problems implies the ability to solve all other problems and that present inviscid method are already adequate for most other problems. Neither of the above assumptions are correct for rotary wing problems. This is because of the unique and overriding importance of wake modeling to rotor problems and also due to the well-known numerical diffusion problems which convectional Eulerian Computational fluid dynamics (CFD) method encounter when called on to convect strong vortical regions for long distances. The need for accurate wake analyses is probably the most fundamental difference between rotory and fixed-wing aerodynamics. In addition, rotary wing complexity requires a much more intimate relationship between test and analysis than is common in fixed-wing work. With these issues in mind, this paper will review some of our recent experience in using a unique-Eulerian-Lagrangian Computational fluid dynamics (CFC) method for the solution of a critical rotor-wake problem--the prediction of hover performance.

Caradonna, F. X.↗

A Single Thread to Fortran Coarray Transition Process for the Control Algorithm in the Space Radiation Code HZETRN

Exa-scale computing is the direction by industry and government are going to generate solutions to problems they deem necessary. Computing hardware is being developed to achieve the transition from Peta-scale to Exa-scale with more CPUs (Central Processing Units) that have more cores per CPU and more accelerators (GPGPUs (General Purpose Graphics Processing Units) and MICs (Many Integrated Cores)) per node. To fully utilize the hardware available now and in the future, algorithms must become multi-threaded. There are a few methods to generate multi-threaded software such as MPI (Message Passing Interface) and OpenMP (Multi-Processing) / OpenACC (ACCelerator). This paper concentrates on using Coarray Fortran to convert the Fortran 95 based HZETRN (High Z and Energy TRaNsport) code's control algorithm from a single threaded code to a multithreaded code. The resultant Coarray code was 32.5 times faster (with a theoretical speed-up of 74.5 times) than the single threaded version on the hardware tested, as reliable as the Fortran 95 version, and, as it uses native Fortran, was as maintainable as the Fortran 95 version. The Coarray code can be maintained by the same project engineers and scientists who created the original single threaded code. This transition process can be utilized on a C language based code with a compiler that has the UPC (Universal Parallel C) extensions to C.

Singleterry, Robert C., Jr.↗

Problem-tailored Simulation of Energy Transport on Noisy Quantum Computers

The transport of conserved quantities like spin and charge is fundamental to characterizing the behavior of quantum many-body systems. Numerically simulating such dynamics is generically challenging, which motivates the consideration of quantum computing strategies. However, the relatively high gate errors and limited coherence times of today's quantum computers pose their own challenge, highlighting the need to be frugal with quantum resources. In this work we report simulations on quantum hardware of infinite-temperature energy transport in the mixed-field Ising chain, a paradigmatic many-body system that can exhibit a range of transport behaviors at intermediate times. We consider a chain with L = 12 sites and find results broadly consistent with those from ideal circuit simulators over 90 Trotter steps, containing up to 990 entangling gates. To obtain these results, we use two key problem-tailored insights. First, we identify a convenient basis – the Pauli Y basis – in which to sample the infinite-temperature trace and provide theoretical and numerical justifications for its efficiency relative to, e.g., the computational basis. Second, in addition to a variety of problem-agnostic error mitigation strategies, we employ a renormalization strategy that compensates for global nonconservation of energy due to device noise. We discuss the applicability of the proposed sampling approach beyond the mixed-field Ising chain and formulate a variational method to search for a sampling basis with small sample-to-sample fluctuations for an arbitrary Hamiltonian. This opens the door to applying these techniques in more general models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

Large Angle Transient Dynamics (LATDYN) demonstration problem manual

LATDYN is a computer code for modeling the Large Angle Transient Dynamics of structures. The objective in developing the code was to investigate new techniques for analyzing flexible deformation and control/structure interaction problems associated with large angular motions of spacecraft. Such motions may consist of pointing the entire spacecraft or articulation of individual components, events which occur frequently during construction, operation, and maintenance of large spacecraft. This type of analysis is beyond the routine capability of conventional analytical tools without simplifying assumptions. In some instances, the motion may be sufficiently slow and the spacecraft (or component) sufficiently rigid to simplify the analysis of dynamics and controls by making pseudo-static and/or rigid body assumptions. LATDYN introduces a new approach to the problem by combining finite element structural analysis, multi-body dynamics, and control system analysis in a single tool. It includes a new type of finite element that can deform and rotate through large angles at the same time, and which can be connected to other finite elements either rigidly or through mechanical joints. LATDYN also provides symbolic capabilities for modeling control systems which are interfaced directly with the finite element structural model. Thus, the nonlinear equations representing the structural model are integrated along with the equations representing sensors, processing, and controls as a coupled system.

Wu, Shih-Chin↗

Deformation mechanisms, defects, heat treatment, and thermal conductivity in large grain niobium

The physical and mechanical metallurgy underlying fabrication of large grain cavities for superconducting radio frequency accelerators is summarized, based on research of 1) grain orientations in ingots, 2) a metallurgical assessment of processing a large grain single cell cavity and a tube, 3) assessment of slip behavior of single crystal tensile samples extracted from a high purity ingot slice before and after annealing at 800 °C / 2 h, 4) development of crystal plasticity models based upon the single crystal experiments, and 5) assessment of how thermal conductivity is affected by strain, heat treatment, and exposure to hydrogen. Because of the large grains, the plastic anisotropy of deformation is exaggerated, and heterogeneous strains and localized defects are present to a much greater degree than expected in polycrystalline material, making it highly desirable to computationally anticipate potential forming problems before manufacturing cavities.

36 MATERIALS SCIENCE↗

Enhancing statistical moment calculations for stochastic Galerkin solutions with Monte Carlo techniques

Here, we provide a method for enhancing stochastic Galerkin moment calculations to the linear elliptic equation with random diffusivity using an ensemble of Monte Carlo solutions. This hybrid approach combines the accuracy of low-order stochastic Galerkin and the computational efficiency of Monte Carlo methods to provide statistical moment estimates which are significantly more accurate than performing each method individually. The hybrid approach involves computing a low-order stochastic Galerkin solution, after which Monte Carlo techniques are used to estimate the residual. We show that the combined stochastic Galerkin solution and residual is superior in both time and accuracy for a one-dimensional test problem and a more computational intensive two-dimensional linear elliptic problem for both the mean and variance quantities.

97 MATHEMATICS AND COMPUTING↗

ICASE semiannual report, April 1 - September 30, 1989

The Institute conducts unclassified basic research in applied mathematics, numerical analysis, and computer science in order to extend and improve problem-solving capabilities in science and engineering, particularly in aeronautics and space. The major categories of the current Institute for Computer Applications in Science and Engineering (ICASE) research program are: (1) numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; (2) control and parameter identification problems, with emphasis on effective numerical methods; (3) computational problems in engineering and the physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and (4) computer systems and software, especially vector and parallel computers. ICASE reports are considered to be primarily preprints of manuscripts that have been submitted to appropriate research journals or that are to appear in conference proceedings.

Source record↗

Limitations of polynomial chaos expansions in the Bayesian solution of inverse problems

Polynomial chaos expansions are used to reduce the computational cost in the Bayesian solutions of inverse problems by creating a surrogate posterior that can be evaluated inexpensively. We show, by analysis and example, that when the data contain significant information beyond what is assumed in the prior, the surrogate posterior can be very different from the posterior, and the resulting estimates become inaccurate. One can improve the accuracy by adaptively increasing the order of the polynomial chaos, but the cost may increase too fast for this to be cost effective compared to Monte Carlo sampling without a surrogate posterior.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Engineering calculations for communications satellite systems planning

Observed solution times were analyzed for the extended gradient and cyclic coordinate search procedures. The times used in the analysis come from computer runs made during a previously-reported experiment conducted to assess the quality of the solutions to a BSS synthesis problem found by the two search methods. The results of a second experiment with a Fixed Satellite Service (FSS) test problem are also presented. Computational results are summarized for mixed integer programming approaches for solving FSS synthesis problems. A promising heuristic algorithm is described. A synthesis model is discussed for orbital arc allotment optimization. Research plans for the near future are also presented.

Reilly, C. H.↗

A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗