Search NASA⌕ Search

SEARCH · Search NASA

Results for “Types Of 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

NCDC mass storage systems and technologies

National Climatic Data Center (NCDC) data management issues are discussed, such as nature of holdings, history of the site, popularity of data sets, media/technology used for storage, volume distributed per month, mode of distribution, most frequently encountered problems, type of media requested/used, and evolution of media. Current holdings at NCDC are 107.8 terabytes of digital data and about 0.3 terabytes of manuscript data. The nexrad radar system is expected to generate approximately 88 terabytes per year by 1996.

Davis, Dick↗
NASA NTRS2015

Kodiak: An Implementation Framework for Branch and Bound Algorithms

Recursive branch and bound algorithms are often used to refine and isolate solutions to several classes of global optimization problems. A rigorous computation framework for the solution of systems of equations and inequalities involving nonlinear real arithmetic over hyper-rectangular variable and parameter domains is presented. It is derived from a generic branch and bound algorithm that has been formally verified, and utilizes self-validating enclosure methods, namely interval arithmetic and, for polynomials and rational functions, Bernstein expansion. Since bounds computed by these enclosure methods are sound, this approach may be used reliably in software verification tools. Advantage is taken of the partial derivatives of the constraint functions involved in the system, firstly to reduce the branching factor by the use of bisection heuristics and secondly to permit the computation of bifurcation sets for systems of ordinary differential equations. The associated software development, Kodiak, is presented, along with examples of three different branch and bound problem types it implements.

Smith, Andrew P.↗
NASA NTRSDate not supplied

Trend Analysis of AI/ML Tools and Services in NASA

Usage of Machine Learning (ML) algorithms within NASA’s Science Mission Directorates have been increasing over the years. This can be quantitatively observed in the upward trends of ML usage found by analyzing the publications and presentations (in affiliation with NASA) available through NASA Technical Reports Server (NTRS) and PubMed Central(PMC). Identifying the problem types and class of ML algorithms used to tackle them across the divisions can present opportunities for collaborations, interdisciplinary projects and knowledge transfer for sustainable partnerships. In this presentation, we will present the trend analysis of ML algorithms used in different SMD divisions based on the publications and presentations publicly available. We identify these trends by leveraging ML algorithms which are able to search through the publication texts semantically; which are also highly scalable. We will also present an analysis on the available opensource tools and services in NASA leveraging AI/ML algorithms. This work will provide ample avenues for collaborative efforts across different disciplines based on the surfaced trends.

Slesa Adhikari↗
NASA NTRSDate not supplied

Trend Analysis of AI/ML Tools and Services in NASA

Usage of Machine Learning (ML) algorithms within NASA’s Science Mission Directorates have been increasing over theyears. This can be quantitatively observed in the upward trends of ML usage found by analyzing the publications andpresentations (in affiliation with NASA) available through NASA Technical Reports Server (NTRS) and PubMed Central(PMC). Identifying the problem types and class of ML algorithms used to tackle them across the divisions can presentopportunities for collaborations, interdisciplinary projects and knowledge transfer for sustainable partnerships. In thispresentation, we will present the trend analysis of ML algorithms used in different SMD divisions based on the publicationsand presentations publicly available. We identify these trends by leveraging ML algorithms which are able to search throughthe publication texts semantically; which are also highly scalable. We will also present an analysis on the available opensource tools and services in NASA leveraging AI/ML algorithms. This work will provide ample avenues for collaborativeefforts across different disciplines based on the surfaced trends.

Slesa Adhikari↗
NASA NTRSDate not supplied

Sensitivity Study of Dust-Induced Surface Erosion during Martian Planetary Entry

Large, global dust storms that periodically form in the Martian atmosphere pose a threat to NASA missions due to a lack of understanding of how they will affect the heat loading and mass loss of the entry vehicle’s thermal protection system (TPS). Previous studies have laid out viable methodologies for estimating the amount of surface recession from a significant dust storm, but rely on underlying modeling assumptions that are difficult to validate. The current work utilizes the DUST library, which is a Lagrangian particle solver under development at NASA Ames Research Center. DUST includes variable-fidelity fluid-particle coupling and has been tested for a wide range of problem types. The DUST library is used in conjunction with the US3D Naiver-Stokes solver. Using these tools, a sensitivity study is performed to determine the influence of the underlying dust modeling (drag coefficient, Nusselt number, and size distribution) on the surface erosion through a hypersonic Martian entry trajectory. The surface erosion was found to be insensitive to the drag and heating models, but was affected significantly by the size distributions parameters. The total recession was comparable to the thermochemical ablation predicted by material response codes, but the lack of a particle erosion model for PICA limits the predictive capability of the current work.

Thermal Protection Systems↗
NASA NTRS1979

A fast semi-implicit algorithm for problems of mixed type

Certain physical processes are modeled by partial differential equations which are parabolic over part of the domain and elliptic over the remainder. A family of semi-implicit algorithms which are well suited to initial-boundary value problems of this mixed type is discussed. One important feature of these algorithms is the use of an approximate inverse for the solution of the implicit linear system. A strong error analysis results in an estimate of the total error as a function of approximate inverse error e and time step h.

Frederickson, P. O.↗
NASA NTRS1981

Numerical boundary condition procedure for the transonic axisymmetric inverse problem

Two types of boundary condition procedures for the axisymmetric inverse problem are described. One is a Neumann type boundary condition (analogous to the analysis problem) and the other is a Dirichlet type boundary conditon, both requiring special treatments to make the inverse scheme numerically stable. The dummy point concept is utilized in implementing both. Results indicate the Dirichlet type inverse boundary condition is more robust and conceptually simpler to implement than the Neumann type procedure. A few results demonstrating the powerful capability of the newly developed inverse method that can handle both shocked as well as shockless body design are included.

Shankar, V.↗
NASA NTRS1989

Generic task problem solvers in Soar

Two trends can be discerned in research in problem solving architectures in the last few years. On one hand, interest in task-specific architectures has grown, wherein types of problems of general utility are identified, and special architectures that support the development of problem solving systems for those types of problems are proposed. These architectures help in the acquisition and specification of knowledge by providing inference methods that are appropriate for the type of problem. However, knowledge based systems which use only one type of problem solving method are very brittle, and adding more types of methods requires a principled approach to integrating them in a flexible way. Contrasting with this trend is the proposal for a flexible, general architecture contained in the work on Soar. Soar has features which make it attractive for flexible use of all potentially relevant knowledge or methods. But as the theory Soar does not make commitments to specific types of problem solvers or provide guidance for their construction. It was investigated how task-specific architectures can be constructed in Soar to retain as many of the advantages as possible of both approaches. Examples were used from the Generic Task approach for building knowledge based systems. Though this approach was developed and applied for a number of problems, the ideas are applicable to other task-specific approaches as well.

Johnson, Todd R.↗
NASA NTRS1984

On the solution of problems involving impact type loading

The response of beam and plate members to pulse and impact loading is investigated, and numerical methods are analyzed and compared. The equations of motion, the finite difference and finite element methods, the time integration/Runge-Kutta techniques, and material modeling are discussed in detail. It is found that both the finite difference and the finite element methods could be accurately employed to discretize the spatial variation in the displacements. Central differences or a fourth order Runge-Kutta algorithm could be used for the time integration. The total energy of the system would give the stability and accuracy of the solution. Results showed that the finite element method provided better efficiency in obtaining accurate solution than the finite difference method when a scalar processor is used. However, the finite difference method was more efficient on the vector processor. Therefore, the most efficient method of solution depends on the type of computer present for the analysis.

Moyer, E. T., Jr.↗
DOE OSTI2020

H2OI95: A Stand-Alone Fortran Code for Evaluating the IAPWS-95 Equation-of-State Model for Water (Rev. 1)

H2OI95 is a stand-alone Fortran code for evaluating the IAPWS-95 equation-of-state model for the thermodynamic properties of water. It also evaluates the corresponding thermochemical properties of water consistent with the CODATA recommendations. The IAPWS-95 model is based on a model equation for the dimensionless Helmholtz energy for which the primary variables are the inverse reduced temperature (τ = T cr /T ) and reduced density (δ = ρ/ρ cr ). Here T is the absolute temperature (K), ρ is density (kg/m³), and the subscript “ cr ” refers to the critical point of water (647.096 K and 22.064 MPa pressure in this model, for which ρ cr is 322 kg/m³). The code solves four basic types of problems, distinguished by the specified inputs: 1. Temperature (K) and density (ρ kg/m³) or reduced density (δ) 2. Temperature (K) and pressure (MPa). 3. Temperature (K) on the saturation (liquid-vapor equilibrium) curve 4. Pressure (MPa) on the saturation curve. Each type of problem is run using a corresponding input (text) file. All but the first type of problem require iteration. For example, to solve for desired temperature and pressure, the reduced density must be adjusted to give the desired pressure. Iteration is accomplished using the Newton-Raphson method, though the secant method is also used in solving the fourth type of problem. For the last three types of problems, H2OI95 has been used to conduct numerical studies of convergence and the problem of multiple numerical solutions, some of which are not physically valid. Obtaining valid results depends mainly on appropriate choice of starting values for the density. The default values used in H2OI95 appear to consistently lead to generally desired results. With modification (not addressed here), H2OI95 can be used to support SUPCRT92 and similar codes that compute chemical thermodynamic properties of species and reactions over a wide range of temperature and pressure (273.16-1273K and 0-1000 MPa). Version 1.1 of this software calculates an extended set of water properties, including some derivable solely from IAPWS-95, such as the isobaric thermal expansivity and the isothermal compressibility, and still other properties based on supplementary models sanctioned by IAPWS, including the dynamic viscosity, thermal conductivity, surface tension, and static dielectric constant, and various other properties (notably Debye-Hückel parameters) derivable from the dielectric constant and its partial derivatives with respect to temperature and pressure. A coding error in Version 1.0 was identified while testing the implementation of the viscosity model. This error is described in Appendix C. It mainly affects calculation of “higher order” properties such as compressibility and heat capacity near the critical point.

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

A neutral functional differential equation of Lurie type

The problem of Lurie is posed for systems described by a functional differential equation of neutral type. Sufficient conditions are obtained for absolute stability for the controlled system if it is assumed that the uncontrolled plant equation is uniformly asymptotically stable. Both the direct and indirect control cases are treated.

Chukwu, E. N.↗
NASA NTRS1988

Stochastic time-optimal control problems

Two types of stochastic time-optimal controls in a one-dimensional setting are considered. Multidimensional problems, in the case of complete state information available and the system modeled by stochastic differential equations, are studied under the formulation of minimizing the expected transient-response time. The necessary condition of optimality is the satisfaction for the value function of a parabolic partial differential equation with boundary conditions. The sufficient condition of optimality is also provided, based on Dynkin's formula. Finally, three examples are given.

Zhang, W.↗
DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗
DOE OSTI2024

MCNPs Easy Sources for (α,n) (MESA):Verification with Sources4c

MESA is intended to be a direct re-implementation of the algorithms documented in the Sources manual in C++. However, some fundamental changes to the computational structure and logic were made to avoid the use of goto, require consistency in input definition, and reduce computational approximations in later steps of three-layer problems. In addition, MESA uses α-decay information from ISC libraries (based on ENDF). In most cases, differences between Sources4c and MESA are dominated by differences in decay energy spectra and intensities. To verify this we have reproduced 6 problems that are documented examples or samples in Sources4c. These problems cover the three types of problems MESA currently supports: homogeneous, interface, and three-layer.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗