Search NASA⌕ Search

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.

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

At least 127 records · Page 7

Taylor approximation variance reduction for approximation errors in PDE-constrained Bayesian inverse problems

In numerous applications, surrogate models are used as a replacement for accurate parameter-to-observable mappings when solving large-scale inverse problems governed by partial differential equations (PDEs). The surrogate model may be a computationally cheaper alternative to the accurate parameter-to-observable mappings and/or may ignore additional unknowns or sources of uncertainty. The Bayesian approximation error (BAE) approach provides a means to account for the induced uncertainties and approximation errors, i.e. the errors between the accurate parameter-to-observable mapping and the surrogate. The statistics of these errors are, however, in general unknown a priori, and are thus calculated using Monte Carlo sampling. Although the sampling is typically carried out offline, i.e. before considering the data, the process can still represent a computational bottleneck. In this work, we develop a scalable computational approach for reducing the costs associated with the sampling stage of the BAE approach. Specifically, we consider the Taylor expansion of the accurate and surrogate forward models with respect to the uncertain parameter fields either as a control variate for variance reduction or as a means to directly and efficiently approximate the mean and covariance of the approximation errors. We propose efficient methods for evaluating the expressions for the mean and covariance of the Taylor approximations based on linear(-ized) PDE solves. Furthermore, the proposed approach is independent of the dimension of the uncertain parameter, depending instead on the intrinsic dimension of the data, ensuring scalability to high-dimensional problems. The potential benefits of the proposed approach are demonstrated for two high-dimensional inverse problems governed by PDE examples, namely for the estimation of a distributed Robin boundary coefficient in a linear diffusion problem, and for a coefficient estimation problem governed by a nonlinear diffusion problem.

Bayesian approximation error↗

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗

Use of the NLP10x10 Sequential Quadratic Programming Algorithm To Solve Rotorcraft Hub Loads Minimisation Problems

Previous research and experimentation on the use of a non-linear programming constrained optimisation technique to define an optimal control vector for rotorcraft applications indicated that use of this methodology was feasible and desirable in many cases. In particular, use of non-linear programming methods that solve a sequence of related quadratic-programming sub-problems were used successfully to solve these problems. Accordingly, a licence for one of the latest versions of Professor Klaus Schittkowskis very successful Sequential Quadratic Programming NLPQLP software was obtained and used to experiment with and analyse typical optimisation problems of the type encountered in various rotorcraft wind tunnel and flight tests. This research resulted in the development of the general NLPQLP Computation System that could be used to solve problems of the type encountered in various rotorcraft applications where there is a linear dependence of the measurement vector on the control vector, and where equality andor inequality constraints might be imposed. This development was accomplished on a mainframe computer not part of actual wind tunnel andor flight-test experiment, but in a format which was transferable to wind tunnel lap-top computers. Emphasis was directed toward obtaining efficiency, robustness and speed in computation.The System was developed in support of the five-bladed SMART Rotor Active Flap Rotor Hub Loads analytical minimisation research. The design and development of the Computation System was tailored to address the particular requirements of the problem to minimise a performance metric function of measured hub load harmonic angular couple components by optimising the control vector harmonic flap angular couple components subject to constraints on the amplitudes of these control vector harmonic flap angular couple components. In addition, to facilitate real time wind tunnel experimentation, the ability to rapidly selectchange the particular hub load harmonic angular couple components andor the particular control vector harmonic angular couple components to be considered in the optimisation procedure was provided in the System. This capability allows the singling out of particular hub load frequencies andor particular flap angle frequencies to be analysed during testing operations. The System was used very successfully for the SMART Active Flap Rotor Hub minimisation problems considered in the study, the results of which were presented at the American Helicopter Society Fifth Decennial Aeromechanics Specialist Conference in January 2014. Excellent agreement between cases initiated with best guess starting estimates for the control vector elements and cases initiated with zero control vector starting element estimates resulted, indicating the robustness of the NLP10x10 algorithm.

Rotorcraft Hub Loads↗

Spacecraft Observatory Benchmark Problem for Optical Disturbance Rejection

Since mid-1980s NASA has launched several first-generation interplanetary observatory missions. A salient feature of these missions has been the mounting of the optical payload on top of a large flexible space structure. This imposes challenging control-structure interaction problems (CSI) that have been studied over several decades. The Dec. 2021 launch of the James Webb Telescope marks the latest example of such a mission. One way to encourage development of novel control methods is to provide a benchmark problem for researchers. By the mid-2000s, there were a few well-known benchmark problems developed by the control community with a focus on CSI applications. However, in the past 15 years, the control challenges in optical observation missions have shifted from CSI to line-of-sight (LOS) precision pointing. This is because popular designs of the second-generation (Gen II) space earth missions have eliminated the large structure interface by mounting the optical payload directly on top of a rigid bus platform. The focus now is to achieve accurate pointing with maximum rejection of the surrounding disturbances. The NASA Safety and Engineering Center (NESC) has tasked T he Aerospace Corporation to develop a Benchmark Problem to study the challenging control issues that Gen II observatory missions encounter. This software tool is to be released as a public domain platform aimed at government, academic, and industry researchers. The focus of this benchmark problem is for researchers to design a set of innovative payload control laws with the maximum Optical Disturbance Rejection (ODR) capability to meet a set of pre-defined μrad-level of LOS jitter requirements. This paper describes the development of the benchmark problem. Aerospace/NASA will provide an integrated LOS plant model and disturbance/command profiles for users to run their design and simulation with as well as a user’s guide describing the required interfaces. The Aerospace Corp is also working to develop a hardware fast steering mirror testbed for users to demonstrate their innovative design in real hardware, if so desired.

Spacecraft Observatory Benchmark Problem↗

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dimer piling problems and interacting field theory

The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We rediscover and explore an expression for the number of coverings of an arbitrary graph by arbitrary objects in terms of an interacting fermionic field theory first proposed by Samuel. Generalizations of the dimer tiling problem, which we call “dimer piling problems,” demand that each site be covered N times by indistinguishable dimers. Our field theory provides a solution of these problems in the large- N limit. We give a similar path integral representation for certain lattice coloring problems. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

State space approach to mixed boundary value problems.

A state-space procedure for the formulation and solution of mixed boundary value problems is established. This procedure is a natural extension of the method used in initial value problems; however, certain special theorems and rules must be developed. The scope of the applications of the approach includes beam, arch, and axisymmetric shell problems in structural analysis, boundary layer problems in fluid mechanics, and eigenvalue problems for deformable bodies. Many classical methods in these fields developed by Holzer, Prohl, Myklestad, Thomson, Love-Meissner, and others can be either simplified or unified under new light shed by the state-variable approach. A beam problem is included as an illustration.

Chen, C. F.↗

Conjugate quasilinear Dirichlet and Neumann problems and a posteriori error bounds

Quasilinear Dirichlet and Neumann problems on a rectangle D with boundary D prime are considered. Using these concepts, conjugate problems, that is, a pair of one Dirichlet and one Neumann problem, the minima of the energies of which add to zero, are introduced. From the concept of conjugate problems, two-sided bounds for the energy of the exact solution of any given Dirichlet or Neumann problem are constructed. These two-sided bounds for the energy at the exact solution are in turn used to obtain a posteriori error bounds for the norm of the difference of the approximate and exact solutions of the problem. These bounds do not involve the unknown exact solution and are easily constructed numerically.

Lavery, J. E.↗

The crack-contact and the free-end problem for a strip under residual stress

The plane problem for an infinite strip with two edge cracks under a given state of residual stress is considered. The residual stress is compressive near and at the surfaces and tensile in the interior of the strip. If the crack is deep enough to penetrate into the tensile zone, then the problem is one of crack-contact where the depth of the contact area is an unknown which depends on the crack depth and the residual stress profile. The problem has applications to the static fatigue of glass plates and is solved for three typical residual-stress profiles. In the limiting case of the crack's crossing the entire plate thickness, the problem becomes a stressfree end problem for a semiinfinite strip under a given residual-stress state away from the end. This is a typical stress diffusion problem in which decay behavior of the residual stress near and the nature of the normal displacement at the end of the semiinfinite strip are of special interest. For two typical residual-stress states the solution is obtained, and some numerical results are given.

Bakioglu, M.↗

Nonlinear singularly perturbed optimal control problems with singular arcs

A third order, nonlinear, singularly perturbed optimal control problem is considered under assumptions which assure that the full problem is singular and the reduced problem is nonsingular. The separation between the singular arc of the full problem and the optimal control law of the reduced one, both of which are hypersurfaces in state space, is of the same order as the small parameter of the 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. A numerical example is included.

Ardema, M. D.↗

A well posed boundary value problem in transonic gas dynamics

A new approach considered by Garabedian and Korn (1976) to solve a problem of airfoil design has led to a transonic boundary value problem. It remains to be shown that this problem is well posed. A description is presented of an investigation in which it is shown that a corresponding problem for the Tricomi equation is well posed. The solution to the boundary value problem is characterized, in a unique way, as a sum of two particular solutions. The Poisson formulas for the unit semicircle for the Euler-Poisson-Darboux equation are considered and reflection laws for solutions of the general Euler-Poisson-Darboux equation are established. It is proved that the considered boundary value problem for the case in which the involved function is periodic and continuous is well posed within the specified class of solutions.

Sanz, J. M.↗

Clarification process: Resolution of decision-problem conditions

A model of a general process which occurs in both decisionmaking and problem-solving tasks is presented. It is called the clarification model and is highly dependent on information flow. The model addresses the possible constraints of individual indifferences and experience in achieving success in resolving decision-problem conditions. As indicated, the application of the clarification process model is only necessary for certain classes of the basic decision-problem condition. With less complex decision problem conditions, certain phases of the model may be omitted. The model may be applied across a wide range of decision problem conditions. The model consists of two major components: (1) the five-phase prescriptive sequence (based on previous approaches to both concepts) and (2) the information manipulation function (which draws upon current ideas in the areas of information processing, computer programming, memory, and thinking). The two components are linked together to provide a structure that assists in understanding the process of resolving problems and making decisions.

Dieterly, D. L.↗

Decision-problem state analysis methodology

A methodology for analyzing a decision-problem state is presented. The methodology is based on the analysis of an incident in terms of the set of decision-problem conditions encountered. By decomposing the events that preceded an unwanted outcome, such as an accident, into the set of decision-problem conditions that were resolved, a more comprehensive understanding is possible. All human-error accidents are not caused by faulty decision-problem resolutions, but it appears to be one of the major areas of accidents cited in the literature. A three-phase methodology is presented which accommodates a wide spectrum of events. It allows for a systems content analysis of the available data to establish: (1) the resolutions made, (2) alternatives not considered, (3) resolutions missed, and (4) possible conditions not considered. The product is a map of the decision-problem conditions that were encountered as well as a projected, assumed set of conditions that should have been considered. The application of this methodology introduces a systematic approach to decomposing the events that transpired prior to the accident. The initial emphasis is on decision and problem resolution. The technique allows for a standardized method of accident into a scenario which may used for review or the development of a training simulation.

Dieterly, D. L.↗

Crack problems for a rectangular plate and an infinite strip

The general plane problem for an infinite strip containing multiple cracks perpendicular to its boundaries is considered. The problem is reduced to a system of singular integral equations. Two specific problems of practical interest are then studied in detail. The first problem explores the interaction effect of multiple edge cracks in a plate or beam under tension or bending. The second problem is that of a rectangular plate containing an arbitrarily oriented crack in the plane of symmetry. Particular emphasis is placed on the problem of a plate containing an edge crack and subjected to concentrated forces.

Civelek, M. B.↗

An investigation of the accuracy of finite difference methods in the solution of linear elasticity problems

The accuracy of the finite difference method in the solution of linear elasticity problems that involve either a stress discontinuity or a stress singularity is considered. Solutions to three elasticity problems are discussed in detail: a semi-infinite plane subjected to a uniform load over a portion of its boundary; a bimetallic plate under uniform tensile stress; and a long, midplane symmetric, fiber reinforced laminate subjected to uniform axial strain. Finite difference solutions to the three problems are compared with finite element solutions to corresponding problems. For the first problem a comparison with the exact solution is also made. The finite difference formulations for the three problems are based on second order finite difference formulas that provide for variable spacings in two perpendicular directions. Forward and backward difference formulas are used near boundaries where their use eliminates the need for fictitious grid points.

Bauld, N. R., Jr.↗

Elasticity solutions for a class of composite laminate problems with stress singularities

A study on the fundamental mechanics of fiber-reinforced composite laminates with stress singularities is presented. Based on the theory of anisotropic elasticity and Lekhnitskii's complex-variable stress potentials, a system of coupled governing partial differential equations are established. An eigenfunction expansion method is introduced to determine the orders of stress singularities in composite laminates with various geometric configurations and material systems. Complete elasticity solutions are obtained for this class of singular composite laminate mechanics problems. Homogeneous solutions in eigenfunction series and particular solutions in polynomials are presented for several cases of interest. Three examples are given to illustrate the method of approach and the basic nature of the singular laminate elasticity solutions. The first problem is the well-known laminate free-edge stress problem, which has a rather weak stress singularity. The second problem is the important composite delamination problem, which has a strong crack-tip stress singularity. The third problem is the commonly encountered bonded composite joints, which has a complex solution structure with moderate orders of stress singularities.

Wang, S. S.↗

Necessary conditions for maximax problems with application to aeroglide of hypervelocity vehicles

This paper presents the necessary conditions for solving Chebyshev minimax (or maximax) problems with bounded control. The jump conditions obtained are applicable to problems with single or multiple maxima. By using Contensou domain of maneuverability, it is shown that when the maxima are isolated single points the control is generally continuous at the jump point in the minimax problems and discontinuous in the maximax problems in which the first time derivative of the maximax function contains the control variable. The theory is applied to the problem of maximizing the flight radius in a closed circuit glide of a hypervelocity vehicle and to a maximax optimal control problem in which the control appears explicitly with the first time derivative of the maximax function.

Vinh, N. X.↗

Flight problem evaluation for Space Shuttle Orbiter

The flight problems experienced with the reusable Space Shuttle Orbiter have decreased during subsequent flights of each vehicle. By comparison to first flights of previous vehicles, the problems encountered on the initial flight of each new vehicle entering the fleet decreased. This improvement in turn has reduced the turnaround time between flights significantly and thus greatly enhanced the increased Space Shuttle launch frequency. The reusable manned space vehicle concept necessitated the development of a flight problem recognition and resolution system which would enable a thorough and timely vehicle turnaround flow. Flight evaluation, testing, and repair of manned spacecraft to enhance reliability and to ensure mission success is a unique activity. Real-time recognition of the flight problem, prompt isolation of the cause, and timely implementation of the corrective action are the keys to maintaining an operational fleet. Examples of flight problems that have been encountered as well as the corrective actions implemented during the first 24 Space Shuttle missions are presented. The corrective actions taken to preclude problem recurrence include modifications of hardware designs, manufacturing processes, flight software, test methods, and operational procedures.

Mechelay, Joseph E.↗