Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem solving”

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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

Structural Optimization for Reliability Using Nonlinear Goal Programming

This report details the development of a reliability based multi-objective design tool for solving structural optimization problems. Based on two different optimization techniques, namely sequential unconstrained minimization and nonlinear goal programming, the developed design method has the capability to take into account the effects of variability on the proposed design through a user specified reliability design criterion. In its sequential unconstrained minimization mode, the developed design tool uses a composite objective function, in conjunction with weight ordered design objectives, in order to take into account conflicting and multiple design criteria. Multiple design criteria of interest including structural weight, load induced stress and deflection, and mechanical reliability. The nonlinear goal programming mode, on the other hand, provides for a design method that eliminates the difficulty of having to define an objective function and constraints, while at the same time has the capability of handling rank ordered design objectives or goals. For simulation purposes the design of a pressure vessel cover plate was undertaken as a test bed for the newly developed design tool. The formulation of this structural optimization problem into sequential unconstrained minimization and goal programming form is presented. The resulting optimization problem was solved using: (i) the linear extended interior penalty function method algorithm; and (ii) Powell's conjugate directions method. Both single and multi-objective numerical test cases are included demonstrating the design tool's capabilities as it applies to this design problem.

El-Sayed, Mohamed E.↗
NASA NTRS1980

Discrete-continuous variable structural synthesis using dual methods

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Schmit, L. A.↗
NASA NTRS1993

A multilevel cost-space approach to solving the balanced long transportation problem

We develop a multilevel scheme for solving the balanced long transportation problem, that is, given a set (c(sub kj)) of shipping costs from a set of M supply nodes S(sub k) to a set of N demand nodes D(sub j), we seek to find a set of flows, (x(sub kj)), that minimizes the total cost Sigma(sub k=1)(exp M) Sigma(sub j=1)(exp N) x(sub kj)c(sub kj). We require that the problem be balanced, that is, the total demand must equal the total supply. Solution techniques for this problem are well known from optimization and linear programming. We examine this problem, however, in order to develop principles that can then be applied to more intractible problems of optimization. We develop a multigrid scheme for solving the problem, defining the grids, relaxation, and intergrid operators. Numerical experimentation shows that this line of research may prove fruitful. Further research directions are suggested.

Cavanaugh, Kevin J.↗
DOE OSTI2025

Adiabatic quantum support vector machines

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with an increasing number of features and an increasing number of data points in the training dataset. In conclusion, our scalability results show that the quantum approach obtains a 3.5–4.5x speedup over the classical approach on datasets with many (millions of) features.

Computational Complexity↗
DOE OSTI2025

Solving the “Coloring Problem” in InPd 3– x Ag x ( x = 0–0.7) by Phase Diagrams Modeling and Diffraction Experiments

Here, a series of InPd 3–x Ag x (x = 0–1) compositions were synthesized by conventional high-temperature synthesis, and as-synthesized samples were characterized by powder X-ray diffraction experiments. Up to x = 0.7, InPd 3–x Ag x adopts the ternary substitutional variant of the InPd 3 structure (TiAl 3 -type), when x > 0.7, elemental Ag starts to segregate along with the main phase. Accurate structural characterization in InPd 3–x Ag x faces a critical challenge due to the narrow X-ray scattering contrast among constituents In, Pd, and Ag and nearly identical neutron scattering lengths of Pd and Ag. To overcome this “coloring problem”, a combination of calculation of phase diagrams modeling (CALPHAD) and diffraction techniques (X-ray and neutron) was employed. In the compositional range 0 ≤ x ≤ 0.7, InPd 3–x Ag x presents a ternary variant of the TiAl 3 -type structure, where Ag atoms selectively substitute one (the 2b Wyckoff site) of the two Pd sites in InPd 3 . Notably, in contrast to the isologous InPd 3–x Cu x (x = 0–1) system, Ag substitution does not form an ordered VRh 2 Sn-type structure at the limiting composition. The distinct site preference in InPd 3–x Ag x is elucidated by charge population analysis, electronic structure calculations, and orbital-resolved chemical bonding investigations, and the extent of substitution is supported by formation free energy calculations.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Solving k –SAT problems with generalized quantum measurement

We generalize the projection–based quantum measurement–driven k –SAT algorithm of Benjamin, Zhao, and Fitzsimons to arbitrary strength quantum measurements, including the limit of continuous monitoring. In doing so, we clarify that this algorithm is a particular case of the measurement–driven quantum control strategy elsewhere referred to as “Zeno dragging”. We argue that the algorithm is most efficient with finite time and measurement resources in the continuum limit, where measurements have an infinitesimal strength and duration. Moreover, for solvable k -SAT problems, the dynamics generated by the algorithm converge deterministically towards target dynamics in the long–time (Zeno) limit, implying that the algorithm can successfully operate autonomously via Lindblad dissipation, without detection. We subsequently study both the conditional and unconditional dynamics of the algorithm implemented via generalized measurements, quantifying the advantages of detection for heralding errors. These strategies are investigated first in a computationally–trivial 2-qubit 2-SAT problem to build intuition, and then we consider the scaling of the algorithm on 3-SAT problems encoded with 4–10 qubits. We numerically investigate the scaling of 3-SAT with respect to algorithmic runtime and find that the optimized time to solution scales with qubit number n as λ n , where λ is slightly larger than $\sqrt{2}$ for unconditional dynamics and less than $\sqrt{2}$ for conditional dynamics. We assess the implications for using this analog measurement–driven approach to quantum computing in practice.

quantum information↗
NASA NTRS1974

Solving multiple scattering problems in planetary atmospheres

Definitions are provided of the basic concepts occurring in the solution of multiple scattering problems involving planetary atmospheres and attention is given to aspects of problem characterization. Approaches are considered for finding the answer to a particular problem without the performance of detailed calculations. The characteristics of albedos are investigated, taking into account semiinfinite atmospheres and finite atmospheres. Questions of surface illumination are discussed along with aspects related to energy deposition in the atmosphere, intensity, and polarization. Precise numerical methods are examined and analytical solutions are presented.

Irvine, W. M.↗
NASA NTRS1974

Solving multiple scattering problems in planetary atmospheres

Multiple scattering problems, radiative transfer problems in planetary atmospheres within extended visible portion of the spectrum, are examined. The direct and inverse problems and the extinction coefficient are defined, along with other scattering characteristics. Albedos in semi-infinite and finite atmospheres are considered, as well as surface illumination, energy deposition, and polarization. The Eddington approximation figures prominently in the calculations. Precise numerical methods and analytical solutions are included.

Irvine, W. M.↗
NASA NTRS1978

Solving magnetostatic field problems with NASTRAN

Determining the three-dimensional magnetostatic field in current-induced situations has usually involved vector potentials, which can lead to excessive computational times. How such magnetic fields may be determined using scalar potentials is reviewed. It is shown how the heat transfer capability of NASTRAN level 17 was modified to take advantage of the new method.

Hurwitz, M. M.↗