SEARCH · Search NASA

Results for “problem”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1972

A survey of methods of feasible directions for the solution of optimal control problems

Three methods of feasible directions for optimal control are reviewed. These methods are an extension of the Frank-Wolfe method, a dual method devised by Pironneau and Polack, and a Zontendijk method. The categories of continuous optimal control problems are shown as: (1) fixed time problems with fixed initial state, free terminal state, and simple constraints on the control; (2) fixed time problems with inequality constraints on both the initial and the terminal state and no control constraints; (3) free time problems with inequality constraints on the initial and terminal states and simple constraints on the control; and (4) fixed time problems with inequality state space contraints and constraints on the control. The nonlinear programming algorithms are derived for each of the methods in its associated category.

Polak, E.↗

NASA NTRS1972

General theory of spherically symmetric boundary-value problems of the linear transport theory.

A general theory of spherically symmetric boundary-value problems of the one-speed neutron transport theory is presented. The formulation is also applicable to the 'gray' problems of radiative transfer. The Green's function for the purely absorbing medium is utilized in obtaining the normal mode expansion of the angular densities for both interior and exterior problems. As the integral equations for unknown coefficients are regular, a general class of reduction operators is introduced to reduce such regular integral equations to singular ones with a Cauchy-type kernel. Such operators then permit one to solve the singular integral equations by the standard techniques due to Muskhelishvili. We discuss several spherically symmetric problems. However, the treatment is kept sufficiently general to deal with problems lacking azimuthal symmetry. In particular the procedure seems to work for regions whose boundary coincides with one of the coordinate surfaces for which the Helmholtz equation is separable.

Kanal, M.↗

NASA NTRS1973

First-order corrections to approximate solutions to two-point boundary-condition problems

A method, applicable to real time guidance, is developed for accurate solution to exo-atmospheric space flight optimization problems. In principle the method is applicable to many other two-point boundary-condition (TPBC) problems. The first step of the method is the iterative solution (using a shooting method) of a TPBC problem with differential equations simplified so that they may be solved analytically by means of a single closed-form solution over each stage of the flight. The second step is the addition of a closed-form correction to the solution to the TPBC problem obtained in the first step. The correction accounts (to first-order accuracy) for the errors due to the aforementioned simplifications. Numerical results are given for several orbital injection problems.

Andrus, J. F.↗

NASA NTRS1974

Contact and crack problems for an elastic wedge

The contact and the crack problems for an elastic wedge of arbitrary angle are considered. The problem is reduced to a singular integral equation which, in the general case, may have a generalized Cauchy kernel. The singularities under the stamp as well as at the wedge apex were studied, and the relevant stress intensity factors are defined. The problem was solved for various wedge geometries and loading conditions. The results may be applicable to certain foundation problems and to crack problems in symmetrically loaded wedges in which cracks initiate from the apex.

Erdogan, F.↗

NASA NTRS1975

Solution of an optimal control lifting body entry problem by an improved method of perturbation functions

This paper presents a solution to a complex lifting reentry three-degree-of-freedom problem by using the calculus of variations to minimize the integral of the sum of the aerodynamics loads and heat rate input to the vehicle. The entry problem considered does not have state and/or control constraints along the trajectory. The calculus of variations method applied to this problem gives rise to a set of necessary conditions which are used to formulate a two point boundary value (TPBV) problem. This TPBV problem is then numerically solved by an improved method of perturbation functions (IMPF) using several starting co-state vectors. These vectors were chosen so that each one had a larger norm with respect to show how the envelope of convergence is significantly increased using this method and cases are presented to point this out.

Garcia, F., Jr.↗

NASA NTRS1977

Effect of virtual memory on efficient solution of two model problems

Computers with virtual memory architecture allow programs to be written as if they were small enough to be contained in memory. Two types of problems are investigated to show that this luxury can lead to quite an inefficient performance if the programmer does not interact strongly with the characteristics of the operating system when developing the program. The two problems considered are the simultaneous solutions of a large linear system of equations by Gaussian elimination and a model three-dimensional finite-difference problem. The Control Data STAR-100 computer runs are made to demonstrate the inefficiencies of programming the problems in the manner one would naturally do if the problems were indeed, small enough to be contained in memory. Program redesigns are presented which achieve large improvements in performance through changes in the computational procedure and the data base arrangement.

Lambiotte, J. J., Jr.↗

NASA NTRS1979

Nonlinear singularly perturbed optimal control problems with singular arcs

Singular perturbation techniques are studied for dealing with singular arc problems by analyzing a relatively low-order but otherwise general system. This system encompasses many flight mechanic problems including Goddard's problem and a version of the minimum time-to-climb problem. Boundary layer solutions are constructed which are stable and reach the outer solution in a finite time. A uniformly valid composite solution is then formed from the reduced and boundary layer solutions. The value of the approximate solution is that it is relatively easy to obtain and does not involve singular arcs. To illustrate the utility of the results, the technique is used to obtain an approximate solution of a simplified version of the aircraft minimum time-to-climb problem.

Ardema, M. D.↗

NASA NTRS1979

On the multiplicity of solutions of the inverse problem for a vibrating beam

The paper considers a specific inverse problem for a vibrating beam with three nonsympathetic spectra. More specifically, the spectral data consist of the natural frequencies of vibration of the beam in the following three configurations: (1) clamped-clamped, (2) clamped-supported, and (3) clamped-free. The basic equations for an inhomogeneous discrete beam are derived, where this simple mechanical system provides valuable insight into the inverse problem. All the necessary ingredients for a consideration of the inverse problem are given. Attention is given to an analysis of the particular inverse problem for which the spectral data are associated with the natural frequencies of vibrations in the above configurations. It is shown that with such data, the inverse problem has a 2exp(N-1)-fold multiplicity of solutions.

Barcilon, V.↗

NASA NTRS1979

Singular perturbations and the sounding rocket problem

In this paper, Goddard's problem of maximizing the final altitude of a sounding rocket (a singular problem of optimal control) is analyzed using singular perturbation methods. The problem is first cast in singular perturbation form and then solved to zero order by adding boundary-layer corrections to the reduced solution. For a quadratic drag law, a closed-form solution is obtained, although consideration of a numerical example indicates that this solution is not useful for practical sounding rockets. However, use of state variable transformations allows a very accurate numerical approximation to be constructed. It is concluded that application of singular perturbation methods to the well-known sounding rocket problem indicates that these methods may have utility in dealing with singular problems of optimal control.

Ardema, M. D.↗

NASA NTRS1981

FRANOPP: Framework for analysis and optimization problems user's guide

Framework for analysis and optimization problems (FRANOPP) is a software aid for the study and solution of design (optimization) problems which provides the driving program and plotting capability for a user generated programming system. In addition to FRANOPP, the programming system also contains the optimization code CONMIN, and two user supplied codes, one for analysis and one for output. With FRANOPP the user is provided with five options for studying a design problem. Three of the options utilize the plot capability and present an indepth study of the design problem. The study can be focused on a history of the optimization process or on the interaction of variables within the design problem.

Riley, K. M.↗

NASA NTRS1982

Periodic orbits of the elliptic restricted problem for the Sun-Jupiter-Saturn system

A systematic approach to generate periodic orbits in the elliptic restricted problem of three bodies is introduced. The approach is based on (numerical) continuation from periodic orbits of the first and second kind in the circular restricted problem to periodic orbits in the elliptic restricted problem. Two families of periodic orbits of the elliptic restricted problem are found by this approach. The mass ratio of the primaries of these orbits is equal to that of the Sun-Jupiter system. The sidereal mean motions between the infinitesimal body and the smaller primary are in a 2:5 resonance, so as to approximate the Sun-Jupiter-Saturn system. The lineaar stabilities of these periodic orbits are studied as functions of the eccentricities of the primaries and of the infinitesimal body. The results show that both stable and unstable periodic orbits exist in the elliptic restricted problem that are close to the actual Sun-Jupiter-Saturn system. However, the periodic orbit closest to the actual Sun-Jupiter-Saturn system is (linearly) stable.

Kwok, J. H.↗

NASA NTRS1983

Higher modes of the Orr-Sommerfeld problem for boundary layer flows

The discrete spectrum of the Orr-Sommerfeld problem of hydrodynamic stability for boundary layer flows in semi-infinite regions is examined. Related questions concerning the continuous spectrum are also addressed. Emphasis is placed on the stability problem for the Blasius boundary layer profile. A general theoretical result is given which proves that the discrete spectrum of the Orr-Sommerfeld problem for boundary layer profiles (U(y), 0,0) has only a finite number of discrete modes when U(y) has derivatives of all orders. Details are given of a highly accurate numerical technique based on collocation with splines for the calculation of stability characteristics. The technique includes replacement of 'outer' boundary conditions by asymptotic forms based on the proper large parameter in the stability problem. Implementation of the asymptotic boundary conditions is such that there is no need to make apriori distinctions between subcases of the discrete spectrum or between the discrete and continuous spectrums. Typical calculations for the usual Blasius problem are presented.

Lakin, W. D.↗

NASA NTRS1982

Difference equation state approximations for nonlinear hereditary control problems

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems.

Rosen, I. G.↗

NASA NTRS1981

The Total Synthesis Problem of linear multivariable control. II - Unity feedback and the design morphism

Zames (1981) has observed that there is, in general, no 'separation principle' to guarantee optimality of a division between control law design and filtering of plant uncertainty. Peczkowski and Sain (1978) have solved a model matching problem using transfer functions. Taking into consideration this investigation, Peczkowski et al. (1979) proposed the Total Synthesis Problem (TSP), wherein both the command/output-response and command/control-response are to be synthesized, subject to the plant constraint. The TSP concept can be subdivided into a Nominal Design Problem (NDP), which is not dependent upon specific controller structures, and a Feedback Synthesis Problem (FSP), which is. Gejji (1980) found that NDP was characterized in terms of the plant structural matrices and a single, 'good' transfer function matrix. Sain et al. (1981) have extended this NDP work. The present investigation is concerned with a study of FSP for the unity feedback case. NDP, together with feedback synthesis, is understood as a Total Synthesis Problem.

Sain, M. K.↗

NASA NTRS1983

Transient thermal stress problem for a circumferentially cracked hollow cylinder

The paper is concerned with the transient thermal stress problem for a long hollow circular cylinder containing an internal axisymmetric circumferential edge crack that is suddenly cooled from inside. It is assumed that the transient thermal stress problem is quasi-static, i.e., the inertial effects are negligible. Also, all thermoelastic coupling effects and the possible temperature dependence of the thermoelastic constants are neglected. The problem is considered in two parts. The first part is the evaluation of transient thermal stresses in an uncracked cylinder; the second part is the isothermal perturbation problem for the cracked cylinder in which the crack surface tractions, equal and opposite to the thermal stresses obtained from the first problem, are the only external loads. The superposition of the two solutions gives results for the cracked cylinder.

Nied, H. F.↗

NASA NTRS1983

A new algorithm for constrained nonlinear least-squares problems, part 1

A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.

Hanson, R. J.↗

NASA NTRS1984

Difference equation state approximations for nonlinear hereditary control problems

Rosen, I. G.↗